Home
last modified time | relevance | path

Searched refs:sets (Results 226 – 250 of 62713) sorted by relevance

12345678910>>...2509

/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/
H A DPolicy.java224 if (sets == null || sets.isEmpty()) { in createPolicy()
246 if (sets == null || sets.isEmpty()) { in createPolicy()
269 if (sets == null || sets.isEmpty()) { in createPolicy()
313 if (sets == null || sets.isEmpty()) { in Policy()
322 addAll(sets); in Policy()
340 this(toStringName, sets); in Policy()
384 if (sets == null || sets.isEmpty()) { in Policy()
393 addAll(sets); in Policy()
412 this(nsVersion, toStringName, sets); in Policy()
450 …assert (sets != null && !sets.isEmpty()) : LocalizationMessages.WSP_0036_PRIVATE_METHOD_DOES_NOT_A… in addAll()
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxws/src/share/jaxws_classes/com/sun/xml/internal/ws/policy/
H A DPolicy.java224 if (sets == null || sets.isEmpty()) { in createPolicy()
246 if (sets == null || sets.isEmpty()) { in createPolicy()
269 if (sets == null || sets.isEmpty()) { in createPolicy()
313 if (sets == null || sets.isEmpty()) { in Policy()
322 addAll(sets); in Policy()
340 this(toStringName, sets); in Policy()
384 if (sets == null || sets.isEmpty()) { in Policy()
393 addAll(sets); in Policy()
412 this(nsVersion, toStringName, sets); in Policy()
450 …assert (sets != null && !sets.isEmpty()) : LocalizationMessages.WSP_0036_PRIVATE_METHOD_DOES_NOT_A… in addAll()
[all …]
/dports/biology/p5-Bio-Phylo/Bio-Phylo-v2.0.1/lib/Bio/Phylo/
H A DListable.pm18 %sets,
519 $sets{$id} = {} if not $sets{$id};
521 $sets{$id}->{$setid} = $set;
537 my ( $self, $sets ) = @_;
539 $sets{$id} = {};
540 if ( $sets ) {
562 $sets{$id} = {} if not $sets{$id};
564 delete $sets{$id}->{$setid};
582 $sets{$id} = {} if not $sets{$id};
638 $sets{$id} = {} if not $sets{$id};
[all …]
/dports/math/py-Pyomo/Pyomo-6.1.2/pyomo/dae/
H A Dflatten.py145 new_sets = [s for s in subsets if s in sets]
146 other_sets = [s for s in subsets if s not in sets]
202 new_sets = [s for s in subsets if s in sets]
203 other_sets = [s for s in subsets if s not in sets]
314 index_map = ComponentMap(zip(sets, indices))
318 set_of_sets = ComponentSet(sets)
349 sets_list = list(sets for sets in sets_dict.values())
367 for sets, comps in zip(sets_list, comps_list):
368 if len(sets) == 1 and sets[0] is time:
370 elif len(sets) == 0 or (len(sets) == 1 and
[all …]
/dports/audio/umodplayer/umodplayer_B5.1/
H A Dipret.c97 sets.vol = 768; in CommandVolume()
99 sets.vol = 1; in CommandVolume()
133 sets.samplerate = r; in CommandSampleRate()
157 sets.resampling = 0; in CommandReSampling()
159 sets.resampling = 1; in CommandReSampling()
161 sets.resampling = 2; in CommandReSampling()
163 sets.resampling = 3; in CommandReSampling()
175 sets.channels = 1; in CommandChannels()
177 sets.channels = 2; in CommandChannels()
261 InitOptions(&sets); in CommandLoadConfig()
[all …]
H A Dcoresound.c104 MPSettings.mFlags = sets.flags; in CoreSound_InitOptions()
105 MPSettings.mChannels = sets.channels; in CoreSound_InitOptions()
107 MPSettings.mFrequency = sets.samplerate; in CoreSound_InitOptions()
109 MPSettings.mReverbDepth = sets.reverbDepth; in CoreSound_InitOptions()
110 MPSettings.mReverbDelay = sets.reverbDelay; in CoreSound_InitOptions()
111 MPSettings.mBassAmount = sets.bassAmount; in CoreSound_InitOptions()
112 MPSettings.mBassRange = sets.bassRange; in CoreSound_InitOptions()
118 ModPlug_SetMasterVolume(file.mod, sets.vol); in CoreSound_InitOptions()
136 fmt.rate = sets.samplerate; in CoreSound_InitAudio()
139 fmt.channels = sets.channels; in CoreSound_InitAudio()
[all …]
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.ua/org.eclipse.help.ui/src/org/eclipse/help/ui/internal/views/
H A DScopeSetManager.java45 sets.add(set); in add()
50 sets.remove(set); in remove()
86 ScopeSet set = sets.get(i); in save()
98 ScopeSet set = sets.get(i); in getScopeSets()
108 sets = new ArrayList<>(); in loadScopeSets()
125 sets.add(set); in loadScopeSets()
134 sets.add(set); in loadScopeSets()
138 if (sets.size() == 1) { in loadScopeSets()
139 activeSet = sets.get(0); in loadScopeSets()
143 sets.add(defSet); in loadScopeSets()
[all …]
/dports/net/gscloud/gscloud-0.11.0/vendor/k8s.io/apimachinery/pkg/labels/
H A Dselector_test.go311 Vals sets.String
328 Vals: sets.NewString(),
340 Vals: sets.NewString("foo"),
345 Vals: sets.NewString("foo"),
370 Vals: sets.NewString("foo"),
382 Vals: sets.NewString("bar"),
387 Vals: sets.NewString("bar"),
392 Vals: sets.NewString("1"),
397 Vals: sets.NewString("6"),
413 Vals: sets.NewString("bar"),
[all …]
/dports/devel/gitlab-runner/gitlab-runner-8925d9a06fd8e452e2161a768462652a2a13111f/vendor/k8s.io/apimachinery/apimachinery-0.21.1/pkg/labels/
H A Dselector_test.go311 Vals sets.String
328 Vals: sets.NewString(),
340 Vals: sets.NewString("foo"),
345 Vals: sets.NewString("foo"),
370 Vals: sets.NewString("foo"),
382 Vals: sets.NewString("bar"),
387 Vals: sets.NewString("bar"),
392 Vals: sets.NewString("1"),
397 Vals: sets.NewString("6"),
413 Vals: sets.NewString("bar"),
[all …]
/dports/net/yggdrasil/yggdrasil-go-0.3.11/contrib/ansible/
H A Dgenkeys.go107 func sortKeySetArray(sets []keySet) []keySet {
108 for i := 0; i < len(sets); i++ {
109 sets = bubbleUpTo(sets, i)
111 return sets
114 func bubbleUpTo(sets []keySet, num int) []keySet {
115 for i := 0; i < len(sets)-num-1; i++ {
116 if isBetter(sets[i+1].id, sets[i].id) {
117 var tmp = sets[i]
118 sets[i] = sets[i+1]
119 sets[i+1] = tmp
[all …]
/dports/security/silktools/silk-3.19.1/src/rwset/tests/
H A Drwsettool-union-data-v4v6.pl55 my %sets = (
60 for my $s (keys %sets) {
61 $cmd = "cat /dev/null | $rwsetbuild $common_args - $sets{$s}";
72 my %oldsets = %sets;
74 for my $s (keys %sets) {
76 $sets{$s} = "$tmpdir/$f.$s.union";
80 ." | $rwsettool $common_args --output-path=$sets{$s}"
93 $cmd = "$rwsettool $common_args --intersect $sets{$s} $oldsets{$s}"
96 $cmd = "$rwsettool $common_args --intersect $oldsets{$s} $sets{$s}"
115 for my $s (keys %sets) {
[all …]
/dports/lang/racket/racket-8.3/share/pkgs/data-lib/data/
H A Dunion-find.rkt190 (uf-union! (list-ref uf-sets 5) (list-ref uf-sets 7))
191 (uf-union! (list-ref uf-sets 1) (list-ref uf-sets 6))
192 (uf-union! (list-ref uf-sets 6) (list-ref uf-sets 5))
193 (uf-union! (list-ref uf-sets 4) (list-ref uf-sets 7))
194 (uf-union! (list-ref uf-sets 2) (list-ref uf-sets 0))
195 (uf-union! (list-ref uf-sets 2) (list-ref uf-sets 5))
201 (define (make-random-sets num-sets)
202 (define uf-sets
220 (define code `(let ([uf-sets
224 (values uf-sets edges code))
[all …]
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/tools/
H A Dgsets.cpp142 Range sets; in write_dot() local
144 dot_nodes( std::cout, sets ); in write_dot()
191 dot_get_sets( sets, named_sets, nameTag ); in dot_nodes()
203 dot_get_sets( sets, side_sets, sideTag ); in dot_nodes()
204 dot_get_sets( sets, node_sets, nodeTag ); in dot_nodes()
209 sets.swap(other_sets); in dot_nodes()
254 const Range& sets, in dot_children() argument
259 for (Range::iterator i = sets.begin(); i != sets.end(); ++i) { in dot_children()
262 parents = intersect( parents, sets ); in dot_children()
278 const Range& sets, in dot_contained() argument
[all …]
/dports/math/chaco/Chaco-2.2/code/klspiff/
H A Dmake_kl_list.c10 int make_kl_list(graph, movelist, buckets, listspace, sets, nsets, bspace, dvals, in make_kl_list() argument
16 short *sets; /* processor each vertex is assigned to */
44 if (sets[vtx] >= 0)
45 sets[vtx] = -sets[vtx] - 1;
58 if (sets[neighbor] >= 0) {
61 myset = sets[neighbor];
62 sets[neighbor] = -sets[neighbor] - 1;
83 sets[vtx] = -sets[vtx] - 1;
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dregmask.cpp272 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets()
274 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets()
276 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets()
278 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets()
282 _A[i] = sets; in clear_to_sets()
296 int sets = 0; in smear_to_sets() local
301 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets()
303 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets()
305 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets()
307 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets()
[all …]
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dregmask.cpp272 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets()
274 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets()
276 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets()
278 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets()
282 _A[i] = sets; in clear_to_sets()
296 int sets = 0; in smear_to_sets() local
301 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets()
303 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets()
305 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets()
307 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets()
[all …]
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/
H A Dregmask.cpp272 sets |= (sets>>1); // Smear 1 hi-bit into a set in clear_to_sets()
274 sets |= (sets>>2); // Smear 2 hi-bits into a set in clear_to_sets()
276 sets |= (sets>>4); // Smear 4 hi-bits into a set in clear_to_sets()
278 sets |= (sets>>8); // Smear 8 hi-bits into a set in clear_to_sets()
282 _A[i] = sets; in clear_to_sets()
296 int sets = 0; in smear_to_sets() local
301 sets |= (sets<<1); // Smear 1 lo-bit into a set in smear_to_sets()
303 sets |= (sets<<2); // Smear 2 lo-bits into a set in smear_to_sets()
305 sets |= (sets<<4); // Smear 4 lo-bits into a set in smear_to_sets()
307 sets |= (sets<<8); // Smear 8 lo-bits into a set in smear_to_sets()
[all …]
/dports/multimedia/v4l-utils/linux-5.13-rc2/arch/arm64/boot/dts/amazon/
H A Dalpine-v3.dtsi30 d-cache-sets = <256>;
33 i-cache-sets = <256>;
44 d-cache-sets = <256>;
47 i-cache-sets = <256>;
58 d-cache-sets = <256>;
61 i-cache-sets = <256>;
72 d-cache-sets = <256>;
75 i-cache-sets = <256>;
86 d-cache-sets = <256>;
89 i-cache-sets = <256>;
[all …]
/dports/multimedia/v4l_compat/linux-5.13-rc2/arch/arm64/boot/dts/amazon/
H A Dalpine-v3.dtsi30 d-cache-sets = <256>;
33 i-cache-sets = <256>;
44 d-cache-sets = <256>;
47 i-cache-sets = <256>;
58 d-cache-sets = <256>;
61 i-cache-sets = <256>;
72 d-cache-sets = <256>;
75 i-cache-sets = <256>;
86 d-cache-sets = <256>;
89 i-cache-sets = <256>;
[all …]
/dports/multimedia/libv4l/linux-5.13-rc2/arch/arm64/boot/dts/amazon/
H A Dalpine-v3.dtsi30 d-cache-sets = <256>;
33 i-cache-sets = <256>;
44 d-cache-sets = <256>;
47 i-cache-sets = <256>;
58 d-cache-sets = <256>;
61 i-cache-sets = <256>;
72 d-cache-sets = <256>;
75 i-cache-sets = <256>;
86 d-cache-sets = <256>;
89 i-cache-sets = <256>;
[all …]
/dports/x11-toolkits/qt5-charts/kde-qtcharts-5.15.2p2/src/charts/candlestickchart/
H A Dqcandlestickseries.cpp498 sets.append(set); in append()
500 return append(sets); in append()
517 sets.append(set); in remove()
519 return remove(sets); in remove()
584 sets.append(set); in insert()
603 sets.append(set); in take()
626 QList<QCandlestickSet *> sets = this->sets(); in clear() local
653 return sets().count(); in count()
1067 if (sets.count(set) != 1) in append()
1083 if (sets.count() == 0) in remove()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/
H A Dsetlist.pxd3 List of sets of integers, low-level C implementation
21 int **sets
32 if setlist.sets == NULL:
37 libc.stdlib.free(setlist.sets)
42 libc.stdlib.free(setlist.sets)
50 if setlist.sets[j] == NULL:
68 libc.stdlib.free(setlist.sets)
71 setlist.sets = NULL
88 if setlist.sets[n][i] == value:
96 setlist.sets[n] = p
[all …]
/dports/devel/py-guppy3/guppy3-3.1.2/guppy/sets/
H A D__init__.py1 from guppy.sets.setsc import BitSet # base bitset type
2 from guppy.sets.setsc import ImmBitSet # immutable bitset type
3 from guppy.sets.setsc import immbit # immutable bitset singleton constructor
4 from guppy.sets.setsc import immbitrange # immutable bitset range constructor
5 from guppy.sets.setsc import immbitset # immutable bitset constructor
6 from guppy.sets.setsc import MutBitSet # mutable bitset
7 from guppy.sets.setsc import NodeSet # base nodeset type
8 from guppy.sets.setsc import ImmNodeSet # immmutable nodeset type
9 from guppy.sets.setsc import MutNodeSet # mutable nodeset type
/dports/math/minizinc/libminizinc-2.5.5/tests/spec/examples/
H A Dsteiner-triples.mzn7 sets:
17 sets:
27 sets:
37 sets:
69 array[1..nb] of var set of 1..n: sets;
71 constraint forall(i in 1..nb) ( card(sets[i]) = 3 );
74 forall(i in 1..nb, j in i+1..nb) ( card(sets[i] intersect sets[j]) <= 1 );
77 constraint forall(i in 1..nb-1) ( sets[i] >= sets[i+1] );
79 solve :: set_search(sets, input_order, indomain_min, complete) satisfy;
81 output [ " " ++ show(sets[i]) | i in 1..nb ] ++ ["\n"];
/dports/ftp/paraget/paraget-0.3.0/
H A DMANIFEST24 mirror-sets/cpan
25 mirror-sets/debian
26 mirror-sets/freebsd
27 mirror-sets/gnome
28 mirror-sets/gnu
29 mirror-sets/kde
30 mirror-sets/linux
31 mirror-sets/mozilla
32 mirror-sets/openbsd
39 test/mirror-sets/cpan
[all …]

12345678910>>...2509