| /prebuilts/tools/common/m2/repository/com/cocoahero/android/geojson/1.0.1/ |
| geojson-1.0.1.jar | |
| /prebuilts/go/darwin-x86/src/go/types/ |
| example_test.go | 194 posn := fset.Position(id.Pos())
203 fset.Position(obj.Pos()),
215 posn := fset.Position(expr.Pos())
|
| issues_test.go | 114 t.Errorf("%s: got %s; want %s", fset.Position(x.Pos()), tv.Type, want)
193 fact := fmt.Sprintf("L%d defs %s", fset.Position(id.Pos()).Line, obj)
198 fact := fmt.Sprintf("L%d uses %s", fset.Position(id.Pos()).Line, obj)
|
| /prebuilts/go/linux-x86/src/go/types/ |
| example_test.go | 194 posn := fset.Position(id.Pos())
203 fset.Position(obj.Pos()),
215 posn := fset.Position(expr.Pos())
|
| issues_test.go | 114 t.Errorf("%s: got %s; want %s", fset.Position(x.Pos()), tv.Type, want)
193 fact := fmt.Sprintf("L%d defs %s", fset.Position(id.Pos()).Line, obj)
198 fact := fmt.Sprintf("L%d uses %s", fset.Position(id.Pos()).Line, obj)
|
| /device/linaro/bootloader/edk2/Nt32Pkg/WinNtSimpleFileSystemDxe/ |
| WinNtSimpleFileSystem.c | [all...] |
| /external/pdfium/third_party/lcms2-2.6/src/ |
| cmsgamma.c | 163 // Search in type list, return position or -1 if not found
181 int Position;
186 Position = IsInSet(Type, c);
188 if (Position != -1) {
190 *index = Position;
197 Position = IsInSet(Type, c);
199 if (Position != -1) {
201 *index = Position;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 274 /// shift - Shift elements [i;size) 1 position to the right.
373 /// after an overflow or underflow. Reserve space for a new element at Position,
374 /// and compute the node that will hold Position after redistributing node
387 /// The returned index is the node where Position will go, so:
389 /// sum(NewSize[0..idx-1]) <= Position
390 /// sum(NewSize[0..idx]) >= Position
392 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
394 /// before the one holding the Position'th element where there is room for an
402 /// @param Position Insert position
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| IntervalMap.h | 253 /// shift - Shift elements [i;size) 1 position to the right.
352 /// after an overflow or underflow. Reserve space for a new element at Position,
353 /// and compute the node that will hold Position after redistributing node
366 /// The returned index is the node where Position will go, so:
368 /// sum(NewSize[0..idx-1]) <= Position
369 /// sum(NewSize[0..idx]) >= Position
371 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
373 /// before the one holding the Position'th element where there is room for an
381 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| IntervalMap.h | 279 /// shift - Shift elements [i;size) 1 position to the right.
378 /// after an overflow or underflow. Reserve space for a new element at Position,
379 /// and compute the node that will hold Position after redistributing node
392 /// The returned index is the node where Position will go, so:
394 /// sum(NewSize[0..idx-1]) <= Position
395 /// sum(NewSize[0..idx]) >= Position
397 /// The last equality, sum(NewSize[0..idx]) == Position, can only happen when
399 /// before the one holding the Position'th element where there is room for an
407 /// @param Position Insert position
[all...] |
| /external/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationRuleParser.java | 35 enum Position {
51 static final Position[] POSITION_VALUES = Position.values();
57 * The second contraction character is POS_BASE + Position.
229 setParseError("reset without position");
497 * Sets str to a contraction of U+FFFE and (U+2800 + Position).
498 * @return rule index after the special reset position
514 str.append(POS_LEAD).append((char)(POS_BASE + Position.LAST_REGULAR.ordinal()));
518 str.append(POS_LEAD).append((char)(POS_BASE + Position.LAST_VARIABLE.ordinal()));
522 setParseError("not a valid special reset position");
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationRuleParser.java | 31 enum Position {
47 static final Position[] POSITION_VALUES = Position.values();
53 * The second contraction character is POS_BASE + Position.
225 setParseError("reset without position");
493 * Sets str to a contraction of U+FFFE and (U+2800 + Position).
494 * @return rule index after the special reset position
510 str.append(POS_LEAD).append((char)(POS_BASE + Position.LAST_REGULAR.ordinal()));
514 str.append(POS_LEAD).append((char)(POS_BASE + Position.LAST_VARIABLE.ordinal()));
518 setParseError("not a valid special reset position");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/AST/ |
| Comment.h | 808 /// list), then this stores a list of position indexes in all template
816 /// For C: Position = { 0 }
817 /// For TT: Position = { 1 }
818 /// For T: Position = { 1, 0 }
819 ArrayRef<unsigned> Position;
849 return !Position.empty();
854 return Position.size();
859 return Position[Depth];
863 Position = NewPosition;
|
