| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 60 // input->Next(&buffer, &size);
78 // while (input->Next(&buffer, &size)) {
94 // while (output->Next(&buffer, &size)) {
143 // as repeatedly calling Next() eventually yields a buffer with non-zero
145 virtual bool Next(const void** data, int* size) = 0;
147 // Backs up a number of bytes, so that the next call to Next() returns
148 // data again that was already returned by the last call to Next(). This
150 // to a certain point in the input, then return. If Next() returns a
155 // * The last method called must have been Next()
[all...] |
| zero_copy_stream_impl_lite.h | 64 // the stream is destroyed. If a block_size is given, calls to Next()
66 // first call to Next() returns the entire array. block_size is mainly
73 bool Next(const void** data, int* size);
85 int last_returned_size_; // How many bytes we returned last time Next()
98 // the stream is destroyed. If a block_size is given, calls to Next()
100 // first call to Next() returns the entire array. block_size is mainly
107 bool Next(void** data, int* size);
117 int last_returned_size_; // How many bytes we returned last time Next()
133 // the first call to Next() will return at least n bytes of buffer
139 bool Next(void** data, int* size)
[all...] |
| zero_copy_stream_impl.h | 67 // should be read and returned with each call to Next(). Otherwise,
91 bool Next(const void** data, int* size);
145 // that should be returned by Next(). Otherwise, a reasonable default
174 bool Next(void** data, int* size);
219 // should be read and returned with each call to Next(). Otherwise,
225 bool Next(const void** data, int* size);
263 // that should be returned by Next(). Otherwise, a reasonable default
269 bool Next(void** data, int* size);
312 bool Next(const void** data, int* size);
338 bool Next(const void** data, int* size)
[all...] |
| zero_copy_stream_impl.cc | 88 bool FileInputStream::Next(const void** data, int* size) {
89 return impl_.Next(data, size);
191 bool FileOutputStream::Next(void** data, int* size) {
192 return impl_.Next(data, size);
278 bool IstreamInputStream::Next(const void** data, int* size) {
279 return impl_.Next(data, size);
322 bool OstreamOutputStream::Next(void** data, int* size) {
323 return impl_.Next(data, size);
358 bool ConcatenatingInputStream::Next(const void** data, int* size) {
360 if (streams_[0]->Next(data, size)) return true
[all...] |
| gzip_stream.h | 85 bool Next(const void** data, int* size);
177 bool Next(void** data, int* size);
183 // Result from calling Next() on sub_stream_
|
| gzip_stream.cc | 83 bool ok = sub_stream_->Next(&in, &in_size);
119 bool GzipInputStream::Next(const void** data, int* size) {
136 // The underlying stream's Next returned false inside Inflate.
154 bool ok = Next(&data, &size);
157 ok = Next(&data, &size);
242 bool ok = sub_stream_->Next(&sub_data_, &sub_data_size_);
266 bool GzipOutputStream::Next(void** data, int* size) {
|
| tokenizer_unittest.cc | 128 bool Next(const void** data, int* size) {
138 return array_stream_.Next(data, size);
255 // Before Next() is called, the initial token should always be TYPE_START.
262 ASSERT_TRUE(tokenizer.Next());
273 EXPECT_FALSE(tokenizer.Next());
275 // After Next() returns false, the token should have type TYPE_END.
296 ASSERT_TRUE(tokenizer.Next());
299 ASSERT_TRUE(tokenizer.Next());
302 ASSERT_TRUE(tokenizer.Next());
305 ASSERT_TRUE(tokenizer.Next());
[all...] |
| zero_copy_stream_impl_lite.cc | 64 bool ArrayInputStream::Next(const void** data, int* size) {
80 << "BackUp() can only be called after a successful Next().";
117 bool ArrayOutputStream::Next(void** data, int* size) {
133 << "BackUp() can only be called after a successful Next().";
153 bool StringOutputStream::Next(void** data, int* size) {
221 bool CopyingInputStreamAdaptor::Next(const void** data, int* size) {
257 << " BackUp() can only be called after Next().";
260 " to Next().";
331 bool CopyingOutputStreamAdaptor::Next(void** data, int* size) {
347 << " BackUp() can only be called after Next()."
[all...] |
| /external/chromium/net/disk_cache/ |
| cache_util_posix.cc | 22 for (FilePath file = iter.Next(); !file.value().empty(); file = iter.Next()) {
|
| /development/host/windows/usb/api/ |
| adb_interface_enum.h | 62 /** \brief Gets next enumerated interface information
76 bool Next(AdbInterfaceInfo* info, ULONG* size);
|
| adb_interface_enum.cpp | 59 bool AdbInterfaceEnumObject::Next(AdbInterfaceInfo* info, ULONG* size) {
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmfinalepsilon.h | 46 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
50 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
65 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
70 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
72 // is next state in the list of finals
|
| statesort.h | 53 siter.Next()) {
61 aiter.Next())
70 aiter.Next())
|
| dfs-visit.h | 117 piter.Next();
125 aiter.Next();
140 aiter.Next();
144 aiter.Next();
148 // Find next tree root
|
| equal.h | 101 aiter1.Next();
102 aiter2.Next();
110 siter1.Next();
111 siter2.Next();
|
| verify.h | 42 siter.Next())
55 siter.Next()) {
60 aiter.Next()) {
|
| string-weight.h | 170 void Next() {
202 void Next() {
242 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next()) {
261 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next())
269 for (StringWeightIterator<L, S> iter(*this); !iter.Done(); iter.Next())
281 // for (StringWeightIterator<L, S> iter(w); !iter.Done(); iter.Next())
296 for (; !iter1.Done() ; iter1.Next(), iter2.Next())
326 for (size_t i = 0; !iter.Done(); ++i, iter.Next()) {
390 iter1.Next(), iter2.Next()
[all...] |
| arcsum.h | 61 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
69 aiter.Next())
|
| reverse.h | 50 siter.Next()) {
66 aiter.Next()) {
|
| relabel.h | 63 !siter.Done(); siter.Next()) {
66 !aiter.Done(); aiter.Next()) {
111 syms_iter.Next()) {
121 syms_iter.Next()) {
210 syms_iter.Next()) {
220 syms_iter.Next()) {
275 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) {
421 void Next() {
424 siter_.Next();
|
| reweight.h | 60 sit.Next()) {
64 ait.Next()) {
93 ait.Next()) {
|
| /external/v8/src/ |
| dateparser.h | 72 Next();
75 // Advance to the next character of the string.
76 void Next() { ch_ = (index_ < buffer_.length()) ? buffer_[index_++] : 0; }
82 for (n = 0; IsAsciiDigit() && n < kMaxInt / 10 - 1; Next()) {
93 for (len = 0; IsAsciiAlphaOrAbove(); Next(), len++) {
101 bool Skip(uint32_t c) { return ch_ == c ? (Next(), true) : false; }
104 return Scanner::kIsWhiteSpace.get(ch_) ? (Next(), true) : false;
113 Next();
|
| /external/protobuf/src/google/protobuf/testing/ |
| zcgunzip.cc | 62 ok = in.Next(&inptr, &inlen);
|
| zcgzip.cc | 63 ok = out.Next(&outptr, &outlen);
|
| /external/libnfc-nxp/src/ |
| phFriNfc_NdefReg.c | 134 NdefCb->Next =NULL;
141 NdefCb->Next = NdefReg->NdefTypeList;
191 if(tempNode->Previous==NULL && tempNode->Next!=NULL)
193 NdefReg->NdefTypeList =NdefReg->NdefTypeList->Next;
198 if(tempNode->Next==NULL && tempNode->Previous==NULL)
205 tempNode->Previous->Next = tempNode->Next;
207 if (tempNode->Next != NULL)
209 tempNode->Next->Previous = tempNode->Previous;
213 /* move to the next node *
[all...] |
