HomeSort by relevance Sort by last modified time
    Searched refs:segments (Results 1 - 25 of 133) sorted by null

1 2 3 4 5 6

  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/build/builders/
LibraryDeltaVisitor.java 56 String[] segments = path.segments(); local
59 // segments.length = 1
60 if (segments.length == 1) {
64 } else if (segments.length == 2) {
65 if (SdkConstants.FD_RESOURCES.equalsIgnoreCase(segments[1])) {
69 } else if (SdkConstants.FD_NATIVE_LIBS.equalsIgnoreCase(segments[1])) {
73 } else if (SdkConstants.FD_OUTPUT.equalsIgnoreCase(segments[1])) {
79 if (SdkConstants.FD_RESOURCES.equalsIgnoreCase(segments[2])) {
  /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/av/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 10 SkDiscreteMapper::SkDiscreteMapper(int segments) {
11 if (segments < 2) {
15 if (segments > 0xFFFF) {
16 segments = 0xFFFF;
18 fSegments = segments;
19 fScale = SK_Fract1 / (segments - 1);
  /external/skia/src/gpu/gl/
GrGLProgram.cpp 375 ShaderCodeSegments* segments,
378 segments->fVSOutputs.push_back();
379 segments->fVSOutputs.back().setType(type);
380 segments->fVSOutputs.back().setTypeModifier(
382 segments->fVSOutputs.back().accessName()->printf("v%s", name);
384 *vsOutName = segments->fVSOutputs.back().getName().c_str();
388 if (segments->fUsesGS) {
391 segments->fGSInputs.push_back();
392 segments->fGSInputs.back().setType(type);
393 segments->fGSInputs.back().setTypeModifier
648 ShaderCodeSegments segments; local
1793 segments, local
    [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:
  /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]);
231 String[] segments = Path.split(base);
232 if (segments[0].equals("cluster")) {
234 return Path.splitSequence(segments[1])[0]
    [all...]
  /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/src/gpu/
GrAAConvexPathRenderer.cpp 49 void center_of_mass(const SegmentArray& segments, SkPoint* c) {
53 int count = segments.count();
59 p0 = segments[0].endPt();
65 pj = segments[1].endPt() - p0;
68 const SkPoint pj = segments[i + 1].endPt() - p0;
83 const SkPoint& pt = segments[i].endPt();
101 void compute_vectors(SegmentArray* segments,
106 center_of_mass(*segments, fanPt);
107 int count = segments->count();
121 const Segment& sega = (*segments)[a]
463 SegmentArray segments; local
    [all...]
  /external/skia/include/utils/
SkUnitMappers.h 19 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/elfutils/src/
findtextrel.c 48 struct segments struct
99 static void check_rel (size_t nsegments, struct segments segments[nsegments],
311 /* Get the address ranges for the loaded segments. */
314 struct segments *segments local
315 = (struct segments *) malloc (nsegments_max * sizeof (segments[0]));
316 if (segments == NULL)
337 segments
    [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;
  /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...]
  /frameworks/testing/uiautomator/library/src/com/android/uiautomator/core/
InteractionController.java 305 * @param segments is Point array containing at least one Point object
309 public boolean swipe(Point[] segments, int segmentSteps) {
320 if(segments.length == 0)
324 ret = touchDown(segments[0].x, segments[0].y);
325 for(int seg = 0; seg < segments.length; seg++) {
326 if(seg + 1 < segments.length) {
328 xStep = ((double)(segments[seg+1].x - segments[seg].x)) / segmentSteps;
329 yStep = ((double)(segments[seg+1].y - segments[seg].y)) / segmentSteps
    [all...]
  /cts/tests/tests/webkitsecurity/assets/
policy-ignore-crash.php 13 # Add some padding because CFNetwork merges small multipart segments together.
26 # Add some padding because CFNetwork merges small multipart segments together.
  /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...]

Completed in 1366 milliseconds

1 2 3 4 5 6