Home
last modified time | relevance | path

Searched refs:enumer (Results 1 – 25 of 301) sorted by relevance

12345678910>>...13

/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/set/constraints/
H A DSumWeightedSet.java116 while (enumer.hasMoreElements()) in SumWeightedSet()
184 while (enumer.hasMoreElements()) in consistency()
202 enumer = potentialEl.valueEnumeration(); in consistency()
206 while (enumer.hasMoreElements()) { in consistency()
208 el = enumer.nextElement(); in consistency()
224 enumer = potentialEl.valueEnumeration(); in consistency()
226 while (enumer.hasMoreElements()) { in consistency()
228 el = enumer.nextElement(); in consistency()
244 while (enumer.hasMoreElements()) { in consistency()
246 el = enumer.nextElement(); in consistency()
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/ThirdParty/HDF5/src/itkhdf5/src/
H A DH5Tfields.c102 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
342 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_value()
347 …if(HDmemcmp(dt->shared->u.enumer.value + (j * size), dt->shared->u.enumer.value + ((j + 1) * size)… in H5T__sort_value()
349 char *tmp = dt->shared->u.enumer.name[j]; in H5T__sort_value()
350 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
351 dt->shared->u.enumer.name[j + 1] = tmp; in H5T__sort_value()
447 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_name()
453 dt->shared->u.enumer.name[j+1])>0) { in H5T__sort_name()
456 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j+1]; in H5T__sort_name()
457 dt->shared->u.enumer.name[j+1] = tmp; in H5T__sort_name()
[all …]
H A DH5Tenum.c211 if(dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
216 dt->shared->u.enumer.name = names; in H5T__enum_insert()
220 dt->shared->u.enumer.value = values; in H5T__enum_insert()
221 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
225 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
226 i = dt->shared->u.enumer.nmembs++; in H5T__enum_insert()
265 if (membno>=dt->shared->u.enumer.nmembs) in H5Tget_member_value()
407 if(dt->shared->u.enumer.nmembs == 0) in H5T_enum_nameof()
418 rt = copied_dt->shared->u.enumer.nmembs; in H5T_enum_nameof()
546 if (dt->shared->u.enumer.nmembs == 0) in H5T_enum_valueof()
[all …]
/dports/science/hdf5-18/hdf5-1.8.21/src/
H A DH5Tfields.c127 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
367 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_value()
372 …if(HDmemcmp(dt->shared->u.enumer.value + (j * size), dt->shared->u.enumer.value + ((j + 1) * size)… in H5T__sort_value()
374 char *tmp = dt->shared->u.enumer.name[j]; in H5T__sort_value()
375 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
376 dt->shared->u.enumer.name[j + 1] = tmp; in H5T__sort_value()
472 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_name()
478 dt->shared->u.enumer.name[j+1])>0) { in H5T__sort_name()
481 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j+1]; in H5T__sort_name()
482 dt->shared->u.enumer.name[j+1] = tmp; in H5T__sort_name()
[all …]
H A DH5Tenum.c234 if(dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
239 dt->shared->u.enumer.name = names; in H5T__enum_insert()
243 dt->shared->u.enumer.value = values; in H5T__enum_insert()
244 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
248 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
249 i = dt->shared->u.enumer.nmembs++; in H5T__enum_insert()
288 if (membno>=dt->shared->u.enumer.nmembs) in H5Tget_member_value()
430 if(dt->shared->u.enumer.nmembs == 0) in H5T_enum_nameof()
441 rt = copied_dt->shared->u.enumer.nmembs; in H5T_enum_nameof()
569 if (dt->shared->u.enumer.nmembs == 0) in H5T_enum_valueof()
[all …]
/dports/science/hdf5/hdf5-1.10.6/src/
H A DH5Tfields.c102 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
342 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_value()
347 …if(HDmemcmp(dt->shared->u.enumer.value + (j * size), dt->shared->u.enumer.value + ((j + 1) * size)… in H5T__sort_value()
349 char *tmp = dt->shared->u.enumer.name[j]; in H5T__sort_value()
350 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
351 dt->shared->u.enumer.name[j + 1] = tmp; in H5T__sort_value()
447 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_name()
453 dt->shared->u.enumer.name[j+1])>0) { in H5T__sort_name()
456 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j+1]; in H5T__sort_name()
457 dt->shared->u.enumer.name[j+1] = tmp; in H5T__sort_name()
[all …]
H A DH5Tenum.c211 if(dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
216 dt->shared->u.enumer.name = names; in H5T__enum_insert()
220 dt->shared->u.enumer.value = values; in H5T__enum_insert()
221 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
225 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
226 i = dt->shared->u.enumer.nmembs++; in H5T__enum_insert()
265 if (membno>=dt->shared->u.enumer.nmembs) in H5Tget_member_value()
407 if(dt->shared->u.enumer.nmembs == 0) in H5T_enum_nameof()
418 rt = copied_dt->shared->u.enumer.nmembs; in H5T_enum_nameof()
546 if (dt->shared->u.enumer.nmembs == 0) in H5T_enum_valueof()
[all …]
/dports/math/vtk8/VTK-8.2.0/ThirdParty/hdf5/vtkhdf5/src/
H A DH5Tfields.c102 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
342 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_value()
347 …if(HDmemcmp(dt->shared->u.enumer.value + (j * size), dt->shared->u.enumer.value + ((j + 1) * size)… in H5T__sort_value()
349 char *tmp = dt->shared->u.enumer.name[j]; in H5T__sort_value()
350 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
351 dt->shared->u.enumer.name[j + 1] = tmp; in H5T__sort_value()
447 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_name()
453 dt->shared->u.enumer.name[j+1])>0) { in H5T__sort_name()
456 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j+1]; in H5T__sort_name()
457 dt->shared->u.enumer.name[j+1] = tmp; in H5T__sort_name()
[all …]
H A DH5Tenum.c210 if(dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
215 dt->shared->u.enumer.name = names; in H5T__enum_insert()
219 dt->shared->u.enumer.value = values; in H5T__enum_insert()
220 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
224 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
225 i = dt->shared->u.enumer.nmembs++; in H5T__enum_insert()
264 if (membno>=dt->shared->u.enumer.nmembs) in H5Tget_member_value()
406 if(dt->shared->u.enumer.nmembs == 0) in H5T_enum_nameof()
417 rt = copied_dt->shared->u.enumer.nmembs; in H5T_enum_nameof()
545 if (dt->shared->u.enumer.nmembs == 0) in H5T_enum_valueof()
[all …]
/dports/math/vtk6/VTK-6.2.0/ThirdParty/hdf5/vtkhdf5/src/
H A DH5Tfields.c129 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
368 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_value()
373 …if(HDmemcmp(dt->shared->u.enumer.value + (j * size), dt->shared->u.enumer.value + ((j + 1) * size)… in H5T__sort_value()
375 char *tmp = dt->shared->u.enumer.name[j]; in H5T__sort_value()
376 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
377 dt->shared->u.enumer.name[j + 1] = tmp; in H5T__sort_value()
473 nmembs = dt->shared->u.enumer.nmembs; in H5T__sort_name()
479 dt->shared->u.enumer.name[j+1])>0) { in H5T__sort_name()
482 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j+1]; in H5T__sort_name()
483 dt->shared->u.enumer.name[j+1] = tmp; in H5T__sort_name()
[all …]
H A DH5Tenum.c236 if(dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
241 dt->shared->u.enumer.name = names; in H5T__enum_insert()
245 dt->shared->u.enumer.value = values; in H5T__enum_insert()
246 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
250 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
251 i = dt->shared->u.enumer.nmembs++; in H5T__enum_insert()
290 if (membno>=dt->shared->u.enumer.nmembs) in H5Tget_member_value()
432 if(dt->shared->u.enumer.nmembs == 0) in H5T_enum_nameof()
443 rt = copied_dt->shared->u.enumer.nmembs; in H5T_enum_nameof()
571 if (dt->shared->u.enumer.nmembs == 0) in H5T_enum_valueof()
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/hdf5/vtkhdf5/src/
H A DH5Tfields.c94 ret_value = (int)dt->shared->u.enumer.nmembs; in H5T_get_nmembers()
175 if (membno >= dt->shared->u.enumer.nmembs) in H5T__get_member_name()
238 for (i = 0; i < dt->shared->u.enumer.nmembs; i++) in H5Tget_member_index()
323 if (H5T_SORT_VALUE != dt->shared->u.enumer.sorted) { in H5T__sort_value()
324 dt->shared->u.enumer.sorted = H5T_SORT_VALUE; in H5T__sort_value()
334 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_value()
428 if (H5T_SORT_NAME != dt->shared->u.enumer.sorted) { in H5T__sort_name()
429 dt->shared->u.enumer.sorted = H5T_SORT_NAME; in H5T__sort_name()
435 … if (HDstrcmp(dt->shared->u.enumer.name[j], dt->shared->u.enumer.name[j + 1]) > 0) { in H5T__sort_name()
438 dt->shared->u.enumer.name[j] = dt->shared->u.enumer.name[j + 1]; in H5T__sort_name()
[all …]
H A DH5Tenum.c195 if (dt->shared->u.enumer.nmembs >= dt->shared->u.enumer.nalloc) { in H5T__enum_insert()
202 dt->shared->u.enumer.name = names; in H5T__enum_insert()
206 dt->shared->u.enumer.value = values; in H5T__enum_insert()
207 dt->shared->u.enumer.nalloc = n; in H5T__enum_insert()
211 dt->shared->u.enumer.sorted = H5T_SORT_NONE; in H5T__enum_insert()
213 dt->shared->u.enumer.name[i] = H5MM_xstrdup(name); in H5T__enum_insert()
248 if (membno >= dt->shared->u.enumer.nmembs) in H5Tget_member_value()
377 if (dt->shared->u.enumer.nmembs == 0) in H5T__enum_nameof()
388 rt = copied_dt->shared->u.enumer.nmembs; in H5T__enum_nameof()
504 if (dt->shared->u.enumer.nmembs == 0) in H5T__enum_valueof()
[all …]
/dports/biology/emboss/EMBOSS-6.6.0/jemboss/org/emboss/jemboss/editor/
H A DGraphicSequenceCollection.java145 while(enumer.hasMoreElements()) in GraphicSequenceCollection()
200 while(enumer.hasMoreElements()) in getConsensusSequence()
342 while(enumer.hasMoreElements()) in setMaxSeqLength()
383 while(enumer.hasMoreElements()) in setSequenceLock()
438 while(enumer.hasMoreElements()) in getColor()
462 enumer = seqs.elements(); in getColor()
570 while(enumer.hasMoreElements()) in removeSequence()
639 while(enumer.hasMoreElements()) in idSort()
648 enumer = seqs.elements(); in idSort()
649 while(enumer.hasMoreElements()) in idSort()
[all …]
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/core/
H A DIntDomain.java142 while (enumer.hasMoreElements()) in addDom()
146 while (enumer.hasMoreElements()) in addDom()
182 while (enumer.hasMoreElements()) { in isIntersecting()
190 while (enumer.hasMoreElements()) in isIntersecting()
220 while (enumer.hasMoreElements()) { in contains()
227 while (enumer.hasMoreElements()) in contains()
425 while (enumer.hasMoreElements()) { in subtract()
433 int first = enumer.nextElement(); in subtract()
435 while (enumer.hasMoreElements()) { in subtract()
474 while (enumer.hasMoreElements()) { in union()
[all …]
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/search/
H A DIndomainMedian.java90 ValueEnumeration enumer = dom.valueEnumeration(); in indomain() local
92 while (enumer.hasMoreElements() && position > 0) { in indomain()
93 enumer.nextElement(); in indomain()
97 return enumer.nextElement(); in indomain()
101 IntervalEnumeration enumer = dom.intervalEnumeration(); in indomain() local
103 while (enumer.hasMoreElements()) { in indomain()
105 Interval next = enumer.nextElement(); in indomain()
/dports/security/p5-Net-OpenID-Common/Net-OpenID-Common-1.20/lib/Net/OpenID/
H A DIndirectMessage.pm20 my $enumer;
25 $enumer = sub { keys(%$what); };
36 $enumer = sub { keys(%get); };
41 $enumer = sub { keys %{$p}; };
48 $enumer = sub { $what->param; };
56 $enumer = sub {
80 $self->{enumer} = $enumer;
174 return $self->{enumer}->();
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/
H A DAssignment.java205 … for (ValueEnumeration enumer = alreadyRemoved.valueEnumeration(); enumer.hasMoreElements(); ) { in consistency()
207 int xValue = enumer.nextElement(); in consistency()
227 … for (ValueEnumeration enumer = alreadyRemoved.valueEnumeration(); enumer.hasMoreElements(); ) { in consistency()
229 int dValue = enumer.nextElement(); in consistency()
269 … for (ValueEnumeration enumer = vPrunedDomain.valueEnumeration(); enumer.hasMoreElements(); ) { in consistency()
271 int dValue = enumer.nextElement() - shiftX; in consistency()
288 … for (ValueEnumeration enumer = vPrunedDomain.valueEnumeration(); enumer.hasMoreElements(); ) { in consistency()
290 int xValue = enumer.nextElement() - shiftD; in consistency()
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/floats/core/
H A DFloatDomain.java284 while (enumer.hasMoreElements()) in addDom()
285 unionAdapt(enumer.nextElement()); in addDom()
327 while (enumer.hasMoreElements()) { in isIntersecting()
328 FloatInterval next = enumer.nextElement(); in isIntersecting()
368 while (enumer.hasMoreElements()) { in contains()
577 FloatInterval first = enumer.nextElement(); in subtract()
579 while (enumer.hasMoreElements()) { in subtract()
630 while (enumer.hasMoreElements()) { in union()
851 while (enumer.hasMoreElements()) { in eq()
1279 while (enumer.hasMoreElements()) in toIntArray()
[all …]
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/util/
H A DIndexDomainView.java77 … for (ValueEnumeration enumer = var.domain.valueEnumeration(); enumer.hasMoreElements(); ) { in IndexDomainView()
78 indexToValue[i++] = enumer.nextElement(); in IndexDomainView()
127 … for (ValueEnumeration enumer = var.domain.valueEnumeration(); enumer.hasMoreElements(); ) {
128 int value = enumer.nextElement();
/dports/math/singular/Singular-Release-4-2-1/Singular/dyn_modules/Order/
H A Dtemptest.cc57 bigintmat* enumer = NULL;// = new bigintmat(3,,coef); in temp_test2() local
58 enumer = l->enumerate_all(c); in temp_test2()
61 if(enumer !=NULL){ in temp_test2()
62 enumer->transpose()->Print(); in temp_test2()
/dports/lang/spidermonkey60/firefox-60.9.0/xpcom/ds/
H A DnsEnumeratorUtils.cpp141 RefPtr<nsSingletonEnumerator> enumer = new nsSingletonEnumerator(aSingleton); in NS_NewSingletonEnumerator() local
142 enumer.forget(aResult); in NS_NewSingletonEnumerator()
247 auto* enumer = new nsUnionEnumerator(aFirstEnumerator, aSecondEnumerator); in NS_NewUnionEnumerator() local
248 if (!enumer) { in NS_NewUnionEnumerator()
251 *aResult = enumer; in NS_NewUnionEnumerator()
/dports/www/firefox-legacy/firefox-52.8.0esr/xpcom/glue/
H A DnsEnumeratorUtils.cpp167 RefPtr<nsSingletonEnumerator> enumer = new nsSingletonEnumerator(aSingleton); in NS_NewSingletonEnumerator() local
168 enumer.forget(aResult); in NS_NewSingletonEnumerator()
282 nsUnionEnumerator* enumer = new nsUnionEnumerator(aFirstEnumerator, in NS_NewUnionEnumerator() local
284 if (!enumer) { in NS_NewUnionEnumerator()
287 *aResult = enumer; in NS_NewUnionEnumerator()
/dports/misc/gedkeeper/GEDKeeper-2.19.1/projects/GKTests/GDModel/
H A DGDMListTests.cs100 IGDMListEnumerator<GDMCustomEvent> enumer = iRec.Events.GetEnumerator(); in Test_WhileEnum()
101 enumer.Reset(); in Test_WhileEnum()
102 while (enumer.MoveNext()) { in Test_WhileEnum()
103 GDMCustomEvent evt1 = enumer.Current; in Test_WhileEnum()
/dports/biology/emboss/EMBOSS-6.6.0/jemboss/org/emboss/jemboss/programs/
H A DResultsUpdateTimer.java81 Enumeration enumer = Jemboss.resultsManager.descriptionHash().keys(); in run() local
82 while (enumer.hasMoreElements()) in run()
84 String image = ShowSavedResults.convertToPretty((String)enumer.nextElement()); in run()

12345678910>>...13