/external/chromium_org/components/invalidation/ |
H A D | single_object_invalidation_set_unittest.cc | 32 l1.Insert(inv0); 33 l1.Insert(inv1); 34 l1.Insert(inv2); 36 l2.Insert(inv1); 37 l2.Insert(inv2); 38 l2.Insert(inv0); 65 list.Insert(Invalidation::Init(kId, 1, "one")); 68 list.Insert(Invalidation::InitUnknownVersion(kId)); 87 list.Insert(Invalidation::Init(kId, 1, "one")); 98 list.Insert(Invalidatio [all...] |
H A D | invalidation_service_test_template.h | 126 invalidation_map.Insert(syncer::Invalidation::Init(this->id1, 1, "1")); 127 invalidation_map.Insert(syncer::Invalidation::Init(this->id2, 2, "2")); 128 invalidation_map.Insert(syncer::Invalidation::Init(this->id3, 3, "3")); 144 expected_invalidations.Insert(syncer::Invalidation::Init(this->id1, 1, "1")); 145 expected_invalidations.Insert(syncer::Invalidation::Init(this->id2, 2, "2")); 156 expected_invalidations.Insert(syncer::Invalidation::Init(this->id2, 2, "2")); 157 expected_invalidations.Insert(syncer::Invalidation::Init(this->id3, 3, "3")); 233 invalidation_map.Insert(syncer::Invalidation::Init(this->id1, 1, "1")); 234 invalidation_map.Insert(syncer::Invalidation::Init(this->id2, 2, "2")); 235 invalidation_map.Insert(synce [all...] |
H A D | invalidator_test_template.h | 138 invalidation_map.Insert(Invalidation::Init(this->id1, 1, "1")); 139 invalidation_map.Insert(Invalidation::Init(this->id2, 2, "2")); 140 invalidation_map.Insert(Invalidation::Init(this->id3, 3, "3")); 155 expected_invalidations.Insert(Invalidation::Init(this->id1, 1, "1")); 156 expected_invalidations.Insert(Invalidation::Init(this->id2, 2, "2")); 167 expected_invalidations.Insert(Invalidation::Init(this->id2, 2, "2")); 168 expected_invalidations.Insert(Invalidation::Init(this->id3, 3, "3")); 240 invalidation_map.Insert(Invalidation::Init(this->id1, 1, "1")); 241 invalidation_map.Insert(Invalidation::Init(this->id2, 2, "2")); 242 invalidation_map.Insert(Invalidatio [all...] |
/external/chromium_org/extensions/browser/ |
H A D | process_map_unittest.cc | 20 EXPECT_TRUE(map.Insert("a", 1, 1)); 27 EXPECT_FALSE(map.Insert("a", 1, 1)); 31 // Insert some more items. 32 EXPECT_TRUE(map.Insert("a", 2, 2)); 33 EXPECT_TRUE(map.Insert("b", 1, 3)); 34 EXPECT_TRUE(map.Insert("b", 2, 4)); 45 EXPECT_TRUE(map.Insert("a", 1, 5));
|
/external/chromium_org/third_party/leveldatabase/src/util/ |
H A D | cache_test.cc | 57 void Insert(int key, int value, int charge = 1) { function in class:leveldb::CacheTest 58 cache_->Release(cache_->Insert(EncodeKey(key), EncodeValue(value), charge, 71 Insert(100, 101); 76 Insert(200, 201); 81 Insert(100, 102); 95 Insert(100, 101); 96 Insert(200, 201); 111 Insert(100, 101); 115 Insert(100, 102); 136 Insert(10 [all...] |
/external/chromium_org/components/enhanced_bookmarks/ |
H A D | image_store.cc | 23 Insert(to, image_info.second, image_info.first);
|
/external/chromium_org/sync/syncable/ |
H A D | scoped_parent_child_index_updater.cc | 23 index_->Insert(entry_);
|
H A D | parent_child_index_unittest.cc | 134 index_.Insert(bm_folder); 142 // Insert them out-of-order to test different cases. 143 index_.Insert(b3); // Only child. 144 index_.Insert(b4); // Right-most child. 145 index_.Insert(b1); // Left-most child. 146 index_.Insert(b2); // Between existing items. 173 index_.Insert(bm_folder); 192 // Insert in a strange order, because we can. 193 index_.Insert(f1_b2); 194 index_.Insert(f [all...] |
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 48 LListResult Insert(LList *list, void *data);
|
/external/chromium_org/chrome/browser/extensions/api/push_messaging/ |
H A D | push_messaging_invalidation_handler_unittest.cc | 113 invalidation_map.Insert( 122 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 138 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 143 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 148 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 153 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 158 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 163 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion( 181 map1.Insert(syncer::Invalidation::Init(id0, 5, "5")); 188 map2.Insert(synce [all...] |
/external/chromium_org/net/quic/crypto/ |
H A D | strike_register_test.cc | 44 EXPECT_EQ(net::NONCE_INVALID_TIME_FAILURE, set.Insert(nonce, 1000)); 46 EXPECT_EQ(net::NONCE_INVALID_TIME_FAILURE, set.Insert(nonce, 1000)); 64 EXPECT_EQ(net::NONCE_OK, set.Insert(nonce, 1000)); 65 EXPECT_EQ(net::NONCE_NOT_UNIQUE_FAILURE, set.Insert(nonce, 1000)); 81 EXPECT_EQ(net::NONCE_INVALID_TIME_FAILURE, set.Insert(nonce, 1000)); 83 EXPECT_EQ(net::NONCE_INVALID_TIME_FAILURE, set.Insert(nonce, 1100)); 94 EXPECT_EQ(net::NONCE_INVALID_ORBIT_FAILURE, set.Insert(nonce, 1100)); 103 EXPECT_EQ(net::NONCE_OK, set.Insert(nonce, 1101)); 113 EXPECT_EQ(net::NONCE_OK, set.Insert(nonce, 1101)); 114 EXPECT_EQ(net::NONCE_NOT_UNIQUE_FAILURE, set.Insert(nonc 205 InsertStatus Insert(const uint8 nonce_bytes[32], function in class:__anon9444::SlowStrikeRegister [all...] |
/external/llvm/include/llvm/IR/ |
H A D | IRBuilder.h | 490 /// \brief Insert and return the specified instruction. 492 InstTy *Insert(InstTy *I, const Twine &Name = "") const { function in class:llvm::IRBuilder 499 Constant *Insert(Constant *C, const Twine& = "") const { function in class:llvm::IRBuilder 520 return Insert(ReturnInst::Create(Context)); 525 return Insert(ReturnInst::Create(Context, V)); 539 return Insert(ReturnInst::Create(Context, V)); 544 return Insert(BranchInst::Create(Dest)); 551 return Insert(addBranchWeights(BranchInst::Create(True, False, Cond), 560 return Insert(addBranchWeights(SwitchInst::Create(V, Dest, NumCases), 568 return Insert(IndirectBrIns [all...] |
/external/chromium_org/chrome/browser/history/android/ |
H A D | android_urls_sql_handler.h | 23 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
|
H A D | urls_sql_handler.h | 21 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
|
H A D | visit_sql_handler_unittest.cc | 52 // Insert a url with only url set to verify no visit was inserted in visit 59 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 60 ASSERT_TRUE(visit_sql_handler_.Insert(&row)); 71 // Insert a url with last visit time set to verify a visit was inserted. 78 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 79 ASSERT_TRUE(visit_sql_handler_.Insert(&row)); 90 // Insert a urls with created time to verify the a visit was inserted. 98 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 99 ASSERT_TRUE(visit_sql_handler_.Insert(&row)); 110 // Insert [all...] |
H A D | urls_sql_handler_unittest.cc | 52 // Insert a row only has URL to verify the visit count and last visit time 59 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 70 // Insert a row with last visit time to verify the visit count is set to 1 by 78 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 88 // Insert a row with different last visit time and created time to verify the 97 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 107 // Insert a row with created time to verify the visit count is also set to 1 116 ASSERT_TRUE(urls_sql_handler_.Insert(&row)); 128 // Insert a row with the visit count as 1 to verify the last visit 136 ASSERT_TRUE(urls_sql_handler_.Insert( [all...] |
H A D | favicon_sql_handler.h | 24 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
|
H A D | sql_handler.h | 12 // This is a wrapper of information needed for Insert/Update/Delete 28 // table or BookmarkModel in its Insert/Update/Delete method. 31 // are inserted or updated, the corresponding Insert() or Update() method will 34 // The HistoryAndBookmarkRow given in Insert() or Update() provide the data for 53 virtual bool Insert(HistoryAndBookmarkRow* row) = 0;
|
/external/chromium_org/net/disk_cache/memory/ |
H A D | mem_rankings.h | 23 void Insert(MemEntryImpl* node);
|
/external/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | DWARFDIECollection.h | 37 Insert(const DWARFDebugInfoEntry *die);
|
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
H A D | task_dependency_manager_unittest.cc | 27 return manager->Insert(&blocker); 42 return manager->Insert(&blocker); 61 EXPECT_TRUE(manager.Insert(&blocker)); 62 EXPECT_FALSE(manager.Insert(&blocker)); 66 EXPECT_TRUE(manager.Insert(&blocker)); 112 EXPECT_TRUE(manager.Insert(NULL)); 121 EXPECT_FALSE(manager.Insert(NULL));
|
/external/chromium_org/extensions/common/ |
H A D | extension_set_unittest.cc | 70 EXPECT_TRUE(extensions.Insert(ext1)); 75 EXPECT_FALSE(extensions.Insert(ext2)); 80 EXPECT_TRUE(extensions.Insert(ext3)); 81 EXPECT_TRUE(extensions.Insert(ext4)); 135 EXPECT_TRUE(to_add->Insert(ext3)); 136 EXPECT_TRUE(to_add->Insert(ext5)); 137 EXPECT_TRUE(to_add->Insert(ext6));
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-hashmap.cc | 49 void Insert(int x) { function in class:IntSet 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/chromium_org/chrome/browser/metrics/ |
H A D | extensions_metrics_provider_unittest.cc | 57 extensions->Insert(extension); 65 extensions->Insert(extension); 73 extensions->Insert(extension);
|
/external/openfst/src/include/fst/ |
H A D | heap.h | 64 // Insert a value into the heap 65 int Insert(const T& val) { function in class:fst::Heap 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) { function in class:fst::Heap
|