| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| IndexRange.java | 22 begin = beginRange;
27 begin = 0;
31 public void set(int begin, int end) {
32 this.begin = begin;
37 return begin == end;
41 return end - begin;
44 public int begin; field in class:IndexRange
|
| IndexRangeIterator.java | 31 mPos = mRange.begin - 1;
35 mPos = mRange.begin - 1;
38 public void setRange(int begin, int end) {
39 mRange.begin = begin;
41 mPos = begin - 1;
45 return mRange.begin;
|
| PagedFeed.java | 22 public void setLoadingRange(int begin, int end) {
|
| /external/chromium/third_party/icu/source/common/ |
| chariter.cpp | 22 : textLength(0), pos(0), begin(0), end(0) {
26 : textLength(length), pos(0), begin(0), end(length) {
33 : textLength(length), pos(position), begin(0), end(length) {
45 : textLength(length), pos(position), begin(textBegin), end(textEnd) {
49 if(begin < 0) {
50 begin = 0;
51 } else if(begin > textLength) {
52 begin = textLength;
54 if(end < begin) {
55 end = begin;
[all...] |
| /external/icu4c/common/ |
| chariter.cpp | 22 : textLength(0), pos(0), begin(0), end(0) {
26 : textLength(length), pos(0), begin(0), end(length) {
33 : textLength(length), pos(position), begin(0), end(length) {
45 : textLength(length), pos(position), begin(textBegin), end(textEnd) {
49 if(begin < 0) {
50 begin = 0;
51 } else if(begin > textLength) {
52 begin = textLength;
54 if(end < begin) {
55 end = begin;
[all...] |
| /external/astl/include/ |
| algorithm | 128 // fill the range [begin, end) with copies of value, return nothing.
129 // fill_n the range [begin, begin + n) with copies of value, return
130 // the pointer at begin + n.
133 // begin and end params. Fix this when iterator are defined.
137 template<typename _T> static void fill(_T *begin, const _T *end,
140 for (; begin < end; ++begin)
141 *begin = value;
147 template<typename _T> static void fill(_T *begin, const _T *end
[all...] |
| memory | 61 static _ForwardIterator uninitialized_copy(_InputIterator begin,
66 for (; begin != end; ++begin, ++dest) {
67 new (static_cast<void*>(&*dest)) value_type(*begin);
81 static _ForwardIterator uninitialized_copy(_InputIterator begin,
87 const difference_type len = std::distance(begin, end);
98 static_cast<const void*>(&*begin), kSize * len);
114 static _ForwardIterator uninitialized_copy(_InputIterator begin,
117 for (; begin != end; ++begin, ++dest)
[all...] |
| /external/chromium/net/proxy/ |
| proxy_server.cc | 21 ProxyServer::Scheme GetSchemeFromPacType(std::string::const_iterator begin,
23 if (LowerCaseEqualsASCII(begin, end, "proxy"))
25 if (LowerCaseEqualsASCII(begin, end, "socks")) {
31 if (LowerCaseEqualsASCII(begin, end, "socks4"))
33 if (LowerCaseEqualsASCII(begin, end, "socks5"))
35 if (LowerCaseEqualsASCII(begin, end, "direct"))
44 ProxyServer::Scheme GetSchemeFromURI(std::string::const_iterator begin,
46 if (LowerCaseEqualsASCII(begin, end, "http"))
48 if (LowerCaseEqualsASCII(begin, end, "socks4"))
50 if (LowerCaseEqualsASCII(begin, end, "socks")
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| stl_util-inl.h | 52 void STLDeleteContainerPointers(ForwardIterator begin,
54 while (begin != end) {
55 ForwardIterator temp = begin;
56 ++begin;
85 return str->empty() ? NULL : &*str->begin();
90 // hash_set, or any other STL container which defines sensible begin(), end(),
101 STLDeleteContainerPointers(container->begin(), container->end());
112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| sort.h | 61 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end,
67 * @param begin Begin iterator of input sequence.
74 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end,
77 _GLIBCXX_CALL(end - begin)
81 (begin, end, comp, parallelism.get_num_threads());
84 (begin, end, comp, parallelism.get_num_threads());
90 * @param begin Begin iterator of input sequence.
97 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end
[all...] |
| checkers.h | 42 * @brief Check whether @c [begin, @c end) is sorted according to @c comp.
43 * @param begin Begin iterator of sequence.
51 is_sorted(InputIterator begin, InputIterator end,
56 if (begin == end)
59 InputIterator current(begin), recent(begin);
78 * @brief Check whether @c [begin, @c end) is sorted according to @c comp.
80 * @param begin Begin iterator of sequence
[all...] |
| partial_sum.h | 47 * @param begin Begin iterator of input sequence.
49 * @param result Begin iterator of output sequence.
58 parallel_partial_sum_basecase(InputIterator begin, InputIterator end,
63 if (begin == end)
66 while (begin != end)
68 value = bin_op(value, *begin);
71 ++begin;
78 * @param begin Begin iterator of input sequence
[all...] |
| /external/stlport/test/unit/ |
| perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end());
60 prev_permutation(v1.begin(), v1.end());
64 prev_permutation(v1.begin(), v1.end());
68 prev_permutation(v1.begin(), v1.end());
72 prev_permutation(v1.begin(), v1.end());
76 prev_permutation(v1.begin(), v1.end());
80 prev_permutation(v1.begin(), v1.end());
84 prev_permutation(v1.begin(), v1.end());
88 prev_permutation(v1.begin(), v1.end())
[all...] |
| rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0);
61 random_shuffle(v1.begin(), v1.end(), r);
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1);
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1);
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1);
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1);
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1);
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1);
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1);
69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1)
[all...] |
| rotate_test.cpp | 51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
65 rotate(v1.begin(), v1.begin()+2, v1.end());
77 rotate(v1.begin(), v1.begin()+7, v1.end());
107 __iota(v1.begin(), v1.end(), 0);
110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin())
[all...] |
| includes_test.cpp | 55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end());
61 bool r2=includes(v1.begin(), v1.end(), v2.begin(), v2.end());
77 sort(v1.begin(), v1.end(), compare_strings);
78 sort(v2.begin(), v2.end(), compare_strings);
80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings);
85 bool r2 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings)
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end());
60 prev_permutation(v1.begin(), v1.end());
64 prev_permutation(v1.begin(), v1.end());
68 prev_permutation(v1.begin(), v1.end());
72 prev_permutation(v1.begin(), v1.end());
76 prev_permutation(v1.begin(), v1.end());
80 prev_permutation(v1.begin(), v1.end());
84 prev_permutation(v1.begin(), v1.end());
88 prev_permutation(v1.begin(), v1.end())
[all...] |
| rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0);
61 random_shuffle(v1.begin(), v1.end(), r);
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1);
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1);
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1);
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1);
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1);
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1);
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1);
69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1)
[all...] |
| rotate_test.cpp | 51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
65 rotate(v1.begin(), v1.begin()+2, v1.end());
77 rotate(v1.begin(), v1.begin()+7, v1.end());
107 __iota(v1.begin(), v1.end(), 0);
110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin())
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0);
56 prev_permutation(v1.begin(), v1.end());
60 prev_permutation(v1.begin(), v1.end());
64 prev_permutation(v1.begin(), v1.end());
68 prev_permutation(v1.begin(), v1.end());
72 prev_permutation(v1.begin(), v1.end());
76 prev_permutation(v1.begin(), v1.end());
80 prev_permutation(v1.begin(), v1.end());
84 prev_permutation(v1.begin(), v1.end());
88 prev_permutation(v1.begin(), v1.end())
[all...] |
| rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0);
61 random_shuffle(v1.begin(), v1.end(), r);
62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1);
63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1);
64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1);
65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1);
66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1);
67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1);
68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1);
69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1)
[all...] |
| rotate_test.cpp | 51 __iota(v1.begin(), v1.end(), 0);
53 rotate(v1.begin(), v1.begin()+1, v1.end());
65 rotate(v1.begin(), v1.begin()+2, v1.end());
77 rotate(v1.begin(), v1.begin()+7, v1.end());
107 __iota(v1.begin(), v1.end(), 0);
110 rotate_copy(v1.begin(), v1.begin()+1, v1.end(), v2.begin())
[all...] |
| /external/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _relops_cont.h | 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
|
| /external/v8/src/ |
| disassembler.h | 36 // Print the bytes in the interval [begin, end) into f.
37 static void Dump(FILE* f, byte* begin, byte* end);
39 // Decode instructions in the the interval [begin, end) and print the
42 static int Decode(FILE* f, byte* begin, byte* end);
|
