Home
last modified time | relevance | path

Searched refs:isNonEmpty (Results 1 – 25 of 138) sorted by relevance

123456

/dports/java/java3d/java3d-1.5.2/j3d-core/build-tools/
H A DVersionInfo.java220 private static boolean isNonEmpty(String str) { in isNonEmpty() method in VersionInfo
240 if (isNonEmpty(VENDOR_DEVELOPER)) {
245 if (isNonEmpty(VERSION_SUFFIX)) {
255 if (isDailyBuild && isNonEmpty(BUILDTIME)) {
273 if (isNonEmpty(VERSION_BUILD)) {
278 if (useVerboseBuildTime && isNonEmpty(BUILDTIME_VERBOSE)) {
282 if (isNonEmpty(VERSION_DEV_STRING)) {
/dports/math/vampire/vampire-4.5.1/Shell/
H A DSMTPrinter.cpp80 if (formula->literal()->args()->isNonEmpty()) { in smtPrint()
87 while (args->isNonEmpty()) { in smtPrint()
98 if (formula->literal()->args()->isNonEmpty()) { in smtPrint()
111 for (fs = formula->args(); FormulaList::isNonEmpty(fs); fs = fs->tail()) { in smtPrint()
168 if (term->args()->isNonEmpty()) { in smtPrint()
175 while (args->isNonEmpty()) { in smtPrint()
186 if (term->args()->isNonEmpty()) { in smtPrint()
H A DFunctionDefinition.cpp209 while(toDo.isNonEmpty()) { in removeUnusedDefinitions()
226 while(defStack.isNonEmpty()) { in removeUnusedDefinitions()
293 while(_blockedDefs.isNonEmpty()) { in removeAllDefinitions()
435 if(ts->isNonEmpty()) { in checkDefinitions()
443 if(ts->isNonEmpty()) { in checkDefinitions()
477 for (TermList* ts = updDef->lhs->args(); ts->isNonEmpty(); ts=ts->next()) { in assignArgOccursData()
518 if(ts->isNonEmpty()) { in assignArgOccursData()
651 while(dargs->isNonEmpty()) { in applyDefinitions()
652 ASS(targs->isNonEmpty()); in applyDefinitions()
708 while(usedDefs.isNonEmpty()) { in applyDefinitions()
[all …]
H A DSkolem.cpp110 ASS(_introducedSkolemFuns.isNonEmpty()); in skolemiseImpl()
111 while(_introducedSkolemFuns.isNonEmpty()) { in skolemiseImpl()
204 if (BoolList::isNonEmpty(varOccInfo.occurs_below)) { // below a quantifier ... in preskolemise()
272 ASS(BoolList::isNonEmpty(varOccInfo.occurs_below)); in preskolemise()
276 … if (BoolList::isNonEmpty(varOccInfo.occurs_below)) { // pass the fact that it did occur above in preskolemise()
494 ASS(FormulaList::isNonEmpty(fs)); in skolemise()
498 while (FormulaList::isNonEmpty(fs)) { in skolemise()
506 while (args.isNonEmpty()) { in skolemise()
H A DTheoryFlattening.cpp85 ASS_EQ(modified, UnitList::isNonEmpty(res)); in apply()
111 ASS_EQ(modified, ClauseList::isNonEmpty(res)); in apply()
202 for(TermList* ts = lit->args(); ts->isNonEmpty(); ts = ts->next()){ in replaceTopTerms()
217 for(TermList* ts = lit->args(); ts->isNonEmpty(); ts = ts->next()){ in replaceTopTerms()
277 for(TermList* ts = term->args(); ts->isNonEmpty(); ts = ts->next()){ in replaceTopTermsInTerm()
H A DInterpolantMinimizer.cpp113 if(formula->literal()->args()->isNonEmpty()) in prettyPrint()
119 while(args->isNonEmpty()) { in prettyPrint()
128 if(formula->literal()->args()->isNonEmpty()) in prettyPrint()
139 for(fs = formula->args(); FormulaList::isNonEmpty(fs); fs = fs->tail()) { in prettyPrint()
195 if(term->args()->isNonEmpty()) in prettyPrint()
201 while(args->isNonEmpty()) { in prettyPrint()
210 if(term->args()->isNonEmpty()) in prettyPrint()
638 ASS(components.isNonEmpty()); in collectAtoms()
850 ASS_NEQ(parents.rParents.isNonEmpty(),parents.bParents.isNonEmpty()); in addColoredParentPropertiesFormulas()
852 PredType parentType = parents.rParents.isNonEmpty() ? R : B; in addColoredParentPropertiesFormulas()
[all …]
H A DNewCNF.cpp87 while(_queue.isNonEmpty()) { in clausify()
169 while (variables.isNonEmpty()) { in process()
189 while (List<LPair>::isNonEmpty(literals)) { in process()
245 while (occurrences.isNonEmpty()) { in process()
382 while (occurrences.isNonEmpty()) { in process()
419 while (occurrences.isNonEmpty()) { in process()
440 while (BindingList::isNonEmpty(traverse)) { in pushAndRememberWhileApplying()
486 while (occurrences.isNonEmpty()) { in processBoolVar()
546 while (occurrences.isNonEmpty()) { in processConstant()
565 while (occurrences.isNonEmpty()) { in processITE()
[all …]
/dports/math/vampire/vampire-4.5.1/Lib/
H A DList.hpp241 while(isNonEmpty(rest)) { in append()
320 while (isNonEmpty(l)) { in reverse()
335 while (isNonEmpty(l)) { in length()
346 while (isNonEmpty(l)) { in member()
405 ASS (isNonEmpty(lst)); in deleteNth()
420 ASS (isNonEmpty(next)); in deleteNth()
525 return isNonEmpty(_lst); in hasNext()
564 { return isNonEmpty(_lst); } in hasNext()
583 { return _l->isNonEmpty(); } in hasNext()
637 return isNonEmpty(_lst); in hasNext()
[all …]
H A DRecycler.hpp43 if(store.isNonEmpty()) { in get()
54 if(store.isNonEmpty()) { in get()
87 while (this->isNonEmpty()) in ~OwnedPtrStack()
H A DDeque.hpp155 bool isNonEmpty() const in isNonEmpty() function in Lib::Deque
210 ASS(isNonEmpty()); in pop_front()
230 ASS(isNonEmpty()); in back()
248 ASS(isNonEmpty()); in pop_back()
H A DSkipList.hpp350 bool isNonEmpty() const in isNonEmpty() function in Lib::SkipList
359 ASS(isNonEmpty()); in top()
370 ASS(isNonEmpty()); in pop()
392 ASS(isNonEmpty()); in max()
507 while (isNonEmpty()) { in makeEmpty()
/dports/www/larbin/larbin-2.6.3/src/fetch/
H A DfetchOpen.cc28 while (cont && global::freeConns->isNonEmpty()) { in fetchOpen()
45 && global::freeConns->isNonEmpty() in fetchDns()
56 while (global::nbDnsCalls && global::freeConns->isNonEmpty()) { in fetchDns()
/dports/math/vampire/vampire-4.5.1/Kernel/
H A DConstraint.cpp254 while(otherC1.isNonEmpty() || otherC2.isNonEmpty()) { in resolve()
255 while(otherC1.isNonEmpty() && (otherC2.isEmpty() || otherC1.top().var>otherC2.top().var) ) { in resolve()
262 while(otherC2.isNonEmpty() && (otherC1.isEmpty() || otherC2.top().var>otherC1.top().var) ) { in resolve()
269 while(otherC1.isNonEmpty() && otherC2.isNonEmpty() && otherC1.top().var==otherC2.top().var) { in resolve()
H A DRCClauseStack.hpp78 bool isNonEmpty() { return _s.isNonEmpty(); } in isNonEmpty() function in Kernel::RCClauseStack
82 while(isNonEmpty()) { in reset()
H A DTermIterators.cpp105 ASS(_stack->isNonEmpty()); in right()
302 while (_stack.isNonEmpty()) { in hasNext()
371 while (_stack.isNonEmpty()) { in hasNext()
H A DSpassLiteralSelector.cpp60 ASS(LiteralList::isNonEmpty(maximals)); in doSelection()
66 (_value != IFSEVERALMAXIMAL || LiteralList::isNonEmpty(maximals->tail()))) { in doSelection()
/dports/audio/ardour6/Ardour-6.8.0/libs/appleutility/CoreAudio/PublicUtility/
H A DCAAudioValueRange.cpp138 bool isNonEmpty; in Intersection() local
143 isNonEmpty = true; in Intersection()
149 isNonEmpty = false; in Intersection()
151 return isNonEmpty; in Intersection()
/dports/math/vampire/vampire-4.5.1/Indexing/
H A DSubstitutionTree_FastInst.cpp194 bool buildDerefTerm() { return trm.t.isNonEmpty(); }; in buildDerefTerm()
335 while(toDo.isNonEmpty() && toDo.top().buildDerefTerm()) { in derefQueryBinding()
405 while(_boundVars.isNonEmpty()) { in tryBacktrack()
471 while(toDo.isNonEmpty()) { in matchNext()
703 while(curr==0 && _alternatives.isNonEmpty()) { in findNextLeaf()
709 if(_alternatives.isNonEmpty()) { in findNextLeaf()
759 if(!sibilingsRemain && _alternatives.isNonEmpty()) { in findNextLeaf()
773 if(sibilingsRemain || _alternatives.isNonEmpty()) { in findNextLeaf()
793 if(curr==0 && _alternatives.isNonEmpty()) { in findNextLeaf()
H A DSubstitutionTree_FastGen.cpp339 while(_boundVars.isNonEmpty()) { in tryBacktrack()
505 while(curr==0 && _alternatives.isNonEmpty()) { in findNextLeaf()
511 if(_alternatives.isNonEmpty()) { in findNextLeaf()
567 if(!sibilingsRemain && _alternatives.isNonEmpty()) { in findNextLeaf()
581 if(sibilingsRemain || _alternatives.isNonEmpty()) { in findNextLeaf()
600 if(curr==0 && _alternatives.isNonEmpty()) { in findNextLeaf()
/dports/math/vampire/vampire-4.5.1/
H A Dvsat.cpp119 while(cls.isNonEmpty()) { in runSolverIncrementally()
162 while(units.isNonEmpty()) { in runSolverIncrementally()
293 while(args.isNonEmpty()) { in processArgs()
298 if(args.isNonEmpty()) { in processArgs()
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/tests/gtest/
H A DTestRect.cpp508 bool isNonEmpty) { in TestIntersectionLogicalHelper() argument
512 EXPECT_TRUE(isNonEmpty == rectDebug.IntersectRect(rect1, rect2)); in TestIntersectionLogicalHelper()
519 EXPECT_TRUE(isNonEmpty == r1.IntersectRect(r1, r2)); in TestIntersectionLogicalHelper()
528 EXPECT_TRUE(isNonEmpty == r4.IntersectRect(r3, r4)); in TestIntersectionLogicalHelper()
538 EXPECT_TRUE(isNonEmpty == r7.IntersectRect(r5, r6)); in TestIntersectionLogicalHelper()
548 bool isNonEmpty) { in TestIntersectionLogical() argument
550 isNonEmpty); in TestIntersectionLogical()
552 isNonEmpty); in TestIntersectionLogical()
/dports/www/firefox-esr/firefox-91.8.0/gfx/tests/gtest/
H A DTestRect.cpp514 bool isNonEmpty) { in TestIntersectionLogicalHelper() argument
518 EXPECT_TRUE(isNonEmpty == rectDebug.IntersectRect(rect1, rect2)); in TestIntersectionLogicalHelper()
525 EXPECT_TRUE(isNonEmpty == r1.IntersectRect(r1, r2)); in TestIntersectionLogicalHelper()
534 EXPECT_TRUE(isNonEmpty == r4.IntersectRect(r3, r4)); in TestIntersectionLogicalHelper()
544 EXPECT_TRUE(isNonEmpty == r7.IntersectRect(r5, r6)); in TestIntersectionLogicalHelper()
554 bool isNonEmpty) { in TestIntersectionLogical() argument
556 isNonEmpty); in TestIntersectionLogical()
558 isNonEmpty); in TestIntersectionLogical()
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/tests/gtest/
H A DTestRect.cpp514 bool isNonEmpty) { in TestIntersectionLogicalHelper() argument
518 EXPECT_TRUE(isNonEmpty == rectDebug.IntersectRect(rect1, rect2)); in TestIntersectionLogicalHelper()
525 EXPECT_TRUE(isNonEmpty == r1.IntersectRect(r1, r2)); in TestIntersectionLogicalHelper()
534 EXPECT_TRUE(isNonEmpty == r4.IntersectRect(r3, r4)); in TestIntersectionLogicalHelper()
544 EXPECT_TRUE(isNonEmpty == r7.IntersectRect(r5, r6)); in TestIntersectionLogicalHelper()
554 bool isNonEmpty) { in TestIntersectionLogical() argument
556 isNonEmpty); in TestIntersectionLogical()
558 isNonEmpty); in TestIntersectionLogical()
/dports/www/firefox/firefox-99.0/gfx/tests/gtest/
H A DTestRect.cpp527 bool isNonEmpty) { in TestIntersectionLogicalHelper() argument
531 EXPECT_TRUE(isNonEmpty == rectDebug.IntersectRect(rect1, rect2)); in TestIntersectionLogicalHelper()
538 EXPECT_TRUE(isNonEmpty == r1.IntersectRect(r1, r2)); in TestIntersectionLogicalHelper()
547 EXPECT_TRUE(isNonEmpty == r4.IntersectRect(r3, r4)); in TestIntersectionLogicalHelper()
557 EXPECT_TRUE(isNonEmpty == r7.IntersectRect(r5, r6)); in TestIntersectionLogicalHelper()
567 bool isNonEmpty) { in TestIntersectionLogical() argument
569 isNonEmpty); in TestIntersectionLogical()
571 isNonEmpty); in TestIntersectionLogical()
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/tests/gtest/
H A DTestRect.cpp514 bool isNonEmpty) { in TestIntersectionLogicalHelper() argument
518 EXPECT_TRUE(isNonEmpty == rectDebug.IntersectRect(rect1, rect2)); in TestIntersectionLogicalHelper()
525 EXPECT_TRUE(isNonEmpty == r1.IntersectRect(r1, r2)); in TestIntersectionLogicalHelper()
534 EXPECT_TRUE(isNonEmpty == r4.IntersectRect(r3, r4)); in TestIntersectionLogicalHelper()
544 EXPECT_TRUE(isNonEmpty == r7.IntersectRect(r5, r6)); in TestIntersectionLogicalHelper()
554 bool isNonEmpty) { in TestIntersectionLogical() argument
556 isNonEmpty); in TestIntersectionLogical()
558 isNonEmpty); in TestIntersectionLogical()

123456