HomeSort by relevance Sort by last modified time
    Searched refs:segments (Results 26 - 50 of 161) sorted by null

12 3 4 5 6 7

  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/resources/manager/
ProjectClassLoader.java 126 // get the class name segments
127 String[] segments = name.split("\\."); //$NON-NLS-1$ local
130 File classFile = getFile(outFolder, segments, 0);
164 * @param segments the segments containing the path of the file
165 * @param index the offset at which to start looking into segments.
168 private File getFile(File parent, String[] segments, int index)
171 if (index == segments.length) {
175 String toMatch = segments[index];
178 // we're at the last segments. we look for a matching <file>.clas
    [all...]
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java 75 * The basic strategy is to subdivide the table among Segments,
77 * reduce footprint, all but one segments are constructed only
79 * in the presence of lazy construction, accesses to segments as
133 * The maximum number of segments to allow; used to bound
149 * Mask value for indexing into segments. The upper bits of a
155 * Shift value for indexing within segments.
160 * The segments, each of which is a specialized hash table.
162 final Segment<K,V>[] segments; field in class:ConcurrentHashMap
248 * Segments are specialized versions of hash tables. This
254 * Segments maintain a table of entry lists that are alway
805 final Segment<K,V>[] segments = this.segments; local
839 final Segment<K,V>[] segments = this.segments; local
941 final Segment<K,V>[] segments = this.segments; local
1117 final Segment<K,V>[] segments = this.segments; local
1404 final Segment<K,V>[] segments = this.segments; local
1437 final Segment<K,V>[] segments = this.segments; local
    [all...]
  /external/webkit/Source/WebCore/inspector/front-end/
SummaryBar.js 137 _drawSummaryGraph: function(segments)
139 if (!segments || !segments.length) {
140 segments = [{color: "white", value: 1}];
145 // Calculate the total of all segments.
147 for (var i = 0; i < segments.length; ++i)
148 total += segments[i].value;
151 var percents = segments.map(function(s) { return Math.max(Math.round(100 * s.value / total), 1) });
159 // if we rounded up for a few segments.
170 // if we rounded down for a few segments
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/
WidgetPullParser.java 47 String[] segments = mDescriptor.getFullClassName().split(AdtConstants.RE_DOT); local
48 mAttributes[0][1] = segments[segments.length-1];
  /external/sonivox/jet_tools/JetCreator/
JetFile.py 93 """ Class to hold segments """
302 # count segments
303 segments = []
360 segments.append(JetSegment(segname, filename, start, end, length, output, quantize, jetevents, dlsfile, dump_file, int(transpose), int(repeat), int(mute_flags)))
363 self.segments = segments
364 if not len(segments):
365 #TODO: Check for segments when writing
366 #raise JetFileException('No segments defined in configuration file')
392 JINF_NUM_SMF_CHUNKS, len(self.segments),
    [all...]
  /external/e2fsprogs/intl/
gmo.h 95 /* The number of system dependent segments. */
97 /* Offset of table describing system dependent segments. */
130 /* Offset of static string segments in file. */
132 /* Alternating sequence of static and system dependent segments.
140 } segments[1]; member in struct:sysdep_string
143 /* Marker for the end of the segments[] array. This has the value 0xFFFFFFFF,
  /frameworks/testing/uiautomator/library/core-src/com/android/uiautomator/core/
InteractionController.java 473 * @param segments is Point array containing at least one Point object
477 public boolean swipe(Point[] segments, int segmentSteps) {
488 if(segments.length == 0)
492 ret = touchDown(segments[0].x, segments[0].y);
493 for(int seg = 0; seg < segments.length; seg++) {
494 if(seg + 1 < segments.length) {
496 xStep = ((double)(segments[seg+1].x - segments[seg].x)) / segmentSteps;
497 yStep = ((double)(segments[seg+1].y - segments[seg].y)) / segmentSteps
    [all...]
  /external/kernel-headers/original/linux/
kexec.h 96 struct kexec_segment __user *segments,
101 struct compat_kexec_segment __user *segments,
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/build/builders/
PreCompilerDeltaVisitor.java 184 String[] segments = path.segments(); local
187 // segments.length = 1
188 if (segments.length == 1) {
192 } else if (segments.length == 2) {
198 if (SdkConstants.FD_RESOURCES.equalsIgnoreCase(segments[1])) {
207 } else if (SdkConstants.FN_ANDROID_MANIFEST_XML.equalsIgnoreCase(segments[1])) {
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/assetstudio/
CreateAssetSetWizard.java 194 List<Object> segments = new ArrayList<Object>(); local
195 segments.add(file);
198 segments.add(folder);
202 segments.add(folder);
206 segments.add(javaProject);
208 Collections.reverse(segments);
209 TreePath path = new TreePath(segments.toArray());
  /external/guava/guava-tests/test/com/google/common/cache/
CacheBuilderTest.java 91 assertEquals(4, map.segments.length);
92 assertEquals(2, map.segments[0].table.length());
93 assertEquals(2, map.segments[1].table.length());
94 assertEquals(2, map.segments[2].table.length());
95 assertEquals(2, map.segments[3].table.length());
105 assertEquals(4, map.segments.length);
107 assertEquals(1, map.segments[0].table.length());
108 assertEquals(1, map.segments[1].table.length());
109 assertEquals(1, map.segments[2].table.length());
110 assertEquals(1, map.segments[3].table.length())
    [all...]
CacheTesting.java 132 for (Segment segment : map.segments) {
154 for (LocalCache.Segment segment : cchm.segments) {
171 for (Segment<?, ?> segment : map.segments) {
190 for (Segment<?, ?> segment : cchm.segments) {
220 for (Segment<?, ?> segment : cchm.segments) {
282 for (Segment<?, ?> segment : map.segments) {
301 for (Segment segment : map.segments) {
331 for (Segment<?, ?> segment : cchm.segments) {
344 for (Segment<?, ?> segment : cchm.segments) {
383 Segment<?, ?> segment = cchm.segments[0]
    [all...]
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/skia/src/gpu/gl/
GrGLProgram.h 151 void genGeometryShader(GrGLShaderBuilder* segments) const;
155 void genUniformCoverage(GrGLShaderBuilder* segments, SkString* inOutCoverage);
GrGLProgram.cpp 344 void gen_attribute_coverage(GrGLShaderBuilder* segments,
346 segments->fVSAttrs.push_back().set(kVec4f_GrSLType,
350 segments->addVarying(kVec4f_GrSLType, "Coverage", &vsName, &fsName);
351 segments->fVSCode.appendf("\t%s = " COV_ATTR_NAME ";\n", vsName);
353 segments->fFSCode.appendf("\tvec4 attrCoverage = %s * %s;\n",
362 void GrGLProgram::genGeometryShader(GrGLShaderBuilder* segments) const {
366 segments->fGSHeader.append("layout(triangles) in;\n"
368 segments->fGSCode.append("\tfor (int i = 0; i < 3; ++i) {\n"
371 segments->fGSCode.append("\t\tgl_PointSize = 1.0;\n");
373 GrAssert(segments->fGSInputs.count() == segments->fGSOutputs.count())
    [all...]
  /external/webkit/Source/WebKit2/Platform/
Region.cpp 93 // Check if both spans have an equal number of segments.
101 // Since the segments are equal the second segment can just be ignored.
140 // Check if this span has any segments.
152 // Check if this span has any segments.
282 Vector<int> segments; local
284 // Now iterate over the segments in each span and construct a new vector of segments.
301 segments.append(x);
306 // Add any remaining segments.
308 segments.appendRange(s1, segments1End)
    [all...]
  /external/freetype/src/autofit/
afhints.c 52 if ( FT_RENEW_ARRAY( axis->segments, old_max, new_max ) )
58 segment = axis->segments + axis->num_segments++;
235 /* Dump the array of linked segments. */
249 AF_Segment segments = axis->segments; local
250 AF_Segment limit = segments + axis->num_segments;
254 printf ( "Table of %s segments:\n",
259 for ( seg = segments; seg < limit; seg++ )
262 seg - segments,
266 AF_INDEX_NUM( seg->link, segments ),
818 AF_Segment segments = axis->segments; local
    [all...]
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 = axis->segments local
939 AF_Segment segments = axis->segments; local
1043 AF_Segment segments = axis->segments; local
    [all...]
  /external/icu4c/i18n/
rbt_rule.h 43 * <p>A rule may contain segments in its input string and segment
99 * segments. If there are no segments this is null. N.B. This is
106 UnicodeFunctor** segments; member in class:TransliterationRule
109 * The number of elements in segments[] or zero if segments is NULL.
142 * lookup services for matchers and segments.
170 * segments, or null if there are none. The array itself is adopted,
  /external/robolectric/src/main/java/android/net/
Uri__FromAndroid.java 297 * Gets the decoded path segments.
299 * @return decoded path segments, each without a leading or trailing '/'
920 final String[] segments; field in class:Uri__FromAndroid.PathSegments
923 PathSegments(String[] segments, int size) {
924 this.segments = segments;
933 return segments[index];
946 String[] segments; field in class:Uri__FromAndroid.PathSegmentsBuilder
950 if (segments == null) {
951 segments = new String[4]
984 List<String> segments = getPathSegments(); local
    [all...]
  /frameworks/base/core/java/android/net/
Uri.java 307 * Gets the decoded path segments.
309 * @return decoded path segments, each without a leading or trailing '/'
972 final String[] segments; field in class:Uri.PathSegments
975 PathSegments(String[] segments, int size) {
976 this.segments = segments;
985 return segments[index];
998 String[] segments; field in class:Uri.PathSegmentsBuilder
1002 if (segments == null) {
1003 segments = new String[4]
1036 List<String> segments = getPathSegments(); local
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
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[0]
    [all...]
  /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...]
  /packages/apps/Calendar/src/com/android/calendar/
Utils.java 920 LinkedList<DNASegment> segments = new LinkedList<DNASegment>(); local
    [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;

Completed in 1094 milliseconds

12 3 4 5 6 7