| /external/llvm/include/llvm/IR/ |
| IRBuilder.h | 44 if (BB) BB->getInstList().insert(InsertPt, I);
148 /// \brief Returns true if this insert point is set.
155 /// \brief Returns the current insert point.
160 /// \brief Returns the current insert point, clearing it in the process.
167 /// \brief Sets the current insert point to a previously-saved location.
363 /// \brief Create and insert a memset to the specified pointer and the
382 /// \brief Create and insert a memcpy between the specified pointers.
402 /// \brief Create and insert a memmove between the specified
553 /// \brief Insert and return the specified instruction.
555 InstTy *Insert(InstTy *I, const Twine &Name = "") const
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
| sequence.hpp | 26 // insert helpers -------------------------------------------------//
29 inline void insert( function in namespace:boost::algorithm::detail
35 Input.insert( At, Begin, End );
39 inline void insert( function in namespace:boost::algorithm::detail
42 const InsertT& Insert )
44 ::boost::algorithm::detail::insert( Input, At, ::boost::begin(Insert), ::boost::end(Insert) );
65 // Assumption: insert and erase are expensive
87 // Replace sequence is longer, insert i
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/bsddb/test/ |
| test_dbtables.py | 71 self.tdb.Insert(tabname, {colname: pickle.dumps(3.14159, 1)})
73 self.tdb.Insert(tabname, {colname: pickle.dumps(3.14159,
120 self.tdb.Insert(tabname, row)
161 self.tdb.Insert(tabname,
175 self.tdb.Insert(tabname,
180 self.tdb.Insert(tabname,
186 self.tdb.Insert(tabname,
225 self.tdb.Insert(tabname,
233 self.tdb.Insert(tabname, {'a': "A", 'b': "B", 'c': "C", 'd': "D",
235 self.tdb.Insert(tabname, {'a': "-A", 'b': "-B", 'c': "-C", 'd': "-D"
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/bsddb/test/ |
| test_dbtables.py | 71 self.tdb.Insert(tabname, {colname: pickle.dumps(3.14159, 1)})
73 self.tdb.Insert(tabname, {colname: pickle.dumps(3.14159,
120 self.tdb.Insert(tabname, row)
161 self.tdb.Insert(tabname,
175 self.tdb.Insert(tabname,
180 self.tdb.Insert(tabname,
186 self.tdb.Insert(tabname,
225 self.tdb.Insert(tabname,
233 self.tdb.Insert(tabname, {'a': "A", 'b': "B", 'c': "C", 'd': "D",
235 self.tdb.Insert(tabname, {'a': "-A", 'b': "-B", 'c': "-C", 'd': "-D"
[all...] |
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| DWARFDIECollection.h | 37 Insert(const DWARFDebugInfoEntry *die);
|
| NameToDIE.h | 39 Insert (const lldb_private::ConstString& name, uint32_t die_offset);
|
| DWARFDIECollection.cpp | 22 DWARFDIECollection::Insert(const DWARFDebugInfoEntry *die)
28 m_dies.insert(insert_pos, die);
|
| DWARFCompileUnit.cpp | 781 func_fullnames.Insert (ConstString(name), die.GetOffset());
783 objc_class_selectors.Insert(objc_class_name_with_category, die.GetOffset());
785 objc_class_selectors.Insert(objc_class_name_no_category, die.GetOffset());
787 func_selectors.Insert (objc_selector_name, die.GetOffset());
789 func_fullnames.Insert (objc_fullname_no_category_name, die.GetOffset());
824 func_methods.Insert (ConstString(name), die.GetOffset());
826 func_basenames.Insert (ConstString(name), die.GetOffset());
829 func_fullnames.Insert (ConstString(name), die.GetOffset());
840 func_fullnames.Insert (mangled.GetMangledName(), die.GetOffset());
842 func_fullnames.Insert (mangled.GetDemangledName(), die.GetOffset())
[all...] |
| /external/v8/test/cctest/ |
| test-hashmap.cc | 49 void Insert(int x) {
52 CHECK(p != NULL); // insert is set!
98 set.Insert(1);
99 set.Insert(2);
100 set.Insert(3);
103 set.Insert(2);
104 set.Insert(3);
128 // Insert a long series of values.
137 set.Insert(x);
|
| /external/openfst/src/include/fst/ |
| heap.h | 43 // to the calling functions on heap insert. This key can be used
64 // Insert a value into the heap
65 int Insert(const T& val) {
76 return Insert(val, size_ - 1);
86 Insert(val, i);
182 // Insert (update) element at subtree rooted at index i
183 int Insert(const T& val, int i) {
|
| arcfilter.h | 88 labels_.Insert(label);
|
| /external/webrtc/src/system_wrappers/interface/ |
| map_wrapper.h | 44 int Insert(int id, void* ptr);
|
| list_wrapper.h | 82 // Insert list item after existing_previous_item. Please note that new_item
84 // new_item following a successfull insert. If insert fails new_item will
86 int Insert(ListItem* existing_previous_item,
89 // Insert list item before existing_next_item. Please note that new_item
91 // new_item following a successfull insert. If insert fails new_item will
|
| /art/runtime/base/ |
| hash_set_test.cc | 69 hash_set.Insert(test_string);
85 // Insert a bunch of elements and make sure we can find them.
87 hash_set.Insert(strings[i]);
118 // Insert a bunch of elements and make sure we can find them.
120 hash_set.Insert(strings[i]);
148 hash_seta.Insert(strings[i]);
151 hash_seta.Insert("TEST");
152 hash_setb.Insert("TEST2");
155 hash_seta.Insert(strings[i]);
185 hash_set.Insert(s)
[all...] |
| /frameworks/base/core/java/android/provider/ |
| Contacts.java | 542 return resolver.insert(GroupMembership.CONTENT_URI, values);
561 Uri contactUri = resolver.insert(People.CONTENT_URI, values);
[all...] |
| /external/v8/src/ |
| hydrogen-bce.h | 21 INLINE(void Insert(BoundsCheckKey* key, BoundsCheckBbData* data, Zone* zone));
|
| effects.h | 98 if (!this->Insert(var, &locator)) {
112 if (!this->Insert(var, &locator)) {
154 self.Insert(var, &locator);
205 bool Insert(Var var, Locator* locator) {
207 return map_->Insert(var, locator);
277 bool Insert(Var var, Locator* locator);
295 bool NestedEffectsBase<Var, kNoVar>::Insert(Var var, Locator* locator) {
297 if (!node_->effects.Insert(var, locator)) return false;
|
| /external/webrtc/src/system_wrappers/source/ |
| list_no_stl.h | 61 int Insert(ListNoStlItem* existing_previous_item,
|
| list_stl.h | 57 int Insert(ListItem* existing_previous_item, ListItem* new_item);
|
| map_no_stl.h | 48 int Insert(int id, void* ptr);
|
| /external/lzma/CPP/Common/ |
| MyVector.h | 60 void Insert(int index, T item)
128 Insert(right, item);
206 void Insert(int index, const T& item) { CPointerVector::Insert(index, new T(item)); }
254 Insert(right, item);
|
| /art/compiler/utils/ |
| growable_array.h | 78 // Insert an element to the end of a list, resizing if necessary.
79 void Insert(T elem) {
88 Insert(elem);
96 Insert(elem);
|
| /packages/apps/Dialer/src/com/android/dialer/util/ |
| IntentUtil.java | 193 intent.putExtra(ContactsContract.Intents.Insert.PHONE, phoneNumber);
196 intent.putExtra(ContactsContract.Intents.Insert.NAME, name);
199 intent.putExtra(ContactsContract.Intents.Insert.PHONE_TYPE, phoneNumberType);
|
| /packages/apps/Contacts/src/com/android/contacts/ |
| NonPhoneActivity.java | 32 import android.provider.ContactsContract.Intents.Insert;
94 intent.putExtra(Insert.PHONE, getArgumentPhoneNumber());
|
| /packages/apps/ContactsCommon/src/com/android/contacts/common/model/ |
| RawContactModifier.java | 42 import android.provider.ContactsContract.Intents.Insert;
91 // Insert possible when have valid types and under overall maximum
301 * Find the best {@link EditType} for a potential insert. The "best" is the
345 * Insert a new child of kind {@link DataKind} into the given
362 * Insert a new child of kind {@link DataKind} into the given
473 // An empty Insert must be ignored, because it won't save anything (an example
542 parseExtras(state, kind, extras, Insert.PHONE_TYPE, Insert.PHONE, Phone.NUMBER);
543 parseExtras(state, kind, extras, Insert.SECONDARY_PHONE_TYPE, Insert.SECONDARY_PHONE
[all...] |
