HomeSort by relevance Sort by last modified time
    Searched full:begin (Results 926 - 950 of 17279) sorted by null

<<31323334353637383940>>

  /external/chromium/chrome/browser/prefs/
pref_value_map.cc 72 PrefValueMap::iterator PrefValueMap::begin() { function in class:PrefValueMap
73 return prefs_.begin();
80 PrefValueMap::const_iterator PrefValueMap::begin() const { function in class:PrefValueMap
81 return prefs_.begin();
111 Map::const_iterator this_pref(prefs_.begin());
112 Map::const_iterator other_pref(other->prefs_.begin());
  /external/chromium/chrome/browser/sync/engine/
update_applicator.cc 21 const UpdateIterator& begin,
27 begin_(begin),
29 pointer_(begin),
33 size_t item_count = end - begin;
123 for (i = conflicting_ids_.begin(); i != conflicting_ids_.end(); ++i) {
127 for (i = successful_ids_.begin(); i != successful_ids_.end(); ++i) {
  /external/chromium/chrome/browser/tabs/
tab_strip_selection_model.cc 40 for (SelectedIndices::iterator i = selected_indices_.begin();
49 for (SelectedIndices::iterator i = selected_indices_.begin();
66 return std::find(selected_indices_.begin(), selected_indices_.end(), index) !=
73 std::sort(selected_indices_.begin(), selected_indices_.end());
78 SelectedIndices::iterator i = std::find(selected_indices_.begin(),
106 std::sort(selected_indices_.begin(), selected_indices_.end());
  /external/chromium_org/ash/wm/
window_cycle_list.cc 26 for (WindowList::const_iterator i = windows_.begin(); i != windows_.end();
34 for (WindowList::const_iterator i = windows_.begin(); i != windows_.end();
68 std::find(windows_.begin(), windows_.end(), window);
71 return it - windows_.begin();
75 WindowList::iterator i = std::find(windows_.begin(), windows_.end(), window);
77 int removed_index = static_cast<int>(i - windows_.begin());
  /external/chromium_org/chrome/browser/sync/test/integration/
single_client_sessions_sync_test.cc 77 for (SessionWindowMap::const_iterator it = windows.Get()->begin();
80 it->second->tabs.begin(); it2 != it->second->tabs.end(); ++it2) {
82 it3 = (*it2)->navigations.begin();
111 for (SessionWindowMap::const_iterator it = windows.Get()->begin();
114 it->second->tabs.begin(); it2 != it->second->tabs.end(); ++it2) {
116 it3 = (*it2)->navigations.begin();
  /external/chromium_org/chrome/browser/translate/
translate_prefs_unittest.cc 55 for (std::vector<std::string>::const_iterator it = expected.begin();
58 std::find(blocked_languages.begin(),
87 for (std::vector<std::string>::const_iterator it = expected.begin();
90 std::find(blocked_languages.begin(),
111 for (std::vector<std::string>::const_iterator it = expected.begin();
114 std::find(blocked_languages.begin(),
  /external/chromium_org/chrome/common/extensions/permissions/
socket_permission.cc 39 for (i = data_set_.begin(); i != data_set_.end(); ++i) {
56 for (i = data_set_.begin(); i != data_set_.end(); ++i) {
70 domains.begin(), domains.end()), ' '))));
78 for (i = data_set_.begin(); i != data_set_.end(); ++i) {
92 hostnames.begin(), hostnames.end()), ' '))));
99 for (i = data_set_.begin(); i != data_set_.end(); ++i) {
  /external/chromium_org/content/browser/download/
file_metadata_unittest_linux.cc 95 vector<string>::const_iterator pos = find(attr_names.begin(),
98 pos = find(attr_names.begin(), attr_names.end(), kReferrerURLAttrName);
134 EXPECT_EQ(attr_names.end(), find(attr_names.begin(), attr_names.end(),
145 EXPECT_EQ(attr_names.end(), find(attr_names.begin(), attr_names.end(),
156 EXPECT_EQ(attr_names.end(), find(attr_names.begin(), attr_names.end(),
158 EXPECT_EQ(attr_names.end(), find(attr_names.begin(), attr_names.end(),
  /external/chromium_org/net/base/
url_util.cc 45 input.data() + key_range.begin, key_range.len);
47 input.data() + value_range.begin, value_range.len);
55 key_range.begin,
56 value_range.end() - key_range.begin);
89 return url_.spec().substr(key_.begin, key_.len);
96 return url_.spec().substr(value_.begin, value_.len);
  /external/chromium_org/net/spdy/
spdy_write_queue.cc 86 for (std::deque<PendingWrite>::const_iterator it = queue_[i].begin();
95 std::deque<PendingWrite>::iterator out_it = queue->begin();
96 for (std::deque<PendingWrite>::const_iterator it = queue->begin();
113 std::deque<PendingWrite>::iterator out_it = queue->begin();
114 for (std::deque<PendingWrite>::const_iterator it = queue->begin();
130 for (std::deque<PendingWrite>::iterator it = queue_[i].begin();
  /external/chromium_org/net/websockets/
websocket_deflater.cc 101 std::deque<char>::iterator begin = buffer_.begin(); local
102 std::deque<char>::iterator end = begin + std::min(size, buffer_.size());
104 scoped_refptr<IOBufferWithSize> result = new IOBufferWithSize(end - begin);
105 std::copy(begin, end, result->data());
106 buffer_.erase(begin, end);
  /external/chromium_org/ppapi/native_client/src/trusted/plugin/
nacl_http_response_headers.cc 79 std::transform(key.begin(), key.end(), key.begin(), ::tolower);
104 std::transform(key.begin(), key.end(), key.begin(), ::tolower);
107 std::transform(cc.begin(), cc.end(), cc.begin(), ::tolower);
  /external/chromium_org/third_party/skia/src/core/
SkTRefArray.h 43 T* array = const_cast<T*>(obj->begin());
57 T* array = const_cast<T*>(obj->begin());
65 const T* begin() const { return (const T*)(this + 1); } function in class:SkTRefArray
66 const T* end() const { return this->begin() + fCount; }
69 return this->begin()[index];
90 T* array = const_cast<T*>(this->begin());
  /external/chromium_org/ui/base/accelerators/
accelerator_manager.cc 23 DCHECK(std::find(targets.begin(), targets.end(), target) == targets.end())
42 targets.insert(++targets.begin(), target);
55 std::find(targets->begin(), targets->end(), target);
62 if (accelerators_[accelerator].first && target_iter == targets->begin()) {
71 for (AcceleratorMap::iterator map_iter = accelerators_.begin();
85 for (AcceleratorTargetList::iterator iter = targets.begin();
  /external/chromium_org/ui/base/models/
list_selection_model.cc 42 for (SelectedIndices::iterator i = selected_indices_.begin();
51 for (SelectedIndices::iterator i = selected_indices_.begin();
70 return std::find(selected_indices_.begin(), selected_indices_.end(), index) !=
77 std::sort(selected_indices_.begin(), selected_indices_.end());
82 SelectedIndices::iterator i = std::find(selected_indices_.begin(),
110 std::sort(selected_indices_.begin(), selected_indices_.end());
  /external/chromium_org/v8/src/
arguments.cc 41 Object** handle = &this->begin()[kReturnValueOffset];
52 FunctionCallbackInfo<v8::Value> info(begin(),
66 PropertyCallbackInfo<ReturnValue> info(begin()); \
78 PropertyCallbackInfo<ReturnValue> info(begin()); \
91 PropertyCallbackInfo<ReturnValue> info(begin()); \
104 PropertyCallbackInfo<ReturnValue> info(begin()); \
  /external/clang/lib/Frontend/
DiagnosticRenderer.cpp 56 // range. This is where the macro name was spelled in order to begin
97 I = FixItHints.begin(), E = FixItHints.end(); I != E; ++I) {
139 SmallVector<CharSourceRange, 20> MutableRanges(Ranges.begin(),
148 for (ArrayRef<FixItHint>::const_iterator I = FixItHints.begin(),
324 for (ArrayRef<CharSourceRange>::const_iterator I = Ranges.begin(),
327 SourceLocation Begin = I->getBegin(), End = I->getEnd();
330 FileID BeginFileID = SM->getFileID(Begin);
337 while (Begin.isMacroID() && BeginFileID != EndFileID) {
338 BeginLocsMap[BeginFileID] = Begin;
339 Begin = SM->getImmediateExpansionRange(Begin).first
    [all...]
  /external/eigen/test/
stddeque.cpp 29 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator vi = v.begin();
30 typename std::deque<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin();
58 typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator vi = v.begin();
59 typename std::deque<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin();
87 typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator vi = v.begin();
88 typename std::deque<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.begin();
stdlist.cpp 29 typename std::list<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator vi = v.begin();
30 typename std::list<MatrixType,Eigen::aligned_allocator<MatrixType> >::iterator wi = w.begin();
58 typename std::list<TransformType,Eigen::aligned_allocator<TransformType> >::iterator vi = v.begin();
59 typename std::list<TransformType,Eigen::aligned_allocator<TransformType> >::iterator wi = w.begin();
87 typename std::list<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator vi = v.begin();
88 typename std::list<QuaternionType,Eigen::aligned_allocator<QuaternionType> >::iterator wi = w.begin();
  /external/iproute2/doc/
api-ip6-flowlabels.tex 4 \begin{center}
9 \begin{center}
32 \begin{enumerate}
50 \begin{itemize}
61 \begin{NB}
67 \begin{NB}
96 \begin{NB}
111 \begin{NB}
123 \begin{NB}
142 \begin{verbatim
    [all...]
  /external/skia/src/core/
SkTRefArray.h 43 T* array = const_cast<T*>(obj->begin());
57 T* array = const_cast<T*>(obj->begin());
65 const T* begin() const { return (const T*)(this + 1); } function in class:SkTRefArray
66 const T* end() const { return this->begin() + fCount; }
69 return this->begin()[index];
90 T* array = const_cast<T*>(this->begin());
  /frameworks/av/media/libstagefright/rtsp/
ARTPAssembler.cpp 78 for (List<sp<ABuffer> >::const_iterator it = frames.begin();
86 for (List<sp<ABuffer> >::const_iterator it = frames.begin();
116 CopyTimes(accessUnit, *frames.begin());
125 for (List<sp<ABuffer> >::const_iterator it = packets.begin();
132 for (List<sp<ABuffer> >::const_iterator it = packets.begin();
139 CopyTimes(accessUnit, *packets.begin());
  /frameworks/compile/mclinker/include/mcld/MC/
SymbolCategory.h 93 iterator begin();
95 const_iterator begin() const;
144 size_t begin; member in class:mcld::SymbolCategory::Category
153 begin(0),
160 { return (end - begin); }
163 { return (begin == end); }
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/
stable_sort_comp.pass.cpp 61 std::random_shuffle(v.begin() + i, v.begin() + i + M);
63 std::stable_sort(v.begin(), v.end(), first_only());
64 assert(std::is_sorted(v.begin(), v.end()));
76 std::stable_sort(v.begin(), v.end(), indirect_less());
77 assert(std::is_sorted(v.begin(), v.end(), indirect_less()));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/
copy.pass.cpp 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end());
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end());
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end()));
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end()));
64 assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end());
66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());

Completed in 776 milliseconds

<<31323334353637383940>>