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

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/net/quic/congestion_control/
quic_max_sized_map_test.cc 19 test_map.Insert(1, 2);
20 test_map.Insert(1, 3);
30 test_map.Insert(1, 2);
31 test_map.Insert(1, 3);
32 test_map.Insert(2, 4);
33 test_map.Insert(3, 5);
47 test_map.Insert(9, 9);
48 test_map.Insert(8, 8);
49 test_map.Insert(7, 7);
50 test_map.Insert(6, 6)
    [all...]
  /external/chromium_org/sync/notifier/
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(Invalidation::Init(kId, 1, "one"))
    [all...]
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"));
147 ids.insert(this->id1);
148 ids.insert(this->id2);
155 expected_invalidations.Insert(Invalidation::Init(this->id1, 1, "1"));
156 expected_invalidations.Insert(Invalidation::Init(this->id2, 2, "2"));
163 ids.insert(this->id3);
167 expected_invalidations.Insert(Invalidation::Init(this->id2, 2, "2"));
168 expected_invalidations.Insert(Invalidation::Init(this->id3, 3, "3"))
    [all...]
  /external/chromium_org/extensions/browser/
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/
cache_test.cc 57 void Insert(int key, int value, int charge = 1) {
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(100, 101)
    [all...]
  /external/chromium_org/net/quic/crypto/
strike_register_test.cc 39 ASSERT_FALSE(set.Insert(nonce, 1000));
41 ASSERT_FALSE(set.Insert(nonce, 1000));
52 ASSERT_TRUE(set.Insert(nonce, 0));
53 ASSERT_FALSE(set.Insert(nonce, 0));
63 ASSERT_FALSE(set.Insert(nonce, 1000));
65 ASSERT_FALSE(set.Insert(nonce, 1100));
76 ASSERT_FALSE(set.Insert(nonce, 1100));
85 ASSERT_TRUE(set.Insert(nonce, 1100));
95 ASSERT_TRUE(set.Insert(nonce, 1100));
96 ASSERT_FALSE(set.Insert(nonce, 1100))
    [all...]
  /external/chromium_org/chrome/browser/history/android/
android_urls_sql_handler.h 23 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
urls_sql_handler.h 21 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
favicon_sql_handler.h 24 virtual bool Insert(HistoryAndBookmarkRow* row) OVERRIDE;
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 a URL with visit count as 1 to verify a visit was inserted
    [all...]
  /external/chromium_org/sync/syncable/
scoped_parent_child_index_updater.cc 23 index_->Insert(entry_);
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(f2)
    [all...]
  /external/srec/seti/sltsEngine/include/
linklist.h 48 LListResult Insert(LList *list, void *data);
  /external/chromium_org/chrome/browser/invalidation/
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"));
135 ids.insert(this->id1);
136 ids.insert(this->id2);
144 expected_invalidations.Insert(syncer::Invalidation::Init(this->id1, 1, "1"));
145 expected_invalidations.Insert(syncer::Invalidation::Init(this->id2, 2, "2"));
152 ids.insert(this->id3);
156 expected_invalidations.Insert(syncer::Invalidation::Init(this->id2, 2, "2"));
157 expected_invalidations.Insert(syncer::Invalidation::Init(this->id3, 3, "3"))
    [all...]
  /external/chromium_org/chrome/browser/extensions/api/push_messaging/
push_messaging_invalidation_handler_unittest.cc 83 expected_ids.insert(invalidation::ObjectId(
86 expected_ids.insert(invalidation::ObjectId(
89 expected_ids.insert(invalidation::ObjectId(
92 expected_ids.insert(invalidation::ObjectId(
107 invalidation_map.Insert(
116 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion(
132 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion(
137 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion(
142 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion(
147 invalidation_map.Insert(syncer::Invalidation::InitUnknownVersion
    [all...]
  /external/llvm/include/llvm/IR/
IRBuilder.h 42 if (BB) BB->getInstList().insert(InsertPt, I);
145 /// \brief Returns true if this insert point is set.
152 /// \brief Returns the current insert point.
157 /// \brief Returns the current insert point, clearing it in the process.
164 /// \brief Sets the current insert point to a previously-saved location.
282 /// \brief Create and insert a memset to the specified pointer and the
295 /// \brief Create and insert a memcpy between the specified pointers.
310 /// \brief Create and insert a memmove between the specified
431 /// \brief Insert and return the specified instruction.
433 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/chromium/net/disk_cache/
mem_rankings.h 24 void Insert(MemEntryImpl* node);
  /external/chromium_org/net/disk_cache/
mem_rankings.h 23 void Insert(MemEntryImpl* node);
  /external/chromium_org/third_party/angle/src/compiler/
MapLongVariableNames.h 30 // Insert a pair into the map.
31 void Insert(const char* originalName, const char* mappedName);
  /external/chromium_org/chrome/common/extensions/
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));
130 EXPECT_TRUE(to_add->Insert(ext3));
131 EXPECT_TRUE(to_add->Insert(ext5));
132 EXPECT_TRUE(to_add->Insert(ext6));
  /external/chromium_org/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/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);

Completed in 2367 milliseconds

1 2 3 4 5 6 7 8 91011>>