Simple algorithm to remove duplicates from an array with occurrences of the same definition (or multiple definitions)?

Hi,

could be something like this:

mCheckMap =  new java.util.Hashtable();

for (i = 0; i < oObjOccList.length; i++){

   oObjOcc = oObjOccList[i];

   if (!mCheckMap.containsKey(oObjOcc.ObjDef().GUID())){

      mCheckMap.put(oObjOcc.ObjDef().GUID(), "");

      aoNewArray.push(oObjOcc)

   }

}

But perhaps you should go to ObjDef level instead from the beginning...

BR Robert

Robert Goldenbaum, thank you very much!!

Another solution, leveraging

• HashSet instead of HashMap since the map-values aren't used for anything useful anyways
• JavaScript array.filter method

function filterOccsByDefinitionGUID(occsToFilter) {
    var guidSet = Packages.java.util.HashSet();
    
    function filterOcc(someOcc) {
        return guidSet.add(someOcc.ObjDef().GUID());
    }
    
    return occsToFilter.filter(filterOcc);
}

var selOccs = ArisData.getSelectedObjOccs();
var result = filterOccsByDefinitionGUID(selOccs);

Hi.

Javascript version

function getFirstObjOccArray(objOccs) {
    const firstOccList = objOccs.reduce(function (list, nextObjOcc) {
        const guid = nextObjOcc.ObjDef().GUID() + '';
        if (!(guid in list)) {
            list[guid] = nextObjOcc;
        };
        return list;
    }, {});
    return Object.keys(firstOccList).map(function (nextKey) {
        return firstOccList[nextKey];
    });
} // getFirstObjOccArray