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

/openjdk9/jdk/src/java.desktop/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);
/openjdk9/jdk/src/java.desktop/share/native/libfontmanager/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
71 const LookupSegment *lookupSegment = segmentSingleLookupTable->lookupSegment(segmentSingleLookupTable, segments, thisGlyph, success);
H A DSegmentArrayProcessor2.cpp62 const LookupSegment *segments = segmentArrayLookupTable->segments; local
71 const LookupSegment *lookupSegment = segmentArrayLookupTable->lookupSegment(segmentArrayLookupTable, segments, thisGlyph, success);
H A DSegmentArrayProcessor.cpp62 const LookupSegment *segments = segmentArrayLookupTable->segments; local
70 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.cpp133 const LookupSegment *segment = lookupTable2->lookupSegment(lookupTable2->segments, gid);
H A DStateTableProcessor2.cpp148 lookupTable2->lookupSegment(lookupTable2, lookupTable2->segments, gid, success);
/openjdk9/jdk/src/java.base/share/classes/java/text/
H A DMessageFormat.java438 StringBuilder[] segments = new StringBuilder[4];
439 // Allocate only segments[SEG_RAW] here. The rest are
441 segments[SEG_RAW] = new StringBuilder();
454 segments[part].append(ch); // handle doubles
461 if (segments[SEG_INDEX] == null) {
462 segments[SEG_INDEX] = new StringBuilder();
465 segments[part].append(ch);
469 segments[part].append(ch);
477 if (segments[++part] == null) {
478 segments[par
[all...]
H A DChoiceFormat.java180 StringBuffer[] segments = new StringBuffer[2];
181 for (int i = 0; i < segments.length; ++i) {
182 segments[i] = new StringBuffer();
196 segments[part].append(ch);
202 segments[part].append(ch);
204 if (segments[0].length() == 0) {
208 String tempBuffer = segments[0].toString();
214 startValue = Double.valueOf(segments[0].toString()).doubleValue();
226 segments[0].setLength(0);
234 newChoiceFormats[count] = segments[
[all...]
/openjdk9/jdk/src/java.instrument/share/native/libinstrument/
H A DInvocationAdapter.c141 * to create boot class path segments to append to the boot class path.
628 * This function splits the attribute value into a list of path segments.
636 char** segments = NULL; local
644 new_segments = (char**)realloc(segments, (count+1)*sizeof(char*));
647 free(segments);
649 segments = NULL;
652 segments = new_segments;
653 segments[count++] = c;
662 *paths = segments;
789 * splits it into the individual path segments, an
[all...]
/openjdk9/jdk/src/java.desktop/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...]
/openjdk9/jdk/src/java.desktop/share/native/libawt/java2d/pipe/
H A DShapeSpanIterator.c89 segmentData *segments; /* pointer to array of path segments */ member in struct:__anon869
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);
1008 if (pd->segments !
[all...]
/openjdk9/hotspot/src/jdk.aot/share/classes/jdk.tools.jaotc.binformat/src/jdk/tools/jaotc/binformat/
H A DBinaryContainer.java278 codeSegmentsContainer = new ReadOnlyDataContainer(".code.segments", this);
782 // add empty segments if needed
792 byte[] segments = new byte[segmentsCount];
795 segments[i] = (byte) idx;
798 appendBytes(codeSegmentsContainer, segments, 0, segmentsCount);
/openjdk9/jdk/src/java.desktop/share/classes/com/sun/imageio/plugins/jpeg/
H A DJPEGImageWriter.java1423 List<SOSMarkerSegment> segments = new ArrayList<>();
1430 segments.add((SOSMarkerSegment) seg);
1435 if (!segments.isEmpty()) {
1436 numScans = segments.size();
1440 SOSMarkerSegment sos = segments.get(i);
1465 * Finds all DQT marker segments and returns all the q
1492 * Finds all DHT marker segments and returns all the q
/openjdk9/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/file/
H A DLocations.java1486 Collection<String> segments = new ArrayList<>();
1488 expandBraces(s, segments);
1495 for (String seg: segments) {
/openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/
H A DConcurrentHashMap.java602 * @serialField segments Segment[]
603 * The segments, each of which is a specialized hash table.
605 * Mask value for indexing into segments. The upper bits of a
608 * Shift value for indexing within segments.
611 new ObjectStreamField("segments", Segment[].class),
1419 Segment<K,V>[] segments = (Segment<K,V>[])
1421 for (int i = 0; i < segments.length; ++i)
1422 segments[i] = new Segment<K,V>(LOAD_FACTOR);
1424 streamFields.put("segments", segments);
[all...]
/openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java501 public SortedSet<Segment> segments = new TreeSet<>(segmentComparator); field in class:HierarchicalLayoutManager.Region

Completed in 117 milliseconds