HomeSort by relevance Sort by last modified time
    Searched refs:segments (Results 51 - 75 of 149) sorted by null

1 23 4 5 6

  /external/replicaisland/src/com/replica/replicaisland/
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 and then swap the
842 public FixedSizeArray<LineSegment> segments; field in class:CollisionSystem.CollisionTile
    [all...]
  /sdk/sdkmanager/libs/sdklib/tests/src/com/android/sdklib/io/
MockFileOpTest.java 39 private File createFile(String...segments) {
41 for (String segment : segments) {
  /external/guava/guava-tests/test/com/google/common/cache/
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[i].maxSegmentWeight
    [all...]
  /external/webkit/Source/WebCore/platform/
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;
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/sdk/
WidgetClassLoader.java 132 String[] segments = fqcn.split("\\."); local
133 return segments[segments.length-1];
  /external/freetype/src/autofit/
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 + axis->num_segments
899 AF_Segment segments = axis->segments; local
    [all...]
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...]
  /external/webkit/Source/WebCore/platform/graphics/wince/
PlatformPathWinCE.cpp 39 static void quadCurve(int segments, Vector<PathPoint>& pts, const PathPoint* control)
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)
79 const float step = 1.0 / segments;
93 pts.resize(offset + segments);
98 for (int i = 1; i < segments; ++i) {
117 pts[offset + segments - 1] = pp
    [all...]
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/build/
ApkBuilder.java 96 // split the path into segments.
97 String[] segments = archivePath.split("/"); local
100 if (segments.length == 0) {
108 for (int i = 0 ; i < segments.length - 1; i++) {
109 if (checkFolderForPackaging(segments[i]) == false) {
115 String fileName = segments[segments.length-1];
    [all...]
  /external/webkit/Source/WebCore/svg/
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;
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sound/
cs46xx_dsp_spos.h 98 struct dsp_segment_desc * segments; member in struct:dsp_module_desc
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sound/
cs46xx_dsp_spos.h 98 struct dsp_segment_desc * segments; member in struct:dsp_module_desc
  /external/webkit/LayoutTests/fast/url/resources/
utilities.js 29 function segments(url) function
  /external/webkit/LayoutTests/fast/url/script-tests/
segments-from-data-url.js 77 shouldBe("segments('" + cases[i][0] + "')",
  /frameworks/base/core/java/android/os/
Environment.java 639 private static File buildPath(File base, String... segments) {
641 for (String segment : segments) {
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/model/
UiClassAttributeNode.java 400 String[] segments = className.split(AdtConstants.RE_DOT);
401 if (segments.length == 1) {
506 // look for how many segments we have left.
556 // its a match. get the number of segments
557 String[] segments = fragment.getElementName().split("\\."); //$NON-NLS-1$
558 if (segments.length > packageMatchCount) {
559 packageMatchCount = segments.length;
595 // create the rest of the segments, except for the last one as indexOf will
  /external/sonivox/jet_tools/JetCreator/
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, "repeat")
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
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/guava/guava/src/com/google/common/cache/
LocalCache.java 95 * The basic strategy is to subdivide the table among Segments, each of which itself is a
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)
    [all...]
  /external/guava/guava/src/com/google/common/collect/
MapMakerInternalMap.java 76 * The basic strategy is to subdivide the table among Segments, each of which itself is a
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]
    [all...]
  /external/quake/quake/src/WinQuake/
dos_v2.cpp 20 #include <sys/segments.h>
  /frameworks/av/include/media/
ToneGenerator.h 208 static const unsigned int TONEGEN_MAX_SEGMENTS = 12; // Maximun number of segments in a tone descriptor
218 // - The array segments[] is used to generate the tone pulses. A segment is a period of time
219 // during which the tone is ON or OFF. Segments with even index (starting from 0)
220 // correspond to tone ON state and segments with odd index to OFF state.
221 // The data stored in segments[] is the duration of the corresponding period in ms.
225 // - repeatCnt indicates the number of times the sequence described by segments[] array must be repeated.
241 ToneSegment segments[TONEGEN_MAX_SEGMENTS+1]; member in class:android::ToneGenerator::ToneDescriptor
257 unsigned short mCurSegment; // Current segment index in ToneDescriptor segments[]
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/
VoicemailContentProvider.java 219 List<String> segments = uri.getPathSegments(); local
227 return new UriData(uri, uriType, segments.get(1), sourcePackage);
  /sdk/sdkmanager/libs/sdklib/tests/src/com/android/sdklib/internal/repository/archives/
ArchiveInstallerTest.java 389 private File createFile(String...segments) {
391 for (String segment : segments) {
  /external/e2fsprogs/intl/
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
    [all...]

Completed in 690 milliseconds

1 23 4 5 6