/openjdk10/corba/make/src/classes/build/tools/logutil/ |
H A D | InputException.java | 38 * The codes associated with this exception. 40 private final Queue<InputCode> codes; field in class:InputException 50 codes = new LinkedList<InputCode>(); 60 codes.offer(c); 73 * Returns the codes associated with this exception. 75 * @return the exception's codes. 78 return codes; 89 + ",codes=" + codes
|
/openjdk10/jdk/src/java.base/share/native/libzip/zlib/ |
H A D | inftrees.h | 63 1444, which is the sum of 852 for literal/length codes and 592 for distance 64 codes. These values were found by exhaustive searches using the program 67 maximum bit length of a code. "enough 286 9 15" for literal/length codes 68 returns returns 852, and "enough 30 6 15" for distance codes returns 592. 85 unsigned codes, code FAR * FAR *table,
|
H A D | inftrees.c | 46 The code lengths are lens[0..codes-1]. The result starts at *table, 56 int ZLIB_INTERNAL inflate_table(type, lens, codes, table, bits, work) 59 unsigned codes; 70 int left; /* number of prefix codes available */ 82 unsigned short count[MAXBITS+1]; /* number of codes of each length */ 84 static const unsigned short lbase[31] = { /* Length codes 257..285 base */ 87 static const unsigned short lext[31] = { /* Length codes 257..285 extra */ 90 static const unsigned short dbase[32] = { /* Distance codes 0..29 base */ 94 static const unsigned short dext[32] = { /* Distance codes 0..29 extra */ 101 code lengths are lens[0..codes [all...] |
H A D | inflate.h | 96 Read deflate codes in fixed or dynamic block: 133 code const FAR *lencode; /* starting table for length/literal codes */ 134 code const FAR *distcode; /* starting table for distance codes */ 142 code FAR *next; /* next available space in codes[] */ 145 code codes[ENOUGH]; /* space for code tables */ member in struct:inflate_state
|
H A D | inflate.c | 161 state->lencode = state->distcode = state->next = state->codes; 372 puts(" /* inffixed.h -- table for decoding fixed codes"); 600 if there is no input available. The decoding of variable length codes uses 892 Tracev((stderr, "inflate: fixed codes block%s\n", 894 state->mode = LEN_; /* decode codes */ 901 Tracev((stderr, "inflate: dynamic codes block%s\n", 970 state->next = state->codes; 1044 state->next = state->codes; 1063 Tracev((stderr, "inflate: codes ok\n")); 1517 if (state->lencode >= state->codes [all...] |
H A D | infback.c | 334 Tracev((stderr, "inflate: fixed codes block%s\n", 336 state->mode = LEN; /* decode codes */ 339 Tracev((stderr, "inflate: dynamic codes block%s\n", 409 state->next = state->codes; 483 state->next = state->codes; 502 Tracev((stderr, "inflate: codes ok\n"));
|
/openjdk10/jdk/src/java.desktop/share/classes/com/sun/imageio/plugins/jpeg/ |
H A D | JPEGImageMetadataFormat.java | 128 List<String> codes = new ArrayList<>(); 129 codes.add("16"); // Hex 10 130 codes.add("17"); // Hex 11 131 codes.add("19"); // Hex 13 137 codes);
|
/openjdk10/jdk/test/java/util/Currency/ |
H A D | ValidateISO4217.java | 71 static byte[] codes = new byte[ALPHA_NUM * ALPHA_NUM]; field in class:ValidateISO4217 178 codes[index] = SKIPPED; 204 if (codes[index] != UNDEFINED) { 209 codes[index] = DEFINED; 249 if (codes[toIndex(country)] == UNDEFINED) { 262 } else if (codes[toIndex(country)] == SKIPPED) {
|
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/runtime/regexp/joni/ |
H A D | EncodingHelper.java | 106 char[] codes = EMPTYCHARS; 117 codes = count == 0 ? new char[1] : Arrays.copyOf(codes, count + 1); 118 codes[count++] = ch; 122 return codes; 176 sbOut.value = 0x100; // use bitset for codes smaller than 256
|
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/doclint/ |
H A D | Entity.java | 315 // allow numeric codes for standard ANSI characters 316 return codes.containsKey(code) || ( 32 <= code && code < 2127); 320 private static final Map<Integer,Entity> codes = new HashMap<>(); field in class:Entity 327 codes.put(code, e);
|
/openjdk10/jdk/test/java/awt/FontClass/SurrogateTest/ |
H A D | SuppCharTest.java | 70 int[] codes = gv.getGlyphCodes(0, numGlyphs, null); 73 if (codes[i] == 65535) {
|
/openjdk10/langtools/test/tools/javac/resolve/ |
H A D | ResolveHarness.java | 207 List<String> codes; field in class:ResolveHarness.DiagnosticProcessor 210 public DiagnosticProcessor(Kind kind, String... codes) { argument 211 this.codes = Arrays.asList(codes); 218 return (codes.isEmpty() || codes.contains(diagnostic.getCode())) &&
|
/openjdk10/langtools/test/tools/javac/lambda/bridge/ |
H A D | TestMetafactoryBridges.java | 321 List<String> codes; field in class:TestMetafactoryBridges.DiagnosticChecker.DiagnosticProcessor 324 public DiagnosticProcessor(Kind kind, String... codes) { argument 325 this.codes = Arrays.asList(codes); 332 return (codes.isEmpty() || codes.contains(diagnostic.getCode())) &&
|
/openjdk10/jdk/test/java/net/httpclient/websocket/jdk.incubator.httpclient/jdk/incubator/http/internal/websocket/ |
H A D | CloseTest.java | 183 List<Integer> codes = asList( 213 return cartesianIterator(of(codes, reasons), args -> args);
|
/openjdk10/jdk/test/java/awt/FontClass/ |
H A D | HelvLtOblTest.java | 50 static int[] codes = { 0x23, 0x4a, 0x48, 0x3, 0x4a, 0x55, 0x42, 0x4d, field in class:HelvLtOblTest 93 GlyphVector gv = f.createGlyphVector(frc, codes); 126 GlyphVector gv = f.createGlyphVector(frc, codes);
|
/openjdk10/langtools/test/tools/javac/parser/ |
H A D | JavacParserTest.java | 525 List<String> codes = new LinkedList<String>(); 528 codes.add(d.getCode()); 533 codes); 549 List<String> codes = new LinkedList<String>(); 552 codes.add(d.getCode()); 556 Arrays.<String>asList("compiler.err.class.not.allowed"), codes); 572 List<String> codes = new LinkedList<String>(); 575 codes.add(d.getCode()); 579 Arrays.<String>asList("compiler.err.class.not.allowed"), codes); 595 List<String> codes [all...] |
/openjdk10/langtools/test/jdk/jshell/ |
H A D | ToolBasicTest.java | 196 String[] codes = new String[] { 204 for (String s : codes) { 208 for (int i = 0; i < codes.length; ++i) { 212 assertEquals(ss[0], codes[finalI]); 218 for (int i = 0; i < codes.length; ++i) { 222 assertEquals(ss[0], codes[codes.length - finalI - 1]);
|
/openjdk10/jdk/src/java.desktop/macosx/classes/sun/font/ |
H A D | CStrike.java | 231 int[] codes = new int[1]; 232 codes[0] = glyphCode; 234 getGlyphImagePtrs(codes, ptrs, 1); 267 // all distinct glyph codes requested (partially filled) 272 // scan, mark, and store the requested glyph codes again to 352 // This class stores glyph pointers, and is indexed based on glyph codes,
|
/openjdk10/jdk/src/jdk.incubator.httpclient/share/classes/jdk/incubator/http/internal/hpack/ |
H A D | Huffman.java | 210 private final Code[] codes = new Code[257]; field in class:Huffman 528 codes[c] = new Code(code, bitLength); 533 codes[c] = new Code(code, bitLength); 556 return codes[c];
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
H A D | FrameState.java | 424 byte[] codes = code.getCode(); 425 if (codes == null) { 429 byte newCode = codes[newBci]; 433 byte oldCode = codes[oldBci];
|
/openjdk10/jdk/src/java.base/share/classes/com/sun/java/util/jar/pack/ |
H A D | PackageReader.java | 1348 List<Code> codes = new ArrayList<>(methods.size()); 1352 codes.add(m.code); 1355 Code[] a = new Code[codes.size()]; 1356 codes.toArray(a); 1451 // For now, just record the raw BCI codes. 1479 // classes, fields, methods, and codes. 1944 // Ditto for exception handlers in codes.
|
/openjdk10/langtools/src/jdk.javadoc/share/classes/jdk/javadoc/internal/doclets/formats/html/resources/jquery/jszip/dist/ |
H A D | jszip.js | 1838 // skip 5 & 6 byte codes 1931 * Convert a string to a "binary string" : a string containing only char codes between 0 and 255. 3767 // skip 5 & 6 byte codes 3866 /* Return codes for the compression/decompression functions. Negative values 3967 /* Return codes for the compression/decompression functions. Negative values 4015 /* number of length codes, not counting the special END_BLOCK code */ 4019 /* number of Literal or Length codes, including the END_BLOCK code */ 4021 /* number of distance codes */ 4023 /* number of codes used to transfer the bit lengths */ 4027 /* All codes mus [all...] |