| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/devtools-frontend/src/node_modules/uniq/ |
| H A D | README.md | 3 Removes all duplicates from an array in place.
26 ## `require("uniq")(array[, compare, sorted])`
27 Removes all duplicates from a sorted array in place.
29 * `array` is the array to remove items from
31 * `sorted` if true, then assume array is already sorted
35 **Time Complexity:** `O(array.length * log(arra.length))` or `O(array.length)` if `sorted`
42 * It also accepts a custom comparison function so you can remove duplicates from arrays containing …
|
| /dports/security/nyx/nyx-2.1.0/nyx/ |
| H A D | log.py | 114 runlevels.remove(r)
129 events.remove(r)
140 events.remove(nyx_runlevel)
155 nyx_ranges.remove(runlevel_range)
191 tor_events.remove(event_type)
193 return sorted(tor_events.union(nyx_events))
233 if not duplicate.duplicates:
237 entry.duplicates = duplicate.duplicates
254 last_entry.duplicates.pop()
302 self.duplicates = None
[all …]
|
| /dports/textproc/openjade/openjade-1.3.3-pre1/dsssl/examples/ |
| H A D | builtins.dsl | 103 (define (node-list-remove-duplicates nl)
142 (node-list-remove-duplicates (car args)))))
155 (node-list-remove-duplicates (car args)))))
164 (node-list-remove-duplicates (car args)))))
222 (node-list-length (node-list-remove-duplicates nl)))
321 (let ((sorted
324 (and (= (node-list-length sorted) 2)
325 (node-list=? (node-list-first sorted) snl1))))
332 (let ((sorted
334 (and (= (node-list-length sorted) 2)
[all …]
|
| /dports/textproc/openjade/openjade-1.3.3-pre1/dsssl/ |
| H A D | builtins.dsl | 103 (define (node-list-remove-duplicates nl)
142 (node-list-remove-duplicates (car args)))))
155 (node-list-remove-duplicates (car args)))))
164 (node-list-remove-duplicates (car args)))))
222 (node-list-length (node-list-remove-duplicates nl)))
321 (let ((sorted
324 (and (= (node-list-length sorted) 2)
325 (node-list=? (node-list-first sorted) snl1))))
332 (let ((sorted
334 (and (= (node-list-length sorted) 2)
[all …]
|
| /dports/textproc/py-orange3-text/orange3-text-1.3.1/doc/widgets/ |
| H A D | duplicatedetection.md | 4 Detect & remove duplicates from a corpus.
12 - Corpus Without Duplicated: Corpus with duplicates removed.
16 **Duplicate Detection** uses clustering to find duplicates in the corpus. It is great with the [Twi…
18 …e, the more similar the documents have to be in order to be considered duplicates. You can also se…
26 5. List of clusters at the selected threshold. They are sorted by size by default. Click on the clu…
33 …. IThe three data instances are identical. To use the data set without duplicates, use the first o…
|
| /dports/math/pari/pari-2.13.3/src/functions/programming/ |
| H A D | listsort | 9 ordering is the same as for sets and \tet{setsearch} can be used on a sorted
19 ? listsort(~L, 1); L \\ remove duplicates
24 is sorted in place and we avoid unnecessary copies.
|
| /dports/lang/racket/racket-8.3/share/pkgs/redex-benchmark/redex/benchmark/private/ |
| H A D | graph-data.rkt | 76 (remove-duplicates
81 (remove-duplicates
143 (define types (remove-duplicates
192 [sorted-times (hash)])
196 (hash-set sorted-times (cons name type)
198 (hash-ref sorted-times (cons name type)
201 (for/list ([(name/type times) (in-hash sorted-times)]
|
| /dports/science/opensph/sph-7de6c044339f649e3d19e61f735a6a24572b792a/core/quantities/ |
| H A D | Storage.cpp | 456 dependent.remove(i); in propagate()
566 mats.remove(matId); in merge()
726 ArrayView<const Size> sorted; in duplicate() local
729 sorted = idxs; in duplicate()
734 sorted = sortedHolder; in duplicate()
743 for (Size i : sorted) { in duplicate()
761 buffer.insert(mats[matId].to, duplicates.begin(), duplicates.end()); in duplicate()
788 Array<Type> duplicates; in duplicate() local
789 for (Size i : sorted) { in duplicate()
793 buffer.pushAll(duplicates.cbegin(), duplicates.cend()); in duplicate()
[all …]
|
| /dports/security/yubioath-desktop/yubioath-desktop-yubioath-desktop-5.0.4/qml/ |
| H A D | SortedListModel.qml | 3 // Implements a convenient ListModel that contains sorted items.
8 // insertSorted(obj) - uses binary search insertion sort, duplicates aren't allowed, last in wins.
39 var sorted = 0
40 while (sorted < indexes.length && sorted === indexes[sorted])
41 sorted++
42 if (sorted === indexes.length)
44 for (i = sorted; i < indexes.length; i++) {
51 listModel.remove(sorted, indexes.length - sorted)
|
| /dports/shells/ohmyzsh/ohmyzsh-6babcbd8841335a3c25ec960ff57ab9a139c9073/plugins/samtools/ |
| H A D | _samtools | 25 "merge[merge sorted alignments]" \
26 "rmdup[remove PCR duplicates]" \
|
| /dports/security/maltrail/maltrail-0.40/core/ |
| H A D | update.py | 77 duplicates = {}
119 filenames = sorted(glob.glob(os.path.join(_, "*.py")))
161 if item[0] not in duplicates:
162 duplicates[item[0]] = set((trails[item[0]][1],))
163 duplicates[item[0]].add(item[1][1])
256 del duplicates[key]
262 …if (key not in duplicates or len(duplicates[key]) < config.get("IP_MINIMUM_FEEDS", 3)) and re.sear…
299 if key in duplicates:
301 others = sorted(duplicates[key] - set((_[1],)))
361 os.remove(IPCAT_SQLITE_FILE)
[all …]
|
| /dports/lang/mosml/mosml-ver-2.10.1/src/compiler/ |
| H A D | Fnlib.sml | 92 fun remove k [] = [] function
93 | remove k (x :: xs) =
94 if k = x then xs else x :: (remove k xs)
108 (* The vector vec must be sorted *)
137 fun duplicates [] = false function
138 | duplicates (x :: xs) = member x xs orelse duplicates xs
|
| /dports/lang/mosml/mosml-ver-2.10.1/src/compiler.cminusminus/ |
| H A D | Fnlib.sml | 92 fun remove k [] = [] function
93 | remove k (x :: xs) =
94 if k = x then xs else x :: (remove k xs)
108 (* The vector vec must be sorted *)
137 fun duplicates [] = false function
138 | duplicates (x :: xs) = member x xs orelse duplicates xs
|
| /dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/gui2/ |
| H A D | auto_add.py | 18 from calibre.gui2.dialogs.duplicates import DuplicatesQuestion
112 for fname in sorted(files, key=safe_mtime):
227 duplicates = []
247 self.worker.staging.remove(fname)
281 duplicates.append(dups)
284 os.remove(path_to_remove)
285 self.worker.staging.remove(fname)
291 if duplicates:
293 for p, f, mis in duplicates:
299 dups = tuple(d.duplicates)
|
| /dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/srv/ |
| H A D | utils.py | 59 def items(self, duplicates=True): argument
62 if duplicates:
69 def values(self, duplicates=True): argument
72 if duplicates:
107 …'%s: %s' % (k, (repr(v) if isinstance(v, bytes) else v)) for k, v in sorted(self.items(), key=item…
230 …return tuple(map(itemgetter(0), sorted(map(item, parse_http_list(header_val)), key=itemgetter(1), …
328 os.remove(self.filename)
334 os.remove(f)
|
| /dports/lang/elm/elm-compiler-bootstrap-0.19.1/0.19.1/packages/elm/core/1.0.2/src/ |
| H A D | Set.elm | 3 , empty, singleton, insert, remove
14 Insert, remove, and query operations all take *O(log n)* time.
20 @docs empty, singleton, insert, remove
72 remove : comparable -> Set comparable -> Set comparable
73 remove key (Set_elm_builtin dict) = function
74 Set_elm_builtin (Dict.remove key dict)
120 {-| Convert a set into a list, sorted from lowest to highest.
127 {-| Convert a list into a set, removing any duplicates.
148 {-| Map a function onto a set, creating a new set with no duplicates.
|
| /dports/biology/ugene/ugene-40.1/data/workflow_samples/NGS/ |
| H A D | raw_dna.uwl | 13 # - Filtration of aligned reads by SAMtools to remove reads with low mapping quality, unpaired/u…
14 # - Removing of PCR duplicates.
18 … FastQC reports, the final result of the workflow running is a filtered, sorted, and indexed BAM f…
|
| /dports/deskutils/calibre/calibre-src-5.34.0/src/calibre/gui2/actions/ |
| H A D | add.py | 254 os.remove(pt.name)
358 os.remove(path)
364 os.remove(path)
372 duplicates = []
376 duplicates.append((book, existing_isbns[q]))
379 if duplicates:
385 ok += [x[0] for x in duplicates]
576 for author in sorted(merged, key=sort_key):
578 for title in sorted(merged[author]):
624 remove = {p for p in paths if ext(p) in ve}
[all …]
|
| /dports/devel/kBuild/kBuild-0.1.9998/src/kmk/tests/scripts/functions/ |
| H A D | suffix | 6 ."in the list. The long strings are sorted to remove duplicates.\n";
|
| /dports/devel/remake/remake-4.3+dbg-1.5/tests/scripts/functions/ |
| H A D | suffix | 6 ."in the list. The long strings are sorted to remove duplicates.\n";
|
| /dports/devel/gmake/make-4.3/tests/scripts/functions/ |
| H A D | suffix | 6 ."in the list. The long strings are sorted to remove duplicates.\n";
|
| /dports/math/octave-forge-splines/splines-1.3.4/inst/ |
| H A D | dedup.m | 20 ## Points are sorted in ascending order of @var{x}, with each set of duplicates (values with the sa…
32 ## De-duplicated and sorted @var{x}, @var{y}, @var{w}
51 #remove any rows with missing entries
|
| /dports/science/healpix/Healpix_3.50/src/idl/zzz_external/astron/ |
| H A D | match.pro | 46 ; You can use rem_dup function to remove duplicate values
60 ; sorted and the consecutive equal elements are identified. For integer
137 ; find duplicates in sorted combined list
155 ind = ind[dup] ;indices of duplicates
156 vec = vec[dup] ;vector id of duplicates
|
| /dports/lang/racket/racket-8.3/share/pkgs/plot-lib/plot/private/common/ |
| H A D | utils.rkt | 63 (: sorted-apply (All (A B) (-> (-> (Listof A) (Listof A))
66 (define ((sorted-apply sort f) lst)
68 (let ([sorted-lst (sort lst)])
69 (make-hash (map (inst pair A B) sorted-lst (f sorted-lst)))))
95 (let* ([bin-bounds (filter (λ (x) (not (eqv? x +nan.0))) (remove-duplicates bin-bounds))]
|
| /dports/devel/py-blist/blist-1.3.6/ |
| H A D | README.rst | 14 remove an item from the beginning or middle of the list, it has to
45 Maintain a sorted lists with bisect.insort O(log**2 n) O(n)
76 The sortedlist is a list that's always sorted. It's iterable and
78 methods you would use on a Python set (add, discard, or remove).
90 be used to change the sort order just like the sorted() function.
97 The sortedset is a set that's always sorted. It's iterable and
99 it's just like a sortedlist except that duplicates are ignored.
110 always sorted. The sorteddict should not be confused with Python
|