| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/build/builders/ |
| LibraryDeltaVisitor.java | 55 String[] segments = path.segments(); local
58 // segments.length = 1
59 if (segments.length == 1) {
63 } else if (segments.length == 2) {
64 if (SdkConstants.FD_RESOURCES.equalsIgnoreCase(segments[1])) {
68 } else if (SdkConstants.FD_NATIVE_LIBS.equalsIgnoreCase(segments[1])) {
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| ComboSource.java | 38 String[] segments = path.split(); local
39 if (segments.length < 2) {
47 dataManager.getMediaSetsFromString(segments[1]));
51 dataManager.getMediaSetsFromString(segments[2]), segments[1]);
|
| PathMatcher.java | 33 String[] segments = Path.split(pattern); local
35 for (int i = 0; i < segments.length; i++) {
36 current = current.addChild(segments[i]);
42 String[] segments = path.split(); local
45 for (int i = 0; i < segments.length; i++) {
46 Node next = current.getChild(segments[i]);
50 mVariables.add(segments[i]);
|
| Path.java | 85 String[] segments = split(); local
86 for (int i = 0; i < segments.length; i++) {
88 sb.append(segments[i]);
96 String[] segments = split(s); local
98 for (int i = 0; i < segments.length; i++) {
99 current = current.getChild(segments[i]);
111 String[] segments = new String[n]; local
114 segments[i--] = p.mSegment;
116 return segments;
126 ArrayList<String> segments = new ArrayList<String>() local
155 ArrayList<String> segments = new ArrayList<String>(); local
[all...] |
| /frameworks/base/media/libmedia/ |
| ToneGenerator.cpp | 35 { segments: {{ duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1336, 941, 0 }, 0, 0},
39 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1209, 697, 0 }, 0, 0 },
43 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1336, 697, 0 }, 0, 0 },
47 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1477, 697, 0 }, 0, 0 },
51 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1209, 770, 0 }, 0, 0 },
55 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1336, 770, 0 }, 0, 0 },
59 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1477, 770, 0 }, 0, 0 },
63 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1209, 852, 0 }, 0, 0 },
67 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1336, 852, 0 }, 0, 0 },
71 { segments: { { duration: ToneGenerator::TONEGEN_INF, waveFreq: { 1477, 852, 0 }, 0, 0 }
[all...] |
| /external/skia/src/utils/ |
| SkUnitMappers.cpp | 3 SkDiscreteMapper::SkDiscreteMapper(int segments) {
4 if (segments < 2) {
8 if (segments > 0xFFFF) {
9 segments = 0xFFFF;
11 fSegments = segments;
12 fScale = SK_Fract1 / (segments - 1);
|
| /external/skia/gpu/src/ |
| GrGLProgram.cpp | 331 ShaderCodeSegments segments; local
361 GrAssert(0 == segments.fHeader.size());
362 segments.fHeader.printf("#version 150\n");
364 segments.fFSOutputs.appendf("out vec4 %s;\n", fsColorOutput);
370 segments.fVSAttrs += "attribute mat3 " VIEW_MATRIX_NAME ";\n";
373 segments.fVSUnis += "uniform mat3 " VIEW_MATRIX_NAME ";\n";
376 segments.fVSAttrs += "attribute vec2 " POS_ATTR_NAME ";\n";
378 segments.fVSCode.append(
389 segments.fVSAttrs.append( "attribute vec4 " COL_ATTR_NAME ";\n");
390 segments.fVaryings.append("varying vec4 vColor;\n")
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/app/ |
| FilterUtils.java | 122 String[] segments = path.split(); local
124 for (int i = 0; i < segments.length; i++) {
125 if (segments[i].startsWith("{")) {
126 String[] sets = Path.splitSequence(segments[i]);
135 if (segments[0].equals("cluster")) {
137 if (segments.length == 4) {
141 int ctype = toClusterType(segments[2]);
236 String[] segments = Path.split(base);
237 if (segments[0].equals("cluster")) {
239 return Path.splitSequence(segments[1])[0]
[all...] |
| /external/icu4c/layout/ |
| LookupTables.h | 57 const LookupSegment *lookupSegment(const LookupSegment *segments, LEGlyphID glyph) const;
69 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentSingleLookupTable
74 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentArrayLookupTable
|
| SegmentArrayProcessor.cpp | 38 const LookupSegment *segments = segmentArrayLookupTable->segments; local
44 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segments, thisGlyph);
|
| SegmentSingleProcessor.cpp | 38 const LookupSegment *segments = segmentSingleLookupTable->segments; local
44 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segments, thisGlyph);
|
| LookupTables.cpp | 27 const LookupSegment *BinarySearchLookupTable::lookupSegment(const LookupSegment *segments, LEGlyphID glyph) const
33 const LookupSegment *entry = segments;
|
| /external/sonivox/jet_tools/JetCreator/ |
| JetDebug.py | 43 def DumpSegments1(segments):
44 for segment in segments:
56 def DumpSegments(segments):
57 for segment in segments:
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 78 * The basic strategy is to subdivide the table among Segments,
111 * The maximum number of segments to allow; used to bound
127 * Mask value for indexing into segments. The upper bits of a
133 * Shift value for indexing within segments.
138 * The segments, each of which is a specialized hash table
140 final Segment<K,V>[] segments; field in class:ConcurrentHashMap
172 return segments[(hash >>> segmentShift) & segmentMask];
209 * Segments are specialized versions of hash tables. This
215 * Segments maintain a table of entry lists that are ALWAYS
262 * of segments computing size or checking containsValue, the
675 final Segment<K,V>[] segments = this.segments; local
714 final Segment<K,V>[] segments = this.segments; local
802 final Segment<K,V>[] segments = this.segments; local
[all...] |
| /external/skia/include/utils/ |
| SkUnitMappers.h | 26 SkDiscreteMapper(int segments);
|
| /external/webp/src/enc/ |
| config.c | 39 config->segments = 4;
70 config->segments = 2;
89 if (config->segments < 1 || config->segments > 4)
|
| /packages/apps/Email/src/com/android/email/provider/ |
| AttachmentProvider.java | 102 List<String> segments = uri.getPathSegments(); local
103 String id = segments.get(1);
104 String format = segments.get(2);
149 List<String> segments = uri.getPathSegments(); local
150 String accountId = segments.get(0);
151 String id = segments.get(1);
164 List<String> segments = uri.getPathSegments(); local
165 String accountId = segments.get(0);
166 String id = segments.get(1);
167 String format = segments.get(2)
255 List<String> segments = uri.getPathSegments(); local
[all...] |
| /external/opencv/cvaux/src/ |
| cvbgfg_common.cpp | 46 // segments - pointer to result of segmentation (for example MeanShiftSegmentation)
48 CV_IMPL void cvRefineForegroundMaskBySegm( CvSeq* segments, CvBGStatModel* bg_model )
52 for( ; segments; segments = ((CvSeq*)segments)->h_next )
54 CvSeq seq = *segments;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/resources/manager/ |
| ProjectClassLoader.java | 123 // get the class name segments
124 String[] segments = name.split("\\."); //$NON-NLS-1$ local
127 File classFile = getFile(outFolder, segments, 0);
161 * @param segments the segments containing the path of the file
162 * @param index the offset at which to start looking into segments.
165 private File getFile(File parent, String[] segments, int index)
168 if (index == segments.length) {
172 String toMatch = segments[index];
175 // we're at the last segments. we look for a matching <file>.clas
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| WidgetPullParser.java | 46 String[] segments = mDescriptor.getFullClassName().split(AdtConstants.RE_DOT); local
47 mAttributes[0][1] = segments[segments.length-1];
|
| /external/libxslt/libxslt/ |
| attrvt.c | 40 int nb_seg; /* Number of segments */
51 void *segments[MAX_AVT_SEG]; member in struct:_xsltAttrVT
102 if (avt->segments[i] != NULL)
103 xmlFree((xmlChar *) avt->segments[i]);
105 xmlXPathFreeCompExpr((xmlXPathCompExprPtr) avt->segments[i]);
108 xmlXPathFreeCompExpr((xmlXPathCompExprPtr) avt->segments[i]);
110 if (avt->segments[i] != NULL)
111 xmlFree((xmlChar *) avt->segments[i]);
140 * needs to be added to the 'segments' array within the xsltAttrVT
154 memset(&avt->segments[avt->nb_seg], 0, MAX_AVT_SEG*sizeof(void *))
[all...] |
| /external/guava/src/com/google/common/collect/ |
| CustomConcurrentHashMap.java | 540 * The basic strategy is to subdivide the table among Segments,
554 * The maximum number of segments to allow; used to bound constructor
575 * Mask value for indexing into segments. The upper bits of a key's hash
581 * Shift value for indexing within segments. Helps prevent entries that
587 * The segments, each of which is a specialized hash table
589 final Segment[] segments; field in class:CustomConcurrentHashMap.Impl
612 this.segments = newSegmentArray(segmentCount);
627 for (int i = 0; i < this.segments.length; ++i) {
628 this.segments[i] = new Segment(segmentSize);
689 return segments[(hash >>> segmentShift) & segmentMask]
1228 final Segment[] segments = this.segments; local
1269 final Segment[] segments = this.segments; local
1368 final Segment[] segments = this.segments; local
1907 static final Field segments = findField("segments"); field in class:CustomConcurrentHashMap.Impl.Fields
[all...] |
| /external/webkit/LayoutTests/fast/url/script-tests/ |
| trivial-segments.js | 12 shouldBe("segments('" + cases[i][0] + "')",
|
| /external/freetype/src/autofit/ |
| afwarp.c | 21 * within a single dimension so that as much of its segments are aligned
66 /* Score segments for a given `scale' and `delta' in the range */
78 AF_Segment segments,
122 FT_Pos len = segments[nn].max_coord - segments[nn].min_coord;
123 FT_Pos y0 = FT_MulFix( segments[nn].pos, scale ) + delta;
128 /* score the length of the segments for the given range */
179 AF_Segment segments; local
200 segments = axis->segments;
[all...] |
| /external/icu4c/i18n/ |
| rbt_rule.cpp | 47 * segments, or null if there are none. The array itself is adopted,
65 segments(0),
100 // We don't validate the segments array. The caller must
101 // guarantee that the segments are well-formed (that is, that
104 this->segments = segs;
172 segments = NULL;
175 segments = (UnicodeFunctor **)uprv_malloc(other.segmentsCount * sizeof(UnicodeFunctor *));
176 uprv_memcpy(segments, other.segments, other.segmentsCount*sizeof(segments[0]))
[all...] |
