HomeSort by relevance Sort by last modified time
    Searched full:iter (Results 76 - 100 of 3571) sorted by null

1 2 34 5 6 7 8 91011>>

  /frameworks/rs/java/tests/ImageProcessing2/src/com/android/rs/image/
mandelbrot.rs 32 int iter = 0;
33 while((t2.x + t2.y < 4.f) && (iter < gMaxIteration)) {
37 iter++;
41 if(iter >= gMaxIteration) {
46 if (iter <= (gMaxIteration / 3))
47 return (uchar4){0xff * (iter / mi3), 0, 0, 0xff};
48 else if (iter <= (((gMaxIteration / 3) * 2)))
49 return (uchar4){0xff - (0xff * ((iter - mi3) / mi3)),
50 (0xff * ((iter - mi3) / mi3)), 0, 0xff};
52 return (uchar4){0, 0xff - (0xff * ((iter - (mi3 * 2)) / mi3))
    [all...]
  /frameworks/rs/java/tests/ImageProcessing_jb/src/com/android/rs/image/
mandelbrot.rs 32 int iter = 0;
33 while((t2.x + t2.y < 4.f) && (iter < gMaxIteration)) {
37 iter++;
41 if(iter >= gMaxIteration) {
46 if (iter <= (gMaxIteration / 3))
47 return (uchar4){0xff * (iter / mi3), 0, 0, 0xff};
48 else if (iter <= (((gMaxIteration / 3) * 2)))
49 return (uchar4){0xff - (0xff * ((iter - mi3) / mi3)),
50 (0xff * ((iter - mi3) / mi3)), 0, 0xff};
52 return (uchar4){0, 0xff - (0xff * ((iter - (mi3 * 2)) / mi3))
    [all...]
  /external/chromium_org/base/containers/
small_map_unittest.cc 38 SmallMap<hash_map<int, int> >::iterator iter(m.begin());
39 ASSERT_TRUE(iter != m.end());
40 EXPECT_EQ(iter->first, 0);
41 EXPECT_EQ(iter->second, 5);
42 ++iter;
43 ASSERT_TRUE(iter != m.end());
44 EXPECT_EQ((*iter).first, 9);
45 EXPECT_EQ((*iter).second, 2);
46 ++iter;
47 EXPECT_TRUE(iter == m.end())
271 SmallMap<hash_map<std::string, int> >::iterator iter; local
    [all...]
  /external/chromium/chrome/browser/ui/gtk/
gtk_tree.cc 25 gint GetRowNumForIter(GtkTreeModel* model, GtkTreeIter* iter) {
26 GtkTreePath* path = gtk_tree_model_get_path(model, iter);
47 GtkTreeIter iter; local
48 if (!gtk_tree_model_iter_nth_child(model, &iter, NULL, row)) {
52 GtkTreePath* path = gtk_tree_model_get_path(model, &iter);
57 bool RemoveRecursively(GtkTreeStore* tree_store, GtkTreeIter* iter) {
59 if (gtk_tree_model_iter_children(GTK_TREE_MODEL(tree_store), &child, iter)) {
65 return gtk_tree_store_remove(tree_store, iter);
95 bool TableAdapter::IsGroupRow(GtkTreeIter* iter) const {
101 iter, local
134 GtkTreeIter iter; local
145 &iter, local
177 GtkTreeIter iter; local
208 GtkTreeIter iter; local
249 GtkTreeIter iter; local
290 GtkTreeIter iter; local
331 GtkTreeIter iter; local
374 gtk_tree_model_get(GTK_TREE_MODEL(tree_store_), iter, local
398 GtkTreeIter iter; local
440 GtkTreeIter iter; local
455 GtkTreeIter iter; local
458 gtk_tree_model_get_iter(GTK_TREE_MODEL(tree_store_), &iter, path); local
469 GtkTreeIter iter; local
    [all...]
  /external/chromium_org/chrome/browser/ui/gtk/
gtk_tree.cc 27 gint GetRowNumForIter(GtkTreeModel* model, GtkTreeIter* iter) {
28 GtkTreePath* path = gtk_tree_model_get_path(model, iter);
49 GtkTreeIter iter; local
50 if (!gtk_tree_model_iter_nth_child(model, &iter, NULL, row)) {
54 GtkTreePath* path = gtk_tree_model_get_path(model, &iter);
59 bool RemoveRecursively(GtkTreeStore* tree_store, GtkTreeIter* iter) {
61 if (gtk_tree_model_iter_children(GTK_TREE_MODEL(tree_store), &child, iter)) {
67 return gtk_tree_store_remove(tree_store, iter);
97 bool TableAdapter::IsGroupRow(GtkTreeIter* iter) const {
103 iter, local
136 GtkTreeIter iter; local
147 &iter, local
179 GtkTreeIter iter; local
210 GtkTreeIter iter; local
251 GtkTreeIter iter; local
292 GtkTreeIter iter; local
333 GtkTreeIter iter; local
376 gtk_tree_model_get(GTK_TREE_MODEL(tree_store_), iter, local
400 GtkTreeIter iter; local
442 GtkTreeIter iter; local
457 GtkTreeIter iter; local
460 gtk_tree_model_get_iter(GTK_TREE_MODEL(tree_store_), &iter, path); local
471 GtkTreeIter iter; local
    [all...]
  /external/chromium/chrome/browser/extensions/
extension_info_map.cc 28 Map::iterator iter = disabled_extension_info_.find(extension->id()); local
29 if (iter != disabled_extension_info_.end())
30 disabled_extension_info_.erase(iter);
36 Map::iterator iter = extension_info_.find(id); local
37 if (iter != extension_info_.end()) {
39 disabled_extension_info_[id] = (*iter).second;
40 extension_info_.erase(iter);
56 Map::const_iterator iter = extension_info_.find(id); local
57 if (iter != extension_info_.end())
58 return iter->second->name()
64 Map::const_iterator iter = extension_info_.find(id); local
73 Map::const_iterator iter = disabled_extension_info_.find(id); local
81 Map::const_iterator iter = extension_info_.find(id); local
88 Map::const_iterator iter = extension_info_.find(id); local
95 Map::const_iterator iter = extension_info_.find(id); local
105 Map::const_iterator iter = extension_info_.find(id); local
139 Map::const_iterator iter = extension_info_.find(url.host()); local
    [all...]
  /external/chromium_org/ash/wm/overview/
window_selector_panels.cc 105 for (WindowList::const_iterator iter = transform_windows_.begin();
106 iter != transform_windows_.end(); ++iter) {
107 if ((*iter)->window() == window)
114 for (WindowList::const_iterator iter = transform_windows_.begin();
115 iter != transform_windows_.end(); ++iter) {
116 if ((*iter)->Contains(target))
117 return (*iter)->window();
123 for (WindowList::iterator iter = transform_windows_.begin()
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/
unique.pass.cpp 12 // template<ForwardIterator Iter>
13 // requires OutputIterator<Iter, Iter::reference>
14 // && EqualityComparable<Iter::value_type>
15 // Iter
16 // unique(Iter first, Iter last);
26 template <class Iter>
32 Iter r = std::unique(Iter(ia), Iter(ia+sa))
    [all...]
  /external/chromium_org/chromeos/dbus/
nfc_client_helpers.cc 47 for (base::DictionaryValue::Iterator iter(*dictionary);
48 !iter.IsAtEnd(); iter.Advance()) {
51 entry_writer.AppendString(iter.key());
52 AppendValueDataAsVariant(&entry_writer, iter.value());
66 for (base::ListValue::const_iterator iter = list->begin();
67 iter != list->end(); ++iter) {
68 const base::Value* value = *iter;
99 for (ObjectMap::iterator iter = object_map_.begin()
138 ObjectMap::const_iterator iter = object_map_.begin(); local
150 ObjectMap::iterator iter = object_map_.find(object_path); local
174 ObjectMap::iterator iter = object_map_.find(object_path); local
216 ObjectMap::iterator iter = object_map_.find(object_path); local
258 PathsToObjectMapsType::iterator iter = local
269 PathsToObjectMapsType::iterator iter = local
    [all...]
  /external/chromium_org/content/renderer/browser_plugin/
browser_plugin_manager.cc 50 IDMap<BrowserPlugin>::iterator iter(&instances_);
51 while (!iter.IsAtEnd()) {
52 iter.GetCurrentValue()->UpdateDeviceScaleFactor(device_scale_factor);
53 iter.Advance();
58 IDMap<BrowserPlugin>::iterator iter(&instances_);
59 while (!iter.IsAtEnd()) {
60 iter.GetCurrentValue()->UpdateGuestFocusState();
61 iter.Advance();
  /external/chromium_org/third_party/skia/src/core/
SkPathHeap.cpp 36 SkPath** iter = fPaths.begin(); local
38 while (iter < stop) {
39 (*iter)->~SkPath();
40 iter++;
55 SkPath* const* iter = fPaths.begin(); local
57 while (iter < stop) {
58 buffer.writePath(**iter);
59 iter++;
SkTLList.h 18 const typename SkTLList<T>::Iter& location);
43 class Iter;
54 typename NodeList::Iter iter; local
55 Node* node = iter.init(fList, Iter::kHead_IterStart);
59 node = iter.next();
89 T* addBefore(const T& t, const Iter& location) {
95 T* addAfter(const T& t, const Iter& location) {
100 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart);
274 typename NodeList::Iter iter; local
    [all...]
  /external/skia/src/core/
SkPathHeap.cpp 36 SkPath** iter = fPaths.begin(); local
38 while (iter < stop) {
39 (*iter)->~SkPath();
40 iter++;
55 SkPath* const* iter = fPaths.begin(); local
57 while (iter < stop) {
58 buffer.writePath(**iter);
59 iter++;
SkTLList.h 18 const typename SkTLList<T>::Iter& location);
43 class Iter;
54 typename NodeList::Iter iter; local
55 Node* node = iter.init(fList, Iter::kHead_IterStart);
59 node = iter.next();
89 T* addBefore(const T& t, const Iter& location) {
95 T* addAfter(const T& t, const Iter& location) {
100 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart);
274 typename NodeList::Iter iter; local
    [all...]
  /ndk/tests/device/test-gnustl-copy_vector_into_a_set/jni/
copy_vector_into_a_set.cpp 51 for(std::vector<PasswordForm*>::iterator iter = vector1.begin(); iter != vector1.end(); ++iter) {
52 const PasswordForm* value = *iter;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
57 const PasswordForm* value = *iter;
  /ndk/tests/device/test-stlport-copy_vector_into_a_set/jni/
copy_vector_into_a_set.cpp 51 for(std::vector<PasswordForm*>::iterator iter = vector1.begin(); iter != vector1.end(); ++iter) {
52 const PasswordForm* value = *iter;
56 for(SetOfForms::iterator iter = set1.begin(); iter != set1.end(); ++iter) {
57 const PasswordForm* value = *iter;
  /external/chromium/chrome/common/extensions/
extension_icon_set.cc 30 for (IconMap::const_reverse_iterator iter = map_.rbegin();
31 iter != map_.rend(); ++iter) {
32 if (iter->first <= size) {
33 result = iter;
41 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end();
42 ++iter) {
43 if (iter->first >= size) {
44 result = iter;
    [all...]
  /external/chromium_org/chrome/browser/extensions/
extension_commands_global_registry.cc 27 for (EventTargets::const_iterator iter = event_targets_.begin();
28 iter != event_targets_.end(); ++iter) {
30 iter->first, this);
70 extensions::CommandMap::const_iterator iter = commands.begin();
71 for (; iter != commands.end(); ++iter) {
72 if (!command_name.empty() && (iter->second.command_name() != command_name))
77 << " key: " << iter->second.accelerator().GetShortcutText();
79 event_targets_[iter->second.accelerator()].push_back
    [all...]
  /external/chromium_org/chrome/browser/ui/views/extensions/
extension_keybinding_registry_views.cc 32 for (EventTargets::const_iterator iter = event_targets_.begin();
33 iter != event_targets_.end(); ++iter)
34 focus_manager_->UnregisterAccelerator(iter->first, this);
55 extensions::CommandMap::const_iterator iter = commands.begin();
56 for (; iter != commands.end(); ++iter) {
57 if (!command_name.empty() && (iter->second.command_name() != command_name))
60 event_targets_[iter->second.accelerator()].push_back(
61 std::make_pair(extension->id(), iter->second.command_name()))
    [all...]
  /external/chromium_org/content/common/media/
media_param_traits.cc 32 PickleIterator* iter,
37 if (!m->ReadInt(iter, &format) ||
38 !m->ReadInt(iter, &channel_layout) ||
39 !m->ReadInt(iter, &sample_rate) ||
40 !m->ReadInt(iter, &bits_per_sample) ||
41 !m->ReadInt(iter, &frames_per_buffer) ||
42 !m->ReadInt(iter, &channels) ||
43 !m->ReadInt(iter, &input_channels) ||
44 !m->ReadInt(iter, &effects))
70 PickleIterator* iter,
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/lower.bound/
lower_bound.pass.cpp 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::lower_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
    [all...]
lower_bound_comp.pass.cpp 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<Iter::value_type, T>
14 // Iter
15 // lower_bound(Iter first, Iter last, const T& value);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::lower_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.binary.search/upper.bound/
upper_bound.pass.cpp 12 // template<ForwardIterator Iter, class T>
13 // requires HasLess<T, Iter::value_type>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value);
23 template <class Iter, class T>
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::upper_bound(first, last, value);
28 for (Iter j = first; j != i; ++j
    [all...]
upper_bound_comp.pass.cpp 12 // template<ForwardIterator Iter, class T, Predicate<auto, T, Iter::value_type> Compare>
14 // Iter
15 // upper_bound(Iter first, Iter last, const T& value, Compare comp);
24 template <class Iter, class T>
26 test(Iter first, Iter last, const T& value)
28 Iter i = std::upper_bound(first, last, value, std::greater<int>());
29 for (Iter j = first; j != i; ++j
    [all...]
  /external/chromium/chrome/browser/net/
quoted_printable.cc 26 for (std::string::const_iterator iter = input.begin();
27 iter != input.end(); ++iter) {
28 bool last_char = (iter + 1 == input.end());
29 char c = *iter;
40 !IsEOL(iter + 1, input)) {
46 int eol_len = IsEOL(iter, input);
50 iter += (eol_len - 1); // -1 because we'll ++ in the for() above.
78 for (std::string::const_iterator iter = input.begin();
79 iter!= input.end(); ++iter)
    [all...]

Completed in 564 milliseconds

1 2 34 5 6 7 8 91011>>