/external/chromium_org/third_party/WebKit/Source/platform/animation/ |
H A D | KeyframeValueList.cpp | 32 void KeyframeValueList::insert(PassOwnPtr<const AnimationValue> value) function in class:blink::KeyframeValueList 38 // insert after 39 m_values.insert(i + 1, value); 43 // insert before 44 m_values.insert(i, value);
|
/external/llvm/include/llvm/ADT/ |
H A D | StringSet.h | 27 /// insert - Insert the specified key into the set. If the key already 28 /// exists in the set, return false and ignore the request, otherwise insert 30 bool insert(StringRef Key) { function in class:llvm::StringSet 32 // type will be default constructed which we use to detect insert.
|
H A D | SmallSet.h | 61 /// insert - Insert an element into the set if it isn't already there. 63 bool insert(const T &V) { function in class:llvm::SmallSet 65 return Set.insert(V).second; 77 Set.insert(Vector.back()); 80 Set.insert(V); 85 void insert(IterT I, IterT E) { function in class:llvm::SmallSet 87 insert(*I);
|
H A D | UniqueVector.h | 39 /// insert - Append entry to the vector if it doesn't already exist. Returns 41 unsigned insert(const T &Entry) { function in class:llvm::UniqueVector
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | KeyframeList.cpp | 42 void KeyframeList::insert(const KeyframeValue& keyframe) function in class:blink::KeyframeList 57 // insert before 58 m_keyframes.insert(i, keyframe);
|
/external/chromium_org/third_party/cython/src/Cython/ |
H A D | StringIOTree.py | 40 def insert(self, iotree): member in class:StringIOTree 93 >>> d.insert(i)
|
/external/chromium_org/chrome/browser/sync_file_system/ |
H A D | subtree_set.cc | 49 bool SubtreeSet::insert(const base::FilePath& subtree_root) { function in class:sync_file_system::SubtreeSet
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | qavltree.pyx | 57 def insert(self, key, value): member in class:cAVLTree
|
H A D | qbintree.pyx | 57 def insert(self, key, value): member in class:cBinaryTree
|
H A D | qrbtree.pyx | 57 def insert(self, key, value): member in class:cRBTree
|
H A D | bintree.py | 94 def insert(self, key, value): member in class:BinaryTree 95 """ T.insert(key, value) <==> T[key] = value, insert key, value into Tree """
|
H A D | rbtree.py | 106 practice: it can search, insert, and delete in O(log n) time, where n is 151 def insert(self, key, value): member in class:RBTree 152 """ T.insert(key, value) <==> T[key] = value, insert key, value into Tree """
|
/external/eigen/Eigen/src/StlSupport/ |
H A D | StdDeque.h | 104 using deque_base::insert; 105 iterator insert(const_iterator position, const value_type& x) function in class:std::deque 106 { return deque_base::insert(position,x); } 107 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::deque 108 { deque_base::insert(position, new_size, x); } 116 deque_base::insert(deque_base::end(), new_size - deque_base::size(), x); 126 deque_base::insert(deque_base::end(), new_size - deque_base::size(), x);
|
H A D | StdList.h | 94 list_base::insert(list_base::end(), new_size - list_base::size(), x); 103 using list_base::insert; 104 iterator insert(const_iterator position, const value_type& x) function in class:std::list 105 { return list_base::insert(position,x); } 106 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::list 107 { list_base::insert(position, new_size, x); }
|
H A D | StdVector.h | 91 using vector_base::insert; 92 iterator insert(const_iterator position, const value_type& x) function in class:std::vector 93 { return vector_base::insert(position,x); } 94 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::vector 95 { vector_base::insert(position, new_size, x); } 110 vector_base::insert(vector_base::end(), new_size - vector_base::size(), x); 120 vector_base::insert(vector_base::end(), new_size - vector_base::size(), x);
|
/external/icu/icu4c/source/layout/ |
H A D | MultipleSubstSubtables.cpp | 74 le_int32 insert = 0, direction = 1; local 77 insert = glyphCount - 1; 84 newGlyphs[insert] = LE_SET_GLYPH(glyph, substitute); 85 insert += direction;
|
H A D | LEInsertionList.cpp | 54 LEGlyphID *LEInsertionList::insert(le_int32 position, le_int32 count, LEErrorCode &success) function in class:LEInsertionList 72 // insert on end of list... 77 // insert on front of list...
|
/external/llvm/include/llvm/MC/ |
H A D | MCObjectStreamer.h | 72 void insert(MCFragment *F) const { function in class:llvm::MCObjectStreamer 73 CurSectionData->getFragmentList().insert(CurInsertionPoint, F);
|
/external/smali/util/src/main/java/ds/tree/ |
H A D | RadixTree.java | 55 public void insert(String key, T value); method in interface:RadixTree
|
/external/chromium_org/extensions/common/permissions/ |
H A D | api_permission_set.cc | 62 api_permissions->insert(permission.release()); 122 void APIPermissionSet::insert(APIPermission::ID id) { function in class:extensions::APIPermissionSet 126 insert(permission_info->CreateAPIPermission()); 129 void APIPermissionSet::insert(APIPermission* permission) { function in class:extensions::APIPermissionSet 130 BaseSetOperators<APIPermissionSet>::insert(permission); 182 insert(APIPermission::kFileSystemWriteDirectory);
|
/external/chromium_org/third_party/libaddressinput/src/cpp/src/util/ |
H A D | lru_cache_using_std.h | 80 insert(k,v); 116 void insert(const key_type& k,const value_type& v) { function in class:lru_cache_using_std 127 =_key_tracker.insert(_key_tracker.end(),k); 131 _key_to_value.insert(
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkPathHeap.cpp | 66 *fLookupTable.insert(index) = LookupEntry(path); 72 int SkPathHeap::insert(const SkPath& path) { function in class:SkPathHeap
|
/external/clang/include/clang/ARCMigrate/ |
H A D | ARCMT.h | 112 virtual void insert(SourceLocation loc, StringRef text) { } function in class:clang::arcmt::MigrationProcess::RewriteListener
|
/external/oprofile/libpp/ |
H A D | symbol_container.cpp | 27 symbol_entry const * symbol_container::insert(symbol_entry const & symb) function in class:symbol_container 29 pair<symbols_t::iterator, bool> p = symbols.insert(symb); 90 symbols_by_loc.insert(&*cit);
|
/external/proguard/src/proguard/util/ |
H A D | ArrayUtil.java | 409 public static byte[] insert(byte[] array, int size, int index, byte element) method in class:ArrayUtil 525 public static short[] insert(short[] array, int size, int index, short element) method in class:ArrayUtil 641 public static int[] insert(int[] array, int size, int index, int element) method in class:ArrayUtil 757 public static long[] insert(long[] array, int size, int index, long element) method in class:ArrayUtil 873 public static Object[] insert(Object[] array, int size, int index, Object element) method in class:ArrayUtil
|