| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| H A D | rmepsilon.h | 141 while (!eps_queue_.empty()) {
183 while (!visited_states_.empty()) {
244 while (!states.empty()) {
251 while (!arcs.empty()) {
389 while (!arcs.empty()) {
|
| H A D | shortest-path.h | 293 while (!heap.empty()) {
|
| H A D | synchronize.h | 99 const String *empty = FindString(new String()); local
100 StateId start = FindState(Element(fst_->Start(), empty, empty));
110 if ((w != Weight::Zero()) && (e.istring)->empty() && (e.ostring)->empty())
145 if (!s->empty())
157 if (l && !(s->empty())) r->push_back(l);
170 // Tests if the concatenation of s and l is empty
172 if (s->empty())
|
| H A D | union-find.h | 47 CHECK(exec_stack_.empty());
52 for (; ! exec_stack_.empty(); exec_stack_.pop()) {
|
| H A D | vector-fst.h | 252 if (!state->arcs.empty()) {
548 if (!filename.empty()) {
|
| /external/sonivox/jet_tools/JetCreator/ |
| H A D | JetCtrls.py | 230 if loadEmpty or not track.empty:
|
| H A D | midifile.py | 193 def __init__ (self, track, channel, name, empty):
197 self.empty = empty
1447 empty = False
1450 empty = True
1452 md.trackList.append(trackGrid(track.trackNum, trk, track.name, empty))
|
| /external/skia/platform_tools/android/tests/ |
| H A D | makefile_writer_tests.py | 131 for empty in (None, []):
133 makefile_writer.write_group(f, 'name', empty, truth)
|
| /external/skia/src/core/ |
| H A D | SkAntiRun.h | 27 bool empty() const { function in class:SkAlphaRuns
|
| H A D | SkBitmapHeap.cpp | 266 } else if (originalBitmap.empty()) {
|
| H A D | SkBitmapScaler.cpp | 181 SkASSERT(!filterValues.empty());
268 // return empty.
|
| H A D | SkClipStack.cpp | 16 // 0-2 are reserved for invalid, empty & wide-open
107 // Should this set to an empty, inverse filled path?
191 // The calling code will correctly set the result to the empty clip
240 // (which should yield the empty set) or reduces the
271 // the xor could yield the empty set. Similarly the xor
382 // either wide-open or empty.
414 SkDEBUGFAIL("We shouldn't get here with an empty element.");
568 while (!fDeque.empty()) {
587 while (!fDeque.empty()) {
837 if (fDeque.empty()) {
[all...] |
| H A D | SkData.cpp | 58 SK_DECLARE_STATIC_LAZY_PTR(SkData, empty, NewEmptyImpl, DeleteEmpty);
59 return SkRef(empty.get());
|
| H A D | SkPathRef.cpp | 39 SK_DECLARE_STATIC_LAZY_PTR(SkPathRef, empty, CreateEmptyImpl);
40 return SkRef(empty.get());
81 * Special gotchas if the path is effectively empty (<= 1 point) or
82 * if it is non-finite. In those cases bounds need to stay empty,
422 // empty ID
|
| H A D | SkScan_AntiPath.cpp | 145 if (!fRuns.empty()) {
|
| /external/skia/src/device/xps/ |
| H A D | SkXPSDevice.cpp | 431 if (!this->fTypefaces.empty()) {
2035 if (!this->fTypefaces.empty()) {
|
| /external/skia/src/effects/ |
| H A D | SkLayerRasterizer.cpp | 109 if (fLayers->empty()) {
|
| /external/skia/src/fonts/ |
| H A D | SkRemotableFontMgr.cpp | 24 SK_DECLARE_STATIC_LAZY_PTR(SkRemotableFontIdentitySet, empty, NewEmptyImpl);
25 return SkRef(empty.get());
|
| /external/skia/src/gpu/ |
| H A D | GrAllocPool.cpp | 51 bool empty() const { return fBytesTotal == fBytesFree; } function in struct:GrAllocPool::Block
95 if (fBlock->empty()) {
|
| H A D | GrAllocator.h | 106 bool empty() const { return fCount == 0; } function in class:GrAllocator
208 bool empty() const { return fAllocator.empty(); } function in class:GrTAllocator
|
| H A D | GrBufferAllocPool.cpp | 63 while (!fBlocks.empty()) {
88 while (!fBlocks.empty()) {
123 SkASSERT(!fBlocks.empty());
131 SkASSERT(fBlocks.empty() || !fBlocks.back().fBuffer->isMapped());
145 SkASSERT((fBytesInUse && !fBlocks.empty()) ||
148 SkASSERT((0 == fBytesInUse) == fBlocks.empty());
232 SkASSERT(!fBlocks.empty());
328 SkASSERT(!fBlocks.empty());
|
| H A D | GrClipMaskCache.h | 27 while (!fStack.empty()) {
53 if (fStack.empty()) {
72 //SkASSERT(!fStack.empty());
74 if (!fStack.empty()) {
84 if (fStack.empty()) {
93 if (fStack.empty()) {
105 if (fStack.empty()) {
119 if (fStack.empty()) {
131 if (fStack.empty()) {
147 if (fStack.empty()) {
[all...] |
| H A D | GrInOrderDrawBuffer.cpp | 921 return fStates.empty() || !fStates.back().isEqual(this->getDrawState());
928 (fClips.empty() ||
|
| H A D | GrOrderedSet.h | 17 * Creates an empty set
27 bool empty() const { return fRBTree.empty(); } function in class:GrOrderedSet
54 * @return an iterator to the first item in sorted order, or end() if empty
59 * Gets the last valid iterator. This is always valid, even on an empty.
67 * empty.
|
| H A D | GrRedBlackTree.h | 46 * Creates an empty tree.
55 * legal to decerement end() if the tree is not empty to get the last
75 bool empty() const {return 0 == fCount;} function in class:GrRedBlackTree
83 * @return an iterator to the first item in sorted order, or end() if empty
87 * Gets the last valid iterator. This is always valid, even on an empty.
94 * empty.
615 // the new root (if the tree is not empty) black.
|