HomeSort by relevance Sort by last modified time
    Searched refs:Insert (Results 1 - 25 of 149) sorted by null

1 2 3 4 5 6

  /external/srec/seti/sltsEngine/include/
linklist.h 48 LListResult Insert(LList *list, void *data);
  /external/llvm/include/llvm/Support/
IRBuilder.h 38 if (BB) BB->getInstList().insert(InsertPt, I);
141 /// isSet - Returns true if this insert point is set.
148 /// saveIP - Returns the current insert point.
153 /// saveAndClearIP - Returns the current insert point, clearing it
161 /// restoreIP - Sets the current insert point to a previously-saved
273 /// CreateMemSet - Create and insert a memset to the specified pointer and the
284 /// CreateMemCpy - Create and insert a memcpy between the specified pointers.
295 /// CreateMemMove - Create and insert a memmove between the specified
396 /// Insert - Insert and return the specified instruction
    [all...]
  /external/chromium/net/disk_cache/
mem_rankings.h 24 void Insert(MemEntryImpl* node);
mem_rankings.cc 16 void MemRankings::Insert(MemEntryImpl* node) {
50 Insert(node);
  /external/v8/test/cctest/
test-hashmap.cc 48 void Insert(int x) {
51 CHECK(p != NULL); // insert is set!
97 set.Insert(1);
98 set.Insert(2);
99 set.Insert(3);
102 set.Insert(2);
103 set.Insert(3);
127 // Insert a long series of values.
136 set.Insert(x);
  /external/chromium/chrome/common/extensions/
extension_set_unittest.cc 67 extensions.Insert(ext1);
72 extensions.Insert(ext2);
77 extensions.Insert(ext3);
78 extensions.Insert(ext4);
extension_set.h 32 void Insert(const scoped_refptr<const Extension>& extension);
  /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/srec/tools/thirdparty/OpenFst/fst/lib/
heap.h 39 // to the calling functions on heap insert. This key can be used
58 // insert a value into the heap
59 int Insert(const T& val) {
70 return Insert(val, size_ - 1);
80 Insert(val, i);
169 // insert(update) element at subtree rooted at index i
170 int Insert(const T& val, int i) {
  /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
  /external/valgrind/tsan/
ts_simple_cache.h 47 void Insert(uintptr_t ptr, bool val) {
81 void Insert(uint32_t a, uint32_t b, bool val) {
thread_sanitizer_test.cc 54 // Insert range [1000, 1000+100) with value 1.
75 // Insert range [2000, 2000+200) with value 2.
104 // Insert range [3000, 3000+300) with value 3.
145 c.Insert(0, false);
146 c.Insert(1, true);
147 c.Insert(2, false);
148 c.Insert(3, true);
164 c.Insert(0, true);
165 c.Insert(1, false);
176 c.Insert(256, false)
    [all...]
  /frameworks/base/core/java/android/provider/
Contacts.java 543 return resolver.insert(GroupMembership.CONTENT_URI, values);
562 Uri contactUri = resolver.insert(People.CONTENT_URI, values);
    [all...]
  /external/chromium/chrome/browser/safe_browsing/
bloom_filter.h 42 void Insert(SBPrefix hash);
bloom_filter_unittest.cc 41 values.insert(value);
42 filter->Insert(value);
90 filter_write->Insert(GenHash());
  /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);
  /packages/apps/Contacts/src/com/android/contacts/activities/
NonPhoneActivity.java 33 import android.provider.ContactsContract.Intents.Insert;
85 intent.putExtra(Insert.PHONE, getArgumentPhoneNumber());
ContactSelectionActivity.java 45 import android.provider.ContactsContract.Intents.Insert;
423 extras.remove(Insert.NAME);
450 * the full contact editor. Ignore extras with the key {@link Insert.NAME} because names
464 if (intentExtraKeys.contains(Insert.NAME)) {
465 intentExtraKeys.remove(Insert.NAME);
470 boolean hasPhone = intentExtraKeys.contains(Insert.PHONE) &&
471 intentExtraKeys.contains(Insert.PHONE_TYPE);
472 boolean hasEmail = intentExtraKeys.contains(Insert.EMAIL) &&
473 intentExtraKeys.contains(Insert.EMAIL_TYPE);
476 return intentExtraKeys.contains(Insert.PHONE) |
    [all...]
  /packages/apps/Contacts/src/com/android/contacts/model/
EntityModifier.java 52 import android.provider.ContactsContract.Intents.Insert;
86 // Insert possible when have valid types and under overall maximum
296 * Find the best {@link EditType} for a potential insert. The "best" is the
340 * Insert a new child of kind {@link DataKind} into the given
355 * Insert a new child of kind {@link DataKind} into the given
466 // An empty Insert must be ignored, because it won't save anything (an example
535 parseExtras(state, kind, extras, Insert.PHONE_TYPE, Insert.PHONE, Phone.NUMBER);
536 parseExtras(state, kind, extras, Insert.SECONDARY_PHONE_TYPE, Insert.SECONDARY_PHONE
    [all...]
  /external/webrtc/src/common_audio/resampler/include/
resampler.h 84 int Insert(WebRtc_Word16* samplesIn, int lengthIn);
  /external/webrtc/src/system_wrappers/test/list/
list.cc 132 // Test Insert. Please note that old iterators are no longer valid at
135 FailTest(test_list.Insert(test_list.Last(),insert_item_last) != 0);
136 FailTest(test_list.Insert(NULL,insert_item_last) == 0);
138 FailTest(test_list.Insert(insert_item_last2,NULL) == 0);
164 // Test Insert APIs when list is empty
166 FailTest(test_list.Insert(NULL,new_item) != 0);

Completed in 456 milliseconds

1 2 3 4 5 6