/dports/lang/maude/maude-2.7.1/src/ACU_Theory/ |
H A D | ACU_Term.cc | 109 argArray(original.argArray.length()) in ACU_Term() 114 argArray[i].term = original.argArray[i].term->deepCopy(translator); in ACU_Term() 115 argArray[i].multiplicity = original.argArray[i].multiplicity; in ACU_Term() 277 argArray[p--] = argArray[i]; in normalizeAliensAndFlatten() 300 argArray[i].term = argArray[i].term->normalize(false, subtermChanged); in normalize() 308 if (argArray[i - 1].term->compare(argArray[i].term) > 0) in normalize() 311 sort(argArray.begin(), argArray.end(), pairLt); in normalize() 317 if (argArray[i].term->equal(argArray[d].term)) in normalize() 320 argArray[d].multiplicity += argArray[i].multiplicity; in normalize() 324 argArray[++d] = argArray[i]; in normalize() [all …]
|
H A D | ACU_Normalize.cc | 47 fastCopy(source->argArray.begin(), source->argArray.end(), argArray.begin()); in copyAndBinaryInsert() 110 ACU_Tree t(d->argArray); in insertAlien() 193 argArray[0].dagNode = d1; in normalizeAtTop() 195 argArray.contractTo(1); in normalizeAtTop() 207 argArray.contractTo(1); in normalizeAtTop() 212 argArray[1].multiplicity = argArray[0].multiplicity; in normalizeAtTop() 213 argArray[1].dagNode = d0; in normalizeAtTop() 214 argArray[0].dagNode = d1; in normalizeAtTop() 227 argArray[0].multiplicity += argArray[1].multiplicity; in normalizeAtTop() 228 argArray.contractTo(1); in normalizeAtTop() [all …]
|
H A D | ACU_DagNode.cc | 182 n->argArray[i].dagNode = argArray[i].dagNode->copyEagerUptoReduced(); in copyEagerUptoReduced2() 183 n->argArray[i].multiplicity = argArray[i].multiplicity; in copyEagerUptoReduced2() 189 n->argArray[i] = argArray[i]; in copyEagerUptoReduced2() 213 fastCopy(argArray.begin(), argArray.end(), d->argArray.begin()); in overwriteWithClone() 224 fastCopy(argArray.begin(), argArray.end(), d->argArray.begin()); in makeClone() 569 d->argArray[j] = argArray[j]; in instantiate2() 575 d->argArray[i].multiplicity = argArray[i].multiplicity; in instantiate2() 589 d->argArray[i].multiplicity = argArray[i].multiplicity; in instantiate2() 684 d->argArray[j] = argArray[j]; in instantiateWithCopies2() 690 d->argArray[i].multiplicity = argArray[i].multiplicity; in instantiateWithCopies2() [all …]
|
H A D | ACU_MergeSort.cc | 51 int r = argArray[p1].dagNode->compare(argArray[p2].dagNode); in mergeSortAndUniquize() 72 argArray[p1++].multiplicity + argArray[p2++].multiplicity; in mergeSortAndUniquize() 114 int r = argArray[i - 1].dagNode->compare(argArray[i].dagNode); in sortAndUniquize() 124 argArray[d].multiplicity += argArray[i].multiplicity; in sortAndUniquize() 126 argArray[++d] = argArray[i]; in sortAndUniquize() 131 Pair t(argArray[d]); in sortAndUniquize() 132 argArray[d] = argArray[i]; in sortAndUniquize() 133 argArray[++d] = t; in sortAndUniquize() 137 argArray[++d] = argArray[i]; in sortAndUniquize() 144 r = argArray[d].dagNode->compare(argArray[i].dagNode); in sortAndUniquize() [all …]
|
H A D | ACU_FastMerge.cc | 37 argArray.resizeWithoutPreservation(source0->argArray.length() + in fastMerge() 38 source1->argArray.length()); in fastMerge() 40 ArgVec<Pair>::const_iterator s0 = source0->argArray.begin(); in fastMerge() 42 ArgVec<Pair>::const_iterator s1 = source1->argArray.begin(); in fastMerge() 44 ArgVec<Pair>::iterator d = argArray.begin(); in fastMerge() 84 argArray.contractTo(d - argArray.begin()); in fastMerge() 96 argArray.resizeWithoutPreservation(source0->argArray.length() + in fastMerge() 102 ArgVec<Pair>::iterator d = argArray.begin(); in fastMerge() 144 argArray.contractTo(d - argArray.begin()); in fastMerge() 161 ArgVec<Pair>::iterator d = argArray.begin(); in fastMerge() [all …]
|
H A D | ACU_DagOperations.cc | 30 const ArgVec<Pair>::const_iterator args = argArray.begin(); // for speed in findFirstPotentialMatch() 31 int first = argArray.length(); // return index beyond arg array prospects in findFirstPotentialMatch() 77 const ArgVec<Pair>::const_iterator args = argArray.begin(); // for speed in binarySearch() 78 int upper = argArray.length() - 1; in binarySearch() 109 int upper = argArray.length() - 1; in binarySearch() 144 ArgVec<Pair>& args = getACU_DagNode(target)->argArray; in eliminateSubject() 170 int nrArgs = argArray.length() - 1; in eliminateArgument() 172 argArray[i] = argArray[i + 1]; in eliminateArgument() 173 if (nrArgs == 0 || (nrArgs == 1 && argArray[0].multiplicity == 1)) in eliminateArgument() 180 argArray[0].dagNode : argArray[0].dagNode->copyReducible(); in eliminateArgument() [all …]
|
H A D | ACU_Symbol.cc | 131 int nrArgs = s->argArray.length(); in copyReduceSubtermsAndNormalize() 133 s->argArray[i].dagNode = s->argArray[i].dagNode->copyAndReduce(context); in copyReduceSubtermsAndNormalize() 401 const ArgVec<ACU_DagNode::Pair>& argArray = safeCast(const ACU_DagNode*, dagNode)->argArray; in termify() local 580 int nrArgs = d->argArray.size(); in makeCanonical() 594 n->argArray[j] = d->argArray[j]; in makeCanonical() 595 n->argArray[i].dagNode = c; in makeCanonical() 596 n->argArray[i].multiplicity = d->argArray[i].multiplicity; in makeCanonical() 599 n->argArray[i].dagNode = hcs->getCanonical(hcs->insert(d->argArray[i].dagNode)); in makeCanonical() 600 n->argArray[i].multiplicity = d->argArray[i].multiplicity; in makeCanonical() 639 n->argArray[i].dagNode = hcs->getCanonical(hcs->insert(d->argArray[i].dagNode)); in makeCanonicalCopy() [all …]
|
H A D | ACU_ExtensionInfo.cc | 53 ArgVec<ACU_Pair>::iterator dest = n->argArray.begin(); in buildMatchedPortion() 62 FOR_EACH_CONST(source, ArgVec<ACU_Pair>, s->argArray) in buildMatchedPortion() 80 ArgVec<ACU_Pair>::const_iterator i = u->argArray.begin(); in buildMatchedPortion() 81 FOR_EACH_CONST(source, ArgVec<ACU_Pair>, s->argArray) in buildMatchedPortion() 101 FOR_EACH_CONST(source, ArgVec<ACU_Pair>, s->argArray) in buildMatchedPortion() 114 int size = dest - n->argArray.begin(); in buildMatchedPortion() 115 Assert(size > 1 || n->argArray[0].multiplicity > 1, in buildMatchedPortion() 117 n->argArray.contractTo(size); in buildMatchedPortion() 144 return s->argArray[last - unmatchedMultiplicity.begin()].dagNode; in buildUnmatchedPortion() 147 ArgVec<ACU_Pair>::const_iterator source = s->argArray.begin(); in buildUnmatchedPortion() [all …]
|
/dports/lang/maude/maude-2.7.1/src/CUI_Theory/ |
H A D | CUI_Term.cc | 65 argArray(2) in CUI_Term() 74 argArray(2) in CUI_Term() 76 argArray[0] = original.argArray[0]->deepCopy(translator); in CUI_Term() 77 argArray[1] = original.argArray[1]->deepCopy(translator); in CUI_Term() 127 argArray[0] = argArray[0]->normalize(full, changed); in normalize() 150 int r = argArray[0]->compare(argArray[1]); in normalize() 160 argArray[0] = argArray[1]; in normalize() 184 int r = argArray[0]->compare(d->argArray[0]); in compareArguments() 187 return argArray[1]->compare(d->argArray[1]); in compareArguments() 216 d->argArray[0] = argArray[0]->dagify(); in dagify2() [all …]
|
H A D | CUI_DagNode.cc | 82 int r = argArray[0]->compare(d->argArray[0]); in compareArguments() 85 return argArray[1]->compare(d->argArray[1]); in compareArguments() 100 n->argArray[0] = s->eagerArgument(0) ? argArray[0]->copyEagerUptoReduced() : argArray[0]; in copyEagerUptoReduced2() 118 d->argArray[0] = argArray[0]; in overwriteWithClone() 119 d->argArray[1] = argArray[1]; in overwriteWithClone() 128 d->argArray[0] = argArray[0]; in makeClone() 129 d->argArray[1] = argArray[1]; in makeClone() 140 d->argArray[1] = argArray[1]; in copyWithReplacement() 145 d->argArray[0] = argArray[0]; in copyWithReplacement() 214 int r = argArray[0]->compare(argArray[1]); in normalizeAtTop() [all …]
|
H A D | CUI_Symbol.cc | 109 c->argArray[0] = args[0]; in makeDagNode() 110 c->argArray[1] = args[1]; in makeDagNode() 119 DagNode** args = s->argArray; in eqRewrite() 194 DagNode** args = s->argArray; in memoStrategy() 263 DagNode** args = s->argArray; in normalizeAndComputeTrueSort() 310 DagNode** argArray = safeCast(CUI_DagNode*, dagNode)->argArray; in termify() local 311 DagNode* d0 = argArray[0]; in termify() 312 DagNode* d1 = argArray[1]; in termify() 407 n->argArray[0] = c; in makeCanonical() 408 n->argArray[1] = c1; in makeCanonical() [all …]
|
/dports/lang/maude/maude-2.7.1/src/AU_Theory/ |
H A D | AU_DagNode.cc | 112 argArray.evacuate(); in markArguments() 138 n->argArray[i] = argArray[i]->copyEagerUptoReduced(); in copyEagerUptoReduced2() 141 copy(argArray.begin(), argArray.end(), n->argArray.begin()); in copyEagerUptoReduced2() 159 copy(argArray.begin(), argArray.end(), d->argArray.begin()); in overwriteWithClone() 170 copy(argArray.begin(), argArray.end(), d->argArray.begin()); in makeClone() 204 args[i] = argArray[i]; in copyWithReplacement() 234 argArray[first++] = argArray[last]; in partialReplace() 400 d->argArray[j] = argArray[j]; in instantiate2() 405 d->argArray[i] = n; in instantiate2() 468 d = argArray[i]; in instantiateWithReplacement() [all …]
|
H A D | AU_Term.cc | 76 argArray(original.argArray.length()) in AU_Term() 80 argArray[i].term = original.argArray[i].term->deepCopy(translator); in AU_Term() 116 args[0] = argArray[0].term; in deepCopy2() 169 argArray[i].term = t; in normalize() 193 argArray[p--].term = t; in normalize() 207 Term* t = argArray[i].term; in normalize() 217 argArray[p].term = t; in normalize() 235 Term* t = argArray[0].term; in normalize() 239 argArray.contractTo(p); in normalize() 278 int len = argArray.length(); in compareArguments() [all …]
|
H A D | AU_Normalize.cc | 31 (s->leftId() && i + 1 != argArray.end()); in disappear() 145 argArray[p++] = d; in normalizeAtTop() 155 argArray[0] : argArray[0]->copyReducible(); in normalizeAtTop() 159 argArray.contractTo(p); in normalizeAtTop() 166 int nrArgs = argArray.length(); in normalizeAtTop() 172 argArray.expandBy(expansion); in normalizeAtTop() 177 DagNode* d = argArray[i]; in normalizeAtTop() 182 argArray[p--] = argArray2[j]; in normalizeAtTop() 185 argArray[p--] = argArray[i]; in normalizeAtTop() 209 argArray.swap(buffer); in normalizeAtTop() [all …]
|
H A D | AU_DagOperations.cc | 31 int last = argArray.length() - 1; in eliminateForward() 44 const ArgVec<DagNode*> args2 = getAU_DagNode(target)->argArray; in eliminateForward() 62 if (!(args2[i]->equal(argArray[pos]))) in eliminateForward() 72 if (pos <= limit && target->equal(argArray[pos])) in eliminateForward() 84 int last = argArray.length() - 1; in eliminateBackward() 97 const ArgVec<DagNode*> args2 = getAU_DagNode(target)->argArray; in eliminateBackward() 115 if (!(args2[i]->equal(argArray[pos]))) in eliminateBackward() 125 if (pos >= limit && target->equal(argArray[pos])) in eliminateBackward() 141 return argArray[start]; in makeFragment() 147 d->argArray[s->leftId() ? --nrSubterms : i++] = s->getIdentityDag(); in makeFragment() [all …]
|
H A D | AU_Symbol.cc | 162 s->argArray[i]->reduce(context); in eqRewrite() 184 DagNode* d = s->argArray[i]; in eqRewrite() 250 ArgVec<DagNode*>& args = s->argArray; in memoStrategy() 503 const ArgVec<DagNode*>& argArray = safeCast(const AU_DagNode*, dagNode)->argArray; in termify() local 645 int nrArgs = d->argArray.size(); in makeCanonical() 648 DagNode* b = d->argArray[i]; in makeCanonical() 659 n->argArray[j] = d->argArray[j]; in makeCanonical() 660 n->argArray[i] = c; in makeCanonical() 662 n->argArray[i] = hcs->getCanonical(hcs->insert(d->argArray[i])); in makeCanonical() 694 int nrArgs = d->argArray.size(); in makeCanonicalCopy() [all …]
|
/dports/lang/maude/maude-2.7.1/src/FreeTheory/ |
H A D | freeTerm.cc | 77 argArray[i] = arguments[i]; in FreeTerm() 84 argArray(original.argArray.length()) in FreeTerm() 88 argArray[i] = original.argArray[i]->deepCopy(translator); in FreeTerm() 100 if (argArray.length() == 0) in arguments() 109 int nrArgs = argArray.length(); in deepSelfDestruct() 142 int nrArgs = argArray.length(); in normalize() 147 argArray[i] = t; in normalize() 270 t = (f->argArray)[p]; in locateSubterm() 294 t = (f->argArray)[p]; in locateSubterm2() 337 (*p) = argArray[i]->dagify(); in dagify2() [all …]
|
H A D | freeDagNode.cc | 85 DagNode** p = argArray(); in getHashValue() 182 DagNode** p = argArray(); in clearCopyPointers2() 195 DagNode** p = argArray(); in overwriteWithClone() 196 DagNode** q = d->argArray(); in overwriteWithClone() 209 DagNode** p = argArray(); in makeClone() 210 DagNode** q = d->argArray(); in makeClone() 223 DagNode** p = argArray(); in copyWithReplacement() 224 DagNode** q = d->argArray(); in copyWithReplacement() 247 DagNode** p = argArray(); in copyWithReplacement() 248 DagNode** q = d->argArray(); in copyWithReplacement() [all …]
|
/dports/sysutils/barrier/barrier-2.3.3/src/test/unittests/barrier/ |
H A D | ArgParserTests.cpp | 149 argArray.push_back("stub1"); in TEST() 150 argArray.push_back("stub2"); in TEST() 168 argArray.push_back("stub1"); in TEST() 169 argArray.push_back("stub2"); in TEST() 178 argArray.push_back("stub1"); in TEST() 179 argArray.push_back("stub2"); in TEST() 188 argArray.push_back("stub1"); in TEST() 189 argArray.push_back("stub2"); in TEST() 190 argArray.push_back("stub3"); in TEST() 191 argArray.push_back("stub4"); in TEST() [all …]
|
/dports/sysutils/synergy/synergy-core-1.14.0.4-stable/src/test/unittests/synergy/ |
H A D | ArgParserTests.cpp | 155 argArray.push_back("stub1"); in TEST() 156 argArray.push_back("stub2"); in TEST() 174 argArray.push_back("stub1"); in TEST() 175 argArray.push_back("stub2"); in TEST() 184 argArray.push_back("stub1"); in TEST() 185 argArray.push_back("stub2"); in TEST() 194 argArray.push_back("stub1"); in TEST() 195 argArray.push_back("stub2"); in TEST() 196 argArray.push_back("stub3"); in TEST() 197 argArray.push_back("stub4"); in TEST() [all …]
|
/dports/devel/slf4j/slf4j-1.7.21/slf4j-api/src/main/java/org/slf4j/helpers/ |
H A D | MessageFormatter.java | 156 if (argArray == null || argArray.length == 0) { in getThrowableCandidate() 160 final Object lastEntry = argArray[argArray.length - 1]; in getThrowableCandidate() 169 Object[] args = argArray; in arrayFormat() 171 args = trimmedCopy(argArray); in arrayFormat() 176 private static Object[] trimmedCopy(Object[] argArray) { in trimmedCopy() argument 177 if (argArray == null || argArray.length == 0) { in trimmedCopy() 180 final int trimemdLen = argArray.length - 1; in trimmedCopy() 182 System.arraycopy(argArray, 0, trimmed, 0, trimemdLen); in trimmedCopy() 189 return new FormattingTuple(null, argArray, throwable); in arrayFormat() 192 if (argArray == null) { in arrayFormat() [all …]
|
/dports/graphics/netpbm/netpbm-10.91.01/lib/ |
H A D | libsystem.c | 511 const char ** argArray; in pm_system2_lp() local 517 argArray = NULL; in pm_system2_lp() 524 REALLOCARRAY(argArray, n+1); in pm_system2_lp() 526 argArray[n++] = arg; in pm_system2_lp() 538 free(argArray); in pm_system2_lp() 616 const char ** argArray; in pm_system_lp() local 622 argArray = NULL; in pm_system_lp() 629 REALLOCARRAY(argArray, n+1); in pm_system_lp() 631 argArray[n++] = arg; in pm_system_lp() 639 pm_system_vp(progName, argArray, in pm_system_lp() [all …]
|
/dports/devel/slf4j/slf4j-1.7.21/slf4j-android/src/main/java/org/slf4j/impl/ |
H A D | AndroidLoggerAdapter.java | 163 public void trace(String format, Object... argArray) { in trace() argument 164 formatAndLog(Log.VERBOSE, format, argArray); in trace() 249 public void debug(String format, Object... argArray) { in debug() argument 250 formatAndLog(Log.DEBUG, format, argArray); in debug() 335 public void info(String format, Object... argArray) { in info() argument 336 formatAndLog(Log.INFO, format, argArray); in info() 424 public void warn(String format, Object... argArray) { in warn() argument 425 formatAndLog(Log.WARN, format, argArray); in warn() 512 public void error(String format, Object... argArray) { in error() argument 513 formatAndLog(Log.ERROR, format, argArray); in error() [all …]
|
/dports/lang/mono/mono-5.10.1.57/external/corert/src/System.Private.CoreLib/src/System/Runtime/ |
H A D | CommandLine.Windows.cs | 33 string[] argArray = new string[nArgs]; in InternalCreateCommandLine() 34 SegmentCommandLine(pCmdLine, argArray, includeArg0); in InternalCreateCommandLine() 35 return argArray; in InternalCreateCommandLine() 45 … private static unsafe int SegmentCommandLine(char * pCmdLine, string[] argArray, bool includeArg0) in SegmentCommandLine() argument 60 if (argArray != null) in SegmentCommandLine() 64 argArray[nArgs] = new string(arg0); in SegmentCommandLine() 93 if (argArray != null) in SegmentCommandLine() 97 argArray[nArgs] = new string(arg); in SegmentCommandLine()
|
/dports/www/firefox-esr/firefox-91.8.0/security/manager/pki/ |
H A D | nsNSSDialogs.cpp | 106 nsCOMPtr<nsIMutableArray> argArray = nsArrayBase::Create(); 107 if (!argArray) { 111 nsresult rv = argArray->AppendElement(cert); 117 rv = argArray->AppendElement(retVals); 173 if (!argArray) { 182 rv = argArray->AppendElement(hostnameVariant); 192 rv = argArray->AppendElement(organizationVariant); 202 rv = argArray->AppendElement(issuerOrgVariant); 212 rv = argArray->AppendElement(portVariant); 217 rv = argArray->AppendElement(certList); [all …]
|