/external/skia/src/gpu/gl/ |
H A D | GrGLProgram.h | 359 ShaderCodeSegments* segments, 363 ShaderCodeSegments* segments) const; 370 ShaderCodeSegments* segments) const; 373 const ShaderCodeSegments& segments,
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | MapMakerInternalMapTest.java | 96 assertEquals(4, map.segments.length); 98 assertEquals(16 / map.segments.length, map.segments[0].table.length()); 160 assertEquals(segmentCount, map.segments.length); 201 for (int i = 0; i < map.segments.length; i++) { 202 assertEquals(segmentSize, map.segments[i].table.length()); 237 for (int i = 0; i < map.segments.length; i++) { 238 totalCapacity += map.segments[i].maxSegmentSize; 383 Segment<Object, Object> segment = map.segments[0]; 519 Segment<Object, Object> segment = map.segments[ [all...] |
H A D | ComputingConcurrentHashMapTest.java | 114 Segment<Object, Object> segment = map.segments[0]; 171 Segment<Object, Object> segment = map.segments[0]; 200 Segment<Object, Object> segment = map.segments[0];
|
/external/freetype/src/autofit/ |
H A D | aflatin2.c | 62 /* scan the array of segments in each direction */ 118 seg = axhints->segments; 125 /* we only consider stem segments there! */ 848 /* now slightly increase the height of segments when this makes */ 851 AF_Segment segments = axis->segments; local 852 AF_Segment segments_end = segments + axis->num_segments; 855 for ( segment = segments; segment < segments_end; segment++ ) 895 /* place all segments with a negative direction to the start 899 AF_Segment segments local 939 AF_Segment segments = axis->segments; local 1043 AF_Segment segments = axis->segments; local [all...] |
H A D | afcjk.c | 73 /* scan the array of segments in each direction */ 131 seg = axhints->segments; 138 /* we only consider stem segments there! */ 686 AF_Segment segments = axis->segments; local 687 AF_Segment segment_limit = segments + axis->num_segments; 698 for ( seg = segments; seg < segment_limit; seg++ ) 730 AF_Segment segments = axis->segments; local 731 AF_Segment segment_limit = segments 899 AF_Segment segments = axis->segments; local [all...] |
H A D | aflatin.c | 51 /* Find segments and links, compute all stem widths, and initialize */ 59 /* scan the array of segments in each direction */ 119 seg = axhints->segments; 126 /* we only consider stem segments there! */ 183 /* Find all blue zones. Flat segments give the reference points, */ 184 /* round segments the overshoot positions. */ 723 /* Walk over all contours and compute its segments. */ 887 /* now slightly increase the height of segments when this makes */ 890 AF_Segment segments = axis->segments; local 950 AF_Segment segments = axis->segments; local 1047 AF_Segment segments = axis->segments; local [all...] |
H A D | afhints.h | 36 /* i.e., vertical segments & edges */ 38 /* i.e., horizontal segments & edges */ 71 * find segments in an outline. A segment is a series of consecutive 76 * `fake' segments that are generated to hint metrics appropriately, 82 * As soon as segments are defined, the auto-hinter groups them into 84 * dimension that collects one or more segments (allowing for a small 88 * segments on the edges unless it detects that they form a serif. 111 * A stem is made of two segments that face each other in opposite 113 * vocabulary from the TrueType specification, stem segments form a 116 * In the above ASCII drawing, the horizontal segments ar 317 AF_Segment segments; /* segments array */ member in struct:AF_AxisHintsRec_ [all...] |
/external/replicaisland/src/com/replica/replicaisland/ |
H A D | CollisionSystem.java | 26 * world. This version is based on a collision world of line segments, organized into an array of 30 * This class also provides a system for runtime-generated collision segments. These temporary 31 * segments are cleared each frame, and consequently must be constantly re-submitted if they are 32 * intended to persist. Temporary segments are useful for dynamic solid objects, such as moving 37 * implementations to executeRay. Provided is TileTestVisitor, a visitor that compares the segments 100 * @param movementDirection If set, only segments with normals that oppose this direction will 101 * be counted as valid intersections. If null, all intersecting segments will be 206 boolean hit = testBoxAgainstList(mCollisionTiles[tileIndex].segments, 220 // temporary segments 258 // frame execution order. So each frame we queue up inserted segments an 431 testSegmentAgainstList(FixedSizeArray<LineSegment> segments, Vector2 startPoint, Vector2 endPoint, Vector2 hitPoint, Vector2 hitNormal, Vector2 movementDirection, GameObject excludeObject) argument 475 testBoxAgainstList(FixedSizeArray<LineSegment> segments, float left, float right, float top, float bottom, Vector2 movementDirection, GameObject excludeObject, Vector2 outputOffset, FixedSizeArray<HitPoint> outputHitPoints) argument 842 public FixedSizeArray<LineSegment> segments; field in class:CollisionSystem.CollisionTile [all...] |
/external/guava/guava-tests/test/com/google/common/cache/ |
H A D | LocalCacheTest.java | 142 assertEquals(4, map.segments.length); 144 assertEquals(16 / map.segments.length, map.segments[0].table.length()); 207 assertEquals(segmentCount, map.segments.length); 248 for (int i = 0; i < map.segments.length; i++) { 249 assertEquals(segmentSize, map.segments[i].table.length()); 284 for (int i = 0; i < map.segments.length; i++) { 285 totalCapacity += map.segments[i].maxSegmentWeight; 295 for (int i = 0; i < map.segments.length; i++) { 296 totalCapacity += map.segments[ [all...] |
/external/webkit/Source/WebCore/platform/ |
H A D | SharedBuffer.cpp | 130 // No need to use segments for small resource data 239 unsigned segments = m_segments.size(); local 241 ASSERT(segment < segments); 245 return segment == segments - 1 ? segmentedSize - position : segmentSize - positionInSegment;
|
/external/webkit/Source/WebCore/platform/graphics/wince/ |
H A D | PlatformPathWinCE.cpp | 39 static void quadCurve(int segments, Vector<PathPoint>& pts, const PathPoint* control) argument 41 const float step = 1.0 / segments; 53 pts.resize(offset + segments); 58 for (int i = 1; i < segments; ++i) { 74 pts[offset + segments - 1] = pp; 77 static inline void bezier(int segments, Vector<PathPoint>& pts, const PathPoint* control) argument 79 const float step = 1.0 / segments; 93 pts.resize(offset + segments); 98 for (int i = 1; i < segments; ++i) { 117 pts[offset + segments [all...] |
/external/webkit/Source/WebCore/svg/ |
H A D | SVGPathParser.cpp | 460 int segments = ceilf(fabsf(thetaArc / (piOverTwoFloat + 0.001f))); local 461 for (int i = 0; i < segments; ++i) { 462 float startTheta = theta1 + i * thetaArc / segments; 463 float endTheta = theta1 + (i + 1) * thetaArc / segments;
|
/external/sonivox/jet_tools/JetCreator/ |
H A D | JetCreator.py | 267 """ Loads up the list of segments """
269 segments = self.jet_file.GetSegments()
271 self.SegSort(segments, "segname")
273 self.SegSort(segments, "filename")
275 self.SegSort(segments, "dlsfile")
277 self.SegSort(segments, "start")
279 self.SegSort(segments, "end")
281 self.SegSort(segments, "quantize")
283 self.SegSort(segments, "transpose")
285 self.SegSort(segments, "repea [all...] |
H A D | JetUtils.py | 38 """ Handles cut/copy/pasting of events and segments """
535 for segment in test_jet_file.segments:
761 for tmp in jet_file.segments:
777 for tmp in jet_file.segments:
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | LocalCache.java | 97 * across different segments. 129 /** The maximum number of segments to allow; used to bound constructor arguments. */ 158 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose 164 * Shift value for indexing within segments. Helps prevent entries that end up in the same segment 169 /** The segments, each of which is a specialized hash table. */ 170 final Segment<K, V>[] segments; field in class:LocalCache 219 * Accumulates global cache statistics. Note that there are also per-segments stats counters 276 this.segments = newSegmentArray(segmentCount); 292 for (int i = 0; i < this.segments.length; ++i) { 296 this.segments[ [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | MapMakerInternalMap.java | 78 * across different segments. 110 /** The maximum number of segments to allow; used to bound constructor arguments. */ 139 * Mask value for indexing into segments. The upper bits of a key's hash code are used to choose 145 * Shift value for indexing within segments. Helps prevent entries that end up in the same segment 150 /** The segments, each of which is a specialized hash table. */ 151 final transient Segment<K, V>[] segments; field in class:MapMakerInternalMap 235 this.segments = newSegmentArray(segmentCount); 251 for (int i = 0; i < this.segments.length; ++i) { 255 this.segments[i] = 259 for (int i = 0; i < this.segments [all...] |
/external/quake/quake/src/WinQuake/ |
H A D | dos_v2.cpp | 20 #include <sys/segments.h>
|
/external/webp/include/webp/ |
H A D | encode.h | 58 int segments; // maximum number of segments to use, in [1..4] member in struct:__anon13648 124 // DC/AC/uv coefficients for each (0..3) segments. 125 int segment_size[4]; // number of macroblocks in each segments 126 int segment_quant[4]; // quantizer values for each segments 127 int segment_level[4]; // filtering strength for each segments [0..63]
|
/external/e2fsprogs/intl/ |
H A D | loadmsgcat.c | 1086 /* Get the values of the system dependent segments. */ 1139 const struct segment_pair *p = sysdep_string->segments; 1142 for (p = sysdep_string->segments;; p++) 1218 sysdep_string->segments; 1222 for (p = sysdep_string->segments;; p++) 1259 sysdep_string->segments; 1261 /* Concatenate the segments, and fill 1283 for (p = sysdep_string->segments;; p++)
|
/external/bluetooth/glib/glib/ |
H A D | gtestutils.c | 924 gchar **segments; local 933 segments = g_strsplit (testpath, "/", -1); 934 for (ui = 0; segments[ui] != NULL; ui++) 936 const char *seg = segments[ui]; 937 gboolean islast = segments[ui + 1] == NULL; 954 g_strfreev (segments);
|
/external/webkit/Tools/android/flex-2.5.4a/MISC/ |
H A D | alloca.c | 230 long shsize:32; /* Current size of stack (all segments). */ 292 long segments; /* Current number of stack segments. */ member in struct:stk_stat 293 long maxs; /* Maximum number of stack segments so far. */ 343 /* We want to iterate through all of the segments. The first 362 /* Discard segments that do not contain our argument address. */ 376 of all predecessor segments. */ 442 a stack overflow. Discard stack segments which do not
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.metadata_2.0.0.v20100601.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.ui.forms_3.5.2.r36_v20100702.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/libyuv/files/source/ |
H A D | rotate_neon.s | 23 @ work on segments that are multiples of 16 49 @ reverse the bytes in the 64 bit segments. unable to reverse 54 @ reverse the writing out of the two 64 bit segments. 292 @ work on input segments that are multiples of 16, but 293 @ width that has been passed is output segments, half 316 @ reverse the bytes in the 64 bit segments
|
/external/webp/src/enc/ |
H A D | webpenc.c | 68 hdr->num_segments_ = enc->config_->segments;
|