Searched refs:unique (Results 126 - 150 of 217) sorted by relevance

123456789

/external/webkit/Source/WebKit/win/Interfaces/
H A DIWebHTMLRepresentation.idl42 pointer_default(unique)
H A DIWebFramePrivate.idl53 pointer_default(unique)
H A DIWebPreferencesPrivate.idl39 pointer_default(unique)
H A DIWebUIDelegate.idl154 pointer_default(unique)
186 pointer_default(unique)
H A DIWebPreferences.idl74 pointer_default(unique)
H A DIWebViewPrivate.idl58 pointer_default(unique)
/external/openfst/src/include/fst/
H A Dshortest-path.h45 bool unique; // only return paths with distinct input strings member in struct:fst::ShortestPathOptions
61 nshortest(n), unique(u), has_distance(hasdist), first_path(fp),
455 if (!opts.unique) {
473 // discipline is automatically selected. When 'unique' == true, only
485 size_t n = 1, bool unique = false,
493 AnyArcFilter<Arc> > opts(&state_queue, arc_filter, n, unique, false,
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMManagerDefault.java212 * specified source. If the unique flag is true, a new instance will
217 * A bit of magic in this implementation: If the source is null, unique is true,
225 * @param unique true if the returned DTM must be unique, probably because it
236 synchronized public DTM getDTM(Source source, boolean unique, argument
243 (unique ? "UNIQUE" : "shared")+
299 if (source==null && unique && !incremental && !doIndexing) {
566 // Can't return the same node since it's unique to a specific DTM,
/external/ceres-solver/internal/ceres/
H A Dcompressed_row_jacobian_writer.cc98 CHECK(unique(parameter_indices.begin(), parameter_indices.end()) ==
H A Dschur_complement_solver.cc220 f_blocks.erase(unique(f_blocks.begin(), f_blocks.end()), f_blocks.end());
/external/linux-tools-perf/
H A DAndroid.mk212 # unique
258 # unique
/external/stlport/stlport/stl/pointers/
H A D_slist.h384 void unique() { _M_impl.unique(); } function in class:slist
394 void unique(_BinaryPredicate __pred) function in class:slist
395 { _M_impl.unique(_STLP_PRIV _BinaryPredWrapper<_StorageType, _Tp, _BinaryPredicate>(__pred)); }
/external/webkit/Source/WebCore/storage/
H A DIDBObjectStoreBackendImpl.h74 virtual PassRefPtr<IDBIndexBackendInterface> createIndex(const String& name, const String& keyPath, bool unique, IDBTransactionBackendInterface*, ExceptionCode&);
H A DIDBObjectStoreBackendImpl.cpp369 PassRefPtr<IDBIndexBackendInterface> IDBObjectStoreBackendImpl::createIndex(const String& name, const String& keyPath, bool unique, IDBTransactionBackendInterface* transaction, ExceptionCode& ec) argument
380 RefPtr<IDBIndexBackendImpl> index = IDBIndexBackendImpl::create(m_backingStore.get(), m_databaseId, this, name, m_name, keyPath, unique);
398 if (!objectStore->m_backingStore->createIndex(objectStore->m_databaseId, objectStore->id(), index->name(), index->keyPath(), index->unique(), id)) {
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.cpp56 // First get the number of unique hashes.
62 std::unique(uniques.begin(), uniques.end());
86 EI->second.erase(std::unique(EI->second.begin(), EI->second.end()),
/external/stlport/test/unit/
H A Dptrspec_test.cpp147 pint_list.unique(binary_pred<int>());
148 pcint_list.unique(binary_pred<int const>());
/external/llvm/lib/Support/Unix/
H A DPath.inc177 std::string(TmpName) + ": can't create unique directory name");
192 // should be sufficiently unique that we don't have many collisions between
696 // Make this into a unique file name
846 return MakeErrMsg(ErrMsg, path + ": can't make unique filename");
860 return MakeErrMsg(ErrMsg, path + ": can't make unique filename");
867 // Try to initialize with unique value.
873 path + ": can't make unique filename: too many files");
/external/llvm/include/llvm/ADT/
H A Dilist.h605 template<class Pr2> void unique(Pr2 pred) { function in class:llvm::iplist
615 void unique() { unique(op_equal); } function in class:llvm::iplist
/external/kernel-headers/original/linux/
H A Dcoda.h331 u_int32_t unique; /* Keep multiple outstanding msgs distinct */ member in struct:coda_in_hdr
344 /* Really important that opcode and unique are 1st two fields! */
347 u_int32_t unique; member in struct:coda_out_hdr
/external/valgrind/main/coregrind/
H A Dm_errormgr.c129 // Unique tag. This gives the error a unique identity (handle) by
132 UInt unique; member in struct:_Error
546 * prints the opening tag, and the <unique> and <tid> fields
587 VG_(printf_xml)(" <unique>0x%x</unique>\n", err->unique);
629 err->unique = unique_counter++;
1022 VG_(printf_xml)(" <unique>0x%x</unique>\n", err->unique);
[all...]
/external/apache-xml/src/main/java/org/apache/xpath/
H A DXPathContext.java134 * specified source. If the unique flag is true, a new instance will
144 * @param unique true if the returned DTM must be unique, probably because it
153 public DTM getDTM(javax.xml.transform.Source source, boolean unique, argument
158 return m_dtmManager.getDTM(source, unique, wsfilter,
/external/chromium/chrome/browser/safe_browsing/
H A Dprefix_set_unittest.cc230 prefixes.erase(std::unique(prefixes.begin(), prefixes.end()), prefixes.end());
287 prefixes.erase(std::unique(prefixes.begin(), prefixes.end()), prefixes.end());
/external/llvm/utils/TableGen/
H A DCodeGenTarget.cpp239 Result.erase(std::unique(Result.begin(), Result.end()), Result.end());
252 LegalValueTypes.erase(std::unique(LegalValueTypes.begin(),
/external/stlport/stlport/stl/debug/
H A D_list.h415 void unique() { function in class:list
449 void unique(_BinaryPredicate __binary_pred) { function in class:list
/external/webkit/PerformanceTests/SunSpider/tests/parse-only/
H A Djquery-1.3.2.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

Completed in 602 milliseconds

123456789