Thread: Isolate same records from one array to another.

Hello All,

By trade I'm an Oracle JD Edwards Developer, one of the toolsets available to me is an Oracle centric version of C++.

My task is to write from Array A to Array B the multiple occurrences of the same records. Below i will give a data representation of what my task is....

Thanks in advance....

Array A: --------- Array B:
aaa ---------------- ccc
bbb ---------------- ccc
ccc ---------------- ccc
ccc ---------------- ddd
ccc ---------------- ddd
ddd --------------- fff
ddd --------------- fff
eee
fff
fff
ggg

I suggest inserting the values into a std::map<std::string, std::size_t> or an equivalent std::unordered_map if order doesn't actually matter. This way, you map the values to the count of their frequencies, upon which you just need to iterate over the map once to extract those values for which the count is greater than 1.

Does the Oracle JD Edwards development environment support the C++ standard library? If it does, then this should be available.

If not, then you can always code your own by implementing a balanced binary tree or hash table.

Alternatively, you could sort the data then do a single pass to extract values that occur more than once. This could be easily done with std::sort, but again if your environment doesn't support the standard library you could always implement a sorting algorithm yourself.

Below is the code and debug....the data is also represented, the red highlighted row should NOT be in aBoxTrkD[j].szBoxNumberStringD. Hope this helps. When looking at the Debug, there shouldn't be spaces between entries....It is doing some of the work but not all....Apologies for the influx of updates.....

aBoxTrkA
0 085085000303985330 1Z8R9A510346043690
1 085085000303985330 1Z8R9A510347631301
2 085085000303985330 1Z8R9A510347814159
3 085085000303985330 1Z8R9A510347957540
4 085085000303985507 1Z8R9A510346913571
5 085085000303985507 1Z8R9A510347894671
6 085085000303985521 1Z8R9A510346303480
7 085085000303985521 1Z8R9A510347934163
8 085085000303985620 1Z8R9A510346043690
9 085085000303985637 1Z8R9A510346408331
10 085085000303985637 1Z8R9A510348212726
11 085085000303985729 1Z8R9A510347053436
12 085085000303985729 1Z8R9A510347622311


aBoxTrkD
0 085085000303985330 1Z8R9A510346043690
1 085085000303985330 1Z8R9A510347631301
2 085085000303985330 1Z8R9A510347814159
3 085085000303985330 1Z8R9A510347957540
4 085085000303985507 1Z8R9A510346913571
5 085085000303985507 1Z8R9A510347894671
6 085085000303985521 1Z8R9A510346303480
7 085085000303985521 1Z8R9A510347934163
8 085085000303985637 1Z8R9A510346408331
9 085085000303985637 1Z8R9A510348212726
10 085085000303985729 1Z8R9A510347053436
11 085085000303985729 1Z8R9A510347622311

Please post your code between [code][/code] tags.

Fuzzy pictures of just tiny parts of your code are not that useful.

TBH, there's no C++ in your example. It's just JDE wrapper functions around standard library functions like strcpy().


Create a new C++ project with a single source file containing the following.

Code:

#include <iostream>
#include <string>
#include <map>
int main ( ) {
}

Let's find out whether you actually have a C++ compiler with access to the standard library.

Perhaps you would benefit from writing a couple of utility functions (which you can test independently) to help with readability.

Code:

if ( ! productInList(aBoxTrkD,numEntriesInTrkD,aBoxTrkA[i]) ) {
    addToProductList(aBoxTrkD,numEntriesInTrkD,aBoxTrkA[i]);
    numEntriesInTrkD++;
}

Okay, so this is actually C, not C++. Let's leave this in C++ programming forum for now though, but in the future concerning this environment you should post in the C forum.

Now, is the data already sorted? Your sample input gives me the impression that that is so. Therefore, you don't need nested for loops: as I mentioned in post #4, a single pass will do:

Code:

j = 0
duplicate = false
duplicate_index = 0
for i = 1 to i = N
    if input[i] == input[duplicate_index]
        if not duplicate
            duplicate = true
            result[j++] = input[duplicate_index]
        result[j++] = input[i]
    else
        duplicate = false
        duplicate_index = i