Searched refs:unique (Results 176 - 200 of 217) sorted by relevance

123456789

/external/valgrind/main/helgrind/
H A Dhg_main.c183 static ULong unique = 0; local
192 lock->unique = unique++;
467 space(d+3); VG_(printf)("unique %llu\n", lk->unique);
5027 VG_(printf)(" locksets: %'8d unique lock sets\n",
5030 VG_(printf)(" univ_laog: %'8d unique lock sets\n",
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
H A DAntlr.Runtime.Tree.pas189 /// Use the original framework assigned hashcode that's unique
419 /// the tree structure. When debugging we need unique nodes
421 /// parsing, it's slow and a waste of memory to create unique
1263 /// <summary>A map of tree node to unique IDs.</summary>
1266 /// <summary>Next available unique ID.</summary>
1440 /// the tree structure. When debugging we need unique nodes
2098 /// the tree structure. When debugging we need unique nodes
/external/webkit/PerformanceTests/SunSpider/tests/parse-only/
H A Dconcat-jquery-mootools-prototype.js295 return this.pushStack( jQuery.unique(jQuery.map(this, function(elem){
393 return this.pushStack( jQuery.unique( jQuery.merge(
1113 unique: function( array ) {
1194 return this.pushStack( jQuery.unique( ret ), name, selector );
1281 // Compute a unique ID for the element
2446 // Make sure that the function being executed has a unique ID
2455 // Create unique handler function, wrapped around original handler
2458 // Store data in unique handler
2763 // Set the guid of unique handler to the same of original handler, so it can be removed
11179 this.matcher.push("return h.unique(
[all...]
H A Dprototype-1.6.0.3.js2800 this.matcher.push("return h.unique(n);\n}");
3106 unique: function(nodes) {
3420 return (l > 1) ? h.unique(results) : results;
/external/ipsec-tools/src/racoon/
H A Dcftoken.l335 <S_RMTS>unique { YYD; yylval.num = GENERATE_POLICY_UNIQUE; return(GENERATE_LEVEL); }
/external/chromium/base/metrics/
H A Dhistogram.cc915 ranges.erase(std::unique(ranges.begin(), ranges.end()), ranges.end());
/external/clang/utils/TableGen/
H A DClangAttrEmitter.cpp504 uniques.erase(std::unique(uniques.begin(), uniques.end()), uniques.end());
/external/llvm/lib/Transforms/Scalar/
H A DLoopUnswitch.cpp576 // exit through a unique exit block without having any
615 // If we didn't find a single unique LoopExit block, or if the loop exit block
1034 Succs.erase(std::unique(Succs.begin(), Succs.end()), Succs.end());
H A DReassociate.cpp1138 // Add one to FactorOccurrences for each unique factor in this op.
1354 Factors.erase(std::unique(Factors.begin(), Factors.end(),
/external/iproute2/doc/
H A Dip-cref.tex368 unique at every given moment. However, the interface may disappear from the
1117 non-unique routes with \verb|ip| commands described in this section.
1389 daemons should take care of setting some unique protocol values,
2064 set {\em unique\/} priority value.
2067 priority value and allows them to be non-unique.
3029 \# OK, the address is unique, we may add it on the interface.\\
3273 \# OK, the address is unique. We may add it to the interface.\\
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.eclipse.jdt.launching_3.5.100.v20100526.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.equinox.p2.metadata_2.0.0.v20100601.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
/external/llvm/lib/CodeGen/
H A DRegisterCoalescer.cpp2170 InflateRegs.erase(std::unique(InflateRegs.begin(), InflateRegs.end()),
H A DSplitKit.cpp144 UseSlots.erase(std::unique(UseSlots.begin(), UseSlots.end(),
/external/clang/lib/Sema/
H A DSemaStmt.cpp995 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
1140 std::unique(EnumVals.begin(), EnumVals.end(), EqEnumVals);
/external/elfutils/tests/
H A Drun-allregs.sh2559 66: $unique (unique), address 64 bits
/external/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.cpp70 assert(std::unique(TypeVec.begin(), TypeVec.end()) == TypeVec.end());
100 TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end());
H A DCodeGenRegisters.cpp315 // Ensure that every sub-register has a unique name.
361 RegUnits.erase(std::unique(RegUnits.begin(), RegUnits.end()), RegUnits.end());
949 // Populate a unique sorted list of units from a register set.
1513 // Compute a unique RegUnitSet for each RegClass.
1569 // Find an existing RegUnitSet, or add the union to the unique sets.
1641 // Compute a unique set of RegUnitSets. One for each RegClass and inferred
H A DCodeGenSchedule.cpp112 // Instantiate a CodeGenSchedClass for each unique SchedRW signature directly
153 // For each processor, find a unique machine model.
158 /// Get a unique processor model based on the defined MachineModel and
510 // Create a SchedClass for each unique combination of itinerary class and
1291 // The final PredTerm is unique set of predicates guarding the transition.
1297 RecIter PredsEnd = std::unique(Preds.begin(), Preds.end());
/external/webkit/Source/WebCore/rendering/style/
H A DRenderStyle.h1192 bool unique() const { return m_unique; } function in class:WebCore::RenderStyle
/external/webkit/Tools/Scripts/
H A Dold-run-webkit-tests321 -m|--merge-leak-depth arg Merges leak callStacks and prints the number of unique leaks beneath a callstack depth of arg. Defaults to 5.
1474 # unique temporary directory for each DumpRendertree - needed for running more DumpRenderTree in parallel
2259 print "WARNING: $uniqueLeakCount unique leaks found!\n";
/external/dropbear/libtomcrypt/
H A Dcrypt.tex786 It is important that the initial vector be unique and preferably random for each message encrypted under the same key.
798 as the block cipher is under a chosen plaintext attack (provided the initial vector is unique).
878 of the cipher you choose. It is important that the IV be random for each unique message you want to encrypt. The
1547 unique to every session. Next, the the optional additional authentication data is processed, and finally the plaintext (or ciphertext depending on the direction).
1563 After the state has been initialized (or reset) the next step is to add the session (or packet) initial vector. It should be unique per packet encrypted.
3663 LibTomCrypt uses a unique format for ECC public and private keys. While ANSI X9.63 partially specifies key formats, it does it in a less than ideally simple manner. \
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/ceres-solver/docs/
H A Dsolving.tex379 each group has a unique integer associated with it, that determines
/external/webkit/Source/WebCore/css/
H A DCSSStyleSelector.cpp1002 if (style->unique())
1135 // If the element has inline style it is probably unique.
1163 // Tracking child index requires unique style for each node. This may get set by the sibling rule match above.
2501 else if (e->renderStyle() && (e->document()->usesSiblingRules() || e->renderStyle()->unique()))

Completed in 994 milliseconds

123456789