/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/devtools-frontend/src/node_modules/uri-js/src/ |
H A D | util.ts | 1 export function merge(...sets:Array<string>):string { 2 if (sets.length > 1) { 3 sets[0] = sets[0].slice(0, -1); 4 const xl = sets.length - 1; 6 sets[x] = sets[x].slice(1, -1); 8 sets[xl] = sets[xl].slice(1); 9 return sets.join(''); 11 return sets[0];
|
/dports/cad/openscad-devel/openscad-63a7c77740030c63d646eb0684ba6947eecb0db7/src/parameter/ |
H A D | parameterset.cpp | 21 const bool hasEntries = sets.is_initialized() && !sets.get().empty(); in isEmpty() 35 if (sets.is_initialized()) { in getParameterNames() 36 for (const auto &v : sets.get()) { in getParameterNames() 45 if (sets.is_initialized()) { in setNameExists() 46 for (const auto &v : sets.get()) { in setNameExists() 56 if (!sets.is_initialized()) { in getParameterSet() 57 return sets; in getParameterSet() 61 if(set!=sets.get().not_found()) { in getParameterSet() 64 return sets; in getParameterSet() 70 if (sets.is_initialized()) { in addParameterSet() [all …]
|
/dports/cad/openscad/openscad-41f58fe57c03457a3a8b4dc541ef5654ec3e8c78/src/parameter/ |
H A D | parameterset.cpp | 21 const bool hasEntries = sets.is_initialized() && !sets.get().empty(); in isEmpty() 35 if (sets.is_initialized()) { in getParameterNames() 36 for (const auto &v : sets.get()) { in getParameterNames() 45 if (sets.is_initialized()) { in setNameExists() 46 for (const auto &v : sets.get()) { in setNameExists() 56 if (!sets.is_initialized()) { in getParameterSet() 57 return sets; in getParameterSet() 61 if(set!=sets.get().not_found()) { in getParameterSet() 64 return sets; in getParameterSet() 70 if (sets.is_initialized()) { in addParameterSet() [all …]
|
/dports/net-im/dendrite/dendrite-0.5.1/vendor/github.com/yggdrasil-network/yggdrasil-go/contrib/ansible/ |
H A D | genkeys.go | 96 func sortKeySetArray(sets []keySet) []keySet { 97 for i := 0; i < len(sets); i++ { 98 sets = bubbleUpTo(sets, i) 100 return sets 103 func bubbleUpTo(sets []keySet, num int) []keySet { 104 for i := 0; i < len(sets)-num-1; i++ { 105 if isBetter(sets[i+1].pub, sets[i].pub) { 106 var tmp = sets[i] 107 sets[i] = sets[i+1] 108 sets[i+1] = tmp [all …]
|
/dports/x11-toolkits/gnustep-gui/libs-gui-gui-0_28_0/Tests/gui/NSSliderCell/ |
H A D | minMax.m | 76 pass([cell doubleValue] == 3.0, "setting nil objectValue sets value to min"); 88 pass([cell doubleValue] == 3.0, "setting 3 intValue sets value to 3.0"); 95 pass([cell doubleValue] == 3.0, "setting @'-5' objectValue sets value to min"); 99 pass([cell doubleValue] == 3.0, "setting @'-5' stringValue sets value to min"); 103 pass([cell doubleValue] == 3.0, "setting -5 intValue sets value to min"); 107 pass([cell doubleValue] == 3.0, "setting -5 doubleValue sets value to min"); 111 pass([cell doubleValue] == 3.0, "setting -5 floatValue sets value to min"); 124 pass([cell doubleValue] == 9.0, "setting 15 intValue sets value to max"); 125 pass([cell intValue] == 9, "setting 15 intValue sets value to max (integer)"); 128 pass([cell doubleValue] == 9.0, "setting 15 doubleValue sets value to max"); [all …]
|
/dports/games/easyrpg-player/Player-0.7.0/tests/ |
H A D | attribute.cpp | 75 auto sets = MakeAttributeSetArray(&as0); variable 80 auto sets = MakeAttributeSetArray(&as0, &as1); variable 88 auto sets = MakeAttributeSetArray(&as0); in testSingle() local 122 REQUIRE_EQ(Attribute::ApplyAttributeMultiplier(100, target, sets), 0); in testSingle() 152 auto sets = MakeAttributeSetArray(&as0); in testMaxMulti() local 163 auto sets = MakeAttributeSetArray(&as0); in testMaxMulti() local 166 REQUIRE_EQ(Attribute::ApplyAttributeMultiplier(100, target, sets), 0); in testMaxMulti() 173 auto sets = MakeAttributeSetArray(&as0); in testMaxMulti() local 199 auto sets = MakeAttributeSetArray(&as0); variable 249 auto sets = MakeAttributeSetArray(&as0); variable [all …]
|
/dports/biology/iqtree/IQ-TREE-2.0.6/terraphast/lib/ |
H A D | union_find_debug.hpp | 25 union_find_sets_iterator(const union_find& sets, index i = 0) in union_find_sets_iterator() argument 26 : m_sets{sets}, m_i{next_rep(i)} {} in union_find_sets_iterator() 38 const union_find& sets; member 39 union_find_sets_iterator begin() const { return {sets}; } in begin() 40 union_find_sets_iterator end() const { return {sets, sets.size()}; } in end() 60 union_find_set_iterator(const union_find& sets, index rep, index i = 0) in union_find_set_iterator() argument 61 : m_sets{sets}, m_rep{rep}, m_i{next(i)} {} in union_find_set_iterator() 73 const union_find& sets; member 75 union_find_set_iterator begin() const { return {sets, representative}; } in begin() 76 union_find_set_iterator end() const { return {sets, representative, sets.size()}; } in end()
|
/dports/sysutils/chaoskube/chaoskube-0.22.0/vendor/k8s.io/apimachinery/pkg/labels/ |
H A D | selector_test.go | 305 Vals sets.String 309 {"x", selection.NotIn, sets.NewString(), false}, 310 {"x", selection.In, sets.NewString("foo"), true}, 311 {"x", selection.NotIn, sets.NewString("foo"), true}, 314 {"1foo", selection.In, sets.NewString("bar"), true}, 315 {"1234", selection.In, sets.NewString("bar"), true}, 316 {"y", selection.GreaterThan, sets.NewString("1"), true}, 317 {"z", selection.LessThan, sets.NewString("6"), true}, 410 getRequirement("x", selection.In, sets.NewString(""), t), 462 getRequirement("x", selection.In, sets.NewString(""), t), [all …]
|
/dports/www/oauth2-proxy/oauth2-proxy-7.2.0/vendor/k8s.io/apimachinery/pkg/labels/ |
H A D | selector_test.go | 306 Vals sets.String 310 {"x", selection.NotIn, sets.NewString(), false}, 311 {"x", selection.In, sets.NewString("foo"), true}, 312 {"x", selection.NotIn, sets.NewString("foo"), true}, 315 {"1foo", selection.In, sets.NewString("bar"), true}, 316 {"1234", selection.In, sets.NewString("bar"), true}, 317 {"y", selection.GreaterThan, sets.NewString("1"), true}, 318 {"z", selection.LessThan, sets.NewString("6"), true}, 411 getRequirement("x", selection.In, sets.NewString(""), t), 463 getRequirement("x", selection.In, sets.NewString(""), t), [all …]
|
/dports/sysutils/helmfile/helmfile-0.138.7/vendor/k8s.io/apimachinery/pkg/labels/ |
H A D | selector_test.go | 306 Vals sets.String 310 {"x", selection.NotIn, sets.NewString(), false}, 311 {"x", selection.In, sets.NewString("foo"), true}, 312 {"x", selection.NotIn, sets.NewString("foo"), true}, 315 {"1foo", selection.In, sets.NewString("bar"), true}, 316 {"1234", selection.In, sets.NewString("bar"), true}, 317 {"y", selection.GreaterThan, sets.NewString("1"), true}, 318 {"z", selection.LessThan, sets.NewString("6"), true}, 411 getRequirement("x", selection.In, sets.NewString(""), t), 463 getRequirement("x", selection.In, sets.NewString(""), t), [all …]
|
/dports/net/inlets/inlets-3.0.2/vendor/k8s.io/apimachinery/apimachinery-0.20.1/pkg/labels/ |
H A D | selector_test.go | 305 Vals sets.String 309 {"x", selection.NotIn, sets.NewString(), false}, 310 {"x", selection.In, sets.NewString("foo"), true}, 311 {"x", selection.NotIn, sets.NewString("foo"), true}, 314 {"1foo", selection.In, sets.NewString("bar"), true}, 315 {"1234", selection.In, sets.NewString("bar"), true}, 316 {"y", selection.GreaterThan, sets.NewString("1"), true}, 317 {"z", selection.LessThan, sets.NewString("6"), true}, 410 getRequirement("x", selection.In, sets.NewString(""), t), 462 getRequirement("x", selection.In, sets.NewString(""), t), [all …]
|
/dports/sysutils/helm/helm-3.5.2/vendor/k8s.io/apimachinery/pkg/labels/ |
H A D | selector_test.go | 305 Vals sets.String 309 {"x", selection.NotIn, sets.NewString(), false}, 310 {"x", selection.In, sets.NewString("foo"), true}, 311 {"x", selection.NotIn, sets.NewString("foo"), true}, 314 {"1foo", selection.In, sets.NewString("bar"), true}, 315 {"1234", selection.In, sets.NewString("bar"), true}, 316 {"y", selection.GreaterThan, sets.NewString("1"), true}, 317 {"z", selection.LessThan, sets.NewString("6"), true}, 410 getRequirement("x", selection.In, sets.NewString(""), t), 462 getRequirement("x", selection.In, sets.NewString(""), t), [all …]
|
/dports/www/firefox/firefox-99.0/testing/web-platform/meta/service-workers/service-worker/ |
H A D | navigation-headers.https.html.ini | 4 …[POST Navigation, same-site with passthrough service worker sets correct origin and referer header… 10 [GET Navigation, same-origin with passthrough service worker sets correct sec-fetch headers.] 13 [POST Navigation, same-origin with passthrough service worker sets correct sec-fetch headers.] 16 [GET Navigation, same-site with passthrough service worker sets correct sec-fetch headers.] 19 [POST Navigation, same-site with passthrough service worker sets correct sec-fetch headers.] 22 [GET Navigation, same-site with navpreload service worker sets correct sec-fetch headers.] 25 [GET Navigation, cross-site with passthrough service worker sets correct sec-fetch headers.] 28 [POST Navigation, cross-site with passthrough service worker sets correct sec-fetch headers.] 31 [GET Navigation, cross-site with navpreload service worker sets correct sec-fetch headers.] 93 [POST Navigation, cross-site with fallback service worker sets correct sec-fetch headers.] [all …]
|
/dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/tools/spark/utils/ |
H A D | LargeLongHopscotchSet.java | 24 private final List<LongHopscotchSet> sets; field in LargeLongHopscotchSet 40 sets = new ArrayList<>(); in LargeLongHopscotchSet() 44 numSets = sets.size(); in LargeLongHopscotchSet() 53 sets = new ArrayList<>(numSets); in LargeLongHopscotchSet() 69 stream.writeInt(sets.size()); in serialize() 70 for (final LongHopscotchSet set : sets) { in serialize() 91 for (final LongHopscotchSet s : sets) { in size() 99 return sets; in getSets() 104 for (final LongHopscotchSet s : sets) { in capacity() 155 return numSets == that.numSets && sets.equals(that.sets); in equals() [all …]
|
/dports/databases/kexi/kexi-3.2.0/src/widget/dataviewcommon/ |
H A D | kexidataawarepropertyset.cpp | 43 qDeleteAll(sets); 44 sets.clear(); 106 d->sets[record] = 0; 115 return d->sets.size(); 120 qDeleteAll(d->sets); 121 d->sets.clear(); 122 d->sets.resize(1000); 136 d->sets.resize(newSize); 159 d->sets[record] = set; 247 d->sets.insert(record, 0); [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/ |
H A D | regmask.cpp | 191 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets() 193 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets() 195 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets() 197 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets() 201 _A[i] = sets; in clear_to_sets() 215 int sets = 0; in smear_to_sets() local 220 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets() 222 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets() 224 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets() 226 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/opto/ |
H A D | regmask.cpp | 192 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets() 194 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets() 196 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets() 198 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets() 202 _A[i] = sets; in clear_to_sets() 216 int sets = 0; in smear_to_sets() local 221 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets() 223 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets() 225 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets() 227 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/opto/ |
H A D | regmask.cpp | 191 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets() 193 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets() 195 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets() 197 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets() 201 _A[i] = sets; in clear_to_sets() 215 int sets = 0; in smear_to_sets() local 220 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets() 222 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets() 224 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets() 226 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets() [all …]
|
/dports/math/SCIP/scip-7.0.3/applications/Coloring/src/ |
H A D | reader_csol.c | 99 int** sets; in SCIP_DECL_READERREAD() local 190 sets[color][setlengths[color]] = i; in SCIP_DECL_READERREAD() 200 while ( sets[i][j] != -1 ) in SCIP_DECL_READERREAD() 209 sets[i][k] = node; in SCIP_DECL_READERREAD() 217 sets[i][k] = -1; in SCIP_DECL_READERREAD() 230 if ( tcliqueIsEdge(graph, sets[i][j], sets[i][k]) ) in SCIP_DECL_READERREAD() 250 if ( sets[i][j] == node ) in SCIP_DECL_READERREAD() 261 sets[i][setlengths[i]] = node; in SCIP_DECL_READERREAD() 262 sets[i][setlengths[i]+1] = -1; in SCIP_DECL_READERREAD() 297 SCIPfreeBufferArray(scip, &sets); in SCIP_DECL_READERREAD() [all …]
|
/dports/sysutils/kubectl/kubernetes-1.22.2/pkg/scheduler/internal/cache/ |
H A D | snapshot_test.go | 35 imageExistenceMap map[string]sets.String 58 imageExistenceMap: map[string]sets.String{ 60 "gcr.io/200:v1": sets.NewString("node-0"), 78 imageExistenceMap: map[string]sets.String{ 79 "gcr.io/10:v1": sets.NewString("node-1"), 80 "gcr.io/200:v1": sets.NewString(), 99 expected map[string]sets.String 136 expected: map[string]sets.String{ 138 "gcr.io/200:v1": sets.NewString("node-1"), 167 expected: map[string]sets.String{ [all …]
|
/dports/biology/ugene/ugene-40.1/src/corelibs/U2Lang/src/model/url_attribute/ |
H A D | URLAttribute.cpp | 33 sets << Dataset(); in URLAttribute() 35 value = qVariantFromValue<QList<Dataset>>(sets); in URLAttribute() 40 sets = newVal.value<QList<Dataset>>(); in setAttributeValue() 47 sets.clear(); in setAttributeValue() 48 sets << dSet; in setAttributeValue() 66 foreach (const Dataset &set, sets) { in isEmpty() 83 return sets; in getDatasets() 88 foreach (const Dataset &dSet, sets) { in updateValue() 109 foreach (const Dataset &dSet, sets) { in emptyDatasetNames() 120 sets = other.sets; in copy() [all …]
|
/dports/games/sets/sets-1.0.0/ |
H A D | sets.c | 151 if(sets[j]>sets[j+1]) {i=sets[j];sets[j]=sets[j+1];sets[j+1]=i;} in validset() 152 if(sets[j]>sets[j+2]) {i=sets[j];sets[j]=sets[j+2];sets[j+2]=i;} in validset() 153 if(sets[j+1]>sets[j+2]) {i=sets[j+1];sets[j+1]=sets[j+2];sets[j+2]=i;} in validset() 157 if(sets[k]==sets[j] && sets[k+1]==sets[j+1] && sets[k+2]==sets[j+2]) in validset() 397 fsets=sets; in findsets() 398 sets+=found*3; in findsets() 410 if(sets) in findsets() 419 *sets++=i; in findsets() 420 *sets++=j; in findsets() 421 *sets++=k; in findsets() [all …]
|
/dports/security/silktools/silk-3.19.1/src/rwset/tests/ |
H A D | rwsettool-union-data-v4.pl | 49 my %sets = ( 54 for my $s (keys %sets) { 55 $cmd = "cat /dev/null | $rwsetbuild $common_args - $sets{$s}"; 66 my %oldsets = %sets; 68 for my $s (keys %sets) { 70 $sets{$s} = "$tmpdir/$f.$s.union"; 74 ." | $rwsettool $common_args --output-path=$sets{$s}" 87 $cmd = "$rwsettool $common_args --intersect $sets{$s} $oldsets{$s}" 90 $cmd = "$rwsettool $common_args --intersect $oldsets{$s} $sets{$s}" 109 for my $s (keys %sets) { [all …]
|
H A D | rwsettool-union-data-v6.pl | 52 my %sets = ( 57 for my $s (keys %sets) { 58 $cmd = "cat /dev/null | $rwsetbuild $common_args - $sets{$s}"; 69 my %oldsets = %sets; 71 for my $s (keys %sets) { 73 $sets{$s} = "$tmpdir/$f.$s.union"; 77 ." | $rwsettool $common_args --output-path=$sets{$s}" 90 $cmd = "$rwsettool $common_args --intersect $sets{$s} $oldsets{$s}" 93 $cmd = "$rwsettool $common_args --intersect $oldsets{$s} $sets{$s}" 112 for my $s (keys %sets) { [all …]
|
/dports/math/cliquer/autocliquer-1.22/test/ |
H A D | testcases.c | 78 boolean maximal, int (*sets)[N]); 84 boolean maximal, int (*sets)[N]); 251 for (i=0; sets[i][0]; i++) { in list_contains() 252 if (set_size(s)==sets[i][0]) { in list_contains() 254 for (j=1; j<=sets[i][0]; j++) { in list_contains() 288 if (!list_contains(sets,s,NULL)) in test_single_clique() 305 if (!list_contains(sets,s,g)) in test_single_w_clique() 364 if (!list_contains(sets,s[i],g)) in test_all_w_cliques() 375 if (!list_contains(sets,s,g)) in user_function_count() 463 int (*sets)[N]; member [all …]
|