Searched refs:segments (Results 1 - 17 of 17) sorted by relevance

/openjdk7/jdk/src/share/classes/javax/swing/text/
H A DSegmentCache.java51 private List<Segment> segments; field in class:SegmentCache
83 segments = new ArrayList<Segment>(11);
92 int size = segments.size();
95 return segments.remove(size - 1);
115 segments.add(segment);
/openjdk7/jdk/src/share/native/sun/font/layout/
H A DLookupTables.h83 const LookupSegment *lookupSegment(const LETableReference &base, const LookupSegment *segments, LEGlyphID glyph, LEErrorCode &success) const;
96 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentSingleLookupTable
98 LE_VAR_ARRAY(SegmentSingleLookupTable, segments)
102 LookupSegment segments[ANY_NUMBER]; member in struct:SegmentArrayLookupTable
104 LE_VAR_ARRAY(SegmentArrayLookupTable, segments)
H A DSegmentSingleProcessor2.cpp63 const LookupSegment *segments = segmentSingleLookupTable->segments; local
69 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
H A DSegmentArrayProcessor.cpp62 const LookupSegment *segments = segmentArrayLookupTable->segments; local
68 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segmentArrayLookupTable, segments, thisGlyph, success);
H A DSegmentArrayProcessor2.cpp62 const LookupSegment *segments = segmentArrayLookupTable->segments; local
68 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segmentArrayLookupTable, segments, thisGlyph, success);
H A DSegmentSingleProcessor.cpp62 const LookupSegment *segments = segmentSingleLookupTable->segments; local
68 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
H A DLookupTables.cpp52 const LookupSegment *BinarySearchLookupTable::lookupSegment(const LETableReference &base, const LookupSegment *segments, LEGlyphID glyph, LEErrorCode &success) const argument
59 LEReferenceTo<LookupSegment> entry(base, success, segments);
H A DContextualGlyphSubstProc2.cpp125 const LookupSegment *segment = lookupTable2->lookupSegment(lookupTable2->segments, gid);
H A DStateTableProcessor2.cpp145 lookupTable2->lookupSegment(lookupTable2, lookupTable2->segments, gid, success);
/openjdk7/jdk/src/share/classes/java/text/
H A DMessageFormat.java426 StringBuilder[] segments = new StringBuilder[4];
427 // Allocate only segments[SEG_RAW] here. The rest are
429 segments[SEG_RAW] = new StringBuilder();
442 segments[part].append(ch); // handle doubles
449 if (segments[SEG_INDEX] == null) {
450 segments[SEG_INDEX] = new StringBuilder();
453 segments[part].append(ch);
457 segments[part].append(ch);
465 if (segments[++part] == null) {
466 segments[par
[all...]
H A DChoiceFormat.java177 StringBuffer[] segments = new StringBuffer[2];
178 for (int i = 0; i < segments.length; ++i) {
179 segments[i] = new StringBuffer();
193 segments[part].append(ch);
199 segments[part].append(ch);
201 if (segments[0].length() == 0) {
205 String tempBuffer = segments[0].toString();
211 startValue = Double.valueOf(segments[0].toString()).doubleValue();
223 segments[0].setLength(0);
231 newChoiceFormats[count] = segments[
[all...]
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentHashMap.java110 * reduce footprint, all but one segments are constructed only
112 * in the presence of lazy construction, accesses to segments as
166 * The maximum number of segments to allow; used to bound
239 * Mask value for indexing into segments. The upper bits of a
245 * Shift value for indexing within segments.
250 * The segments, each of which is a specialized hash table.
252 final Segment<K,V>[] segments; field in class:ConcurrentHashMap
354 * reads of segments and tables) without locking. This
419 * is same for all segments, it is replicated to avoid needing
712 // Accessing segments
[all...]
/openjdk7/jdk/src/share/instrument/
H A DInvocationAdapter.c141 * to create boot class path segments to append to the boot class path.
513 * This function splits the attribute value into a list of path segments.
521 char** segments = NULL; local
528 if (segments == NULL) {
529 segments = (char**)malloc( sizeof(char**) );
531 segments = (char**)realloc( segments, (count+1)*sizeof(char**) );
533 jplis_assert(segments != (char**)NULL);
534 segments[count++] = c;
543 *paths = segments;
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java514 public SortedSet<Segment> segments = new TreeSet<Segment>(segmentComparator); field in class:HierarchicalLayoutManager.Region
752 ArrayList<Segment> segments = new ArrayList<Segment>(); field in class:HierarchicalLayoutManager.AssignXCoordinates
760 segments.add(s);
816 for (Segment s : segments) {
839 segments = newList;
846 for (Segment s : segments) {
888 for (Segment s : segments) {
911 for (Segment s : segments) {
940 for (Segment s : segments) {
943 s.region.segments
[all...]
/openjdk7/jdk/src/share/classes/sun/font/
H A DLayoutPathImpl.java99 * last segments of the path 'infinitely'. CLOSED wraps
286 * Represents a path built from segments. Each segment is
297 * the initial and final segments are considered to extend
337 // the path consists of line segments, which i'll call
366 // after we have processed all the segments we will have
607 // note we must avoid 'moveto' segments. the first segment is
828 final ArrayList<Segment> segments; // cache additional data on segments, working objects field in class:LayoutPathImpl.SegmentPath.Mapper
835 segments = new ArrayList<Segment>();
838 segments
[all...]
/openjdk7/jdk/src/share/native/sun/java2d/pipe/
H A DShapeSpanIterator.c89 segmentData *segments; /* pointer to array of path segments */ member in struct:__anon933
90 int numSegments; /* number of segments entries in array */
91 int segmentsSize; /* size of array of path segments */
93 int lowSegment; /* lower limit of segments in active range */
95 int hiSegment; /* upper limit of segments in active range */
97 segmentData **segmentTable; /* pointers to segments being stepped */
548 if (pd->segments != NULL) {
549 free(pd->segments);
1005 if (pd->segments !
[all...]
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/jpeg/
H A DJPEGImageWriter.java1392 List segments = new ArrayList();
1399 segments.add(seg);
1404 if (!segments.isEmpty()) {
1405 numScans = segments.size();
1409 SOSMarkerSegment sos = (SOSMarkerSegment) segments.get(i);
1434 * Finds all DQT marker segments and returns all the q
1461 * Finds all DHT marker segments and returns all the q

Completed in 112 milliseconds