Try changing your code to this: Sub mergeCategoryValues() Dim lngRow As Long With ActiveSheet lngRow = .Cells(65536, 1).End(xlUp).Row .Cells(1).CurrentRegion.Sort key1:=.Cells(1), Header:=xlYes Do If .Cells(lngRow, 1) = .Cells(lngRow – 1, 1) Then .Cells(lngRow – 1, 3) = .Cells(lngRow – 1, 3) & “; ” & .Cells(lngRow, 3) .Cells(lngRow – 1, 4) = .Cells(lngRow – 1, 4) … Read more
I. XSLT 1.0 solution: Here is a solution using Muenchian grouping: <xsl:stylesheet version=”1.0″ xmlns:xsl=”http://www.w3.org/1999/XSL/Transform”> <xsl:output omit-xml-declaration=”yes” indent=”yes”/> <xsl:strip-space elements=”*”/> <xsl:key name=”kLineById” match=”Line” use=”ItemID|ITEMID”/> <xsl:template match=”node()|@*”> <xsl:copy> <xsl:apply-templates select=”node()|@*”/> </xsl:copy> </xsl:template> <xsl:template match= “Line[not(generate-id() = generate-id(key(‘kLineById’, ItemID|ITEMID)[1]))]” /> </xsl:stylesheet> Do Note: Muenchian grouping is the most efficient known general grouping method for XSLT 1.0. Pure “push” … Read more
arr = [[7,3], [7,3], [3,8], [7,3], [7,3], [1,2]]; function multiDimensionalUnique(arr) { var uniques = []; var itemsFound = {}; for(var i = 0, l = arr.length; i < l; i++) { var stringified = JSON.stringify(arr[i]); if(itemsFound[stringified]) { continue; } uniques.push(arr[i]); itemsFound[stringified] = true; } return uniques; } multiDimensionalUnique(arr); Explaination: Like you had mentioned, the other … Read more
You can use array#reduce and array#some. const arr = [ {label: ‘All’, value: ‘All’}, {label: ‘All’, value: ‘All’}, {label: ‘Alex’, value: ‘Ninja’}, {label: ‘Bill’, value: ‘Op’}, {label: ‘Cill’, value: ‘iopop’} ] var result = arr.reduce((unique, o) => { if(!unique.some(obj => obj.label === o.label && obj.value === o.value)) { unique.push(o); } return unique; },[]); console.log(result);
You could sort the array in O(nlog(n)), then simply look until the next number. That is substantially faster than your O(n^2) existing algorithm. The code is also a lot cleaner. Your code also doesn’t ensure no duplicates were inserted when they were re-entered. You need to prevent duplicates from existing in the first place. std::sort(userNumbers.begin(), … Read more
First. Sort in the order putting the less desired items last within id groups aa <- a[order(a$id, -abs(a$value) ), ] #sort by id and reverse of abs(value) Then: Remove items after the first within id groups aa[ !duplicated(aa$id), ] # take the first row within each id id value 2 1 2 4 2 -4 … Read more
While Scott Barta’s answer is correct, is lacks a simple and common solution: just add android { packagingOptions { exclude ‘META-INF/DEPENDENCIES’ exclude ‘META-INF/NOTICE’ exclude ‘META-INF/LICENSE’ exclude ‘META-INF/LICENSE.txt’ exclude ‘META-INF/NOTICE.txt’ } } to your build.gradle to ignore those duplicates.
Use the mpdecimate filter, whose purpose is to “Drop frames that do not differ greatly from the previous frame in order to reduce frame rate.” This will generate a console readout showing which frames the filter thinks are duplicates. ffmpeg -i input.mp4 -vf mpdecimate -loglevel debug -f null – To generate a video with the … Read more
I used Leonard Challis’s technique with a few changes: CREATE TEMPORARY TABLE tmptable_1 SELECT * FROM table WHERE primarykey = 1; UPDATE tmptable_1 SET primarykey = NULL; INSERT INTO table SELECT * FROM tmptable_1; DROP TEMPORARY TABLE IF EXISTS tmptable_1; As a temp table, there should never be more than one record, so you don’t … Read more
For example: counter = {} yourArray.forEach(function(obj) { var key = JSON.stringify(obj) counter[key] = (counter[key] || 0) + 1 }) Docs: Array.forEach, JSON.stringify.