Categories:
Audio (13)
Biotech (29)
Bytecode (36)
Database (77)
Framework (7)
Game (7)
General (507)
Graphics (53)
I/O (35)
IDE (2)
JAR Tools (101)
JavaBeans (21)
JDBC (121)
JDK (426)
JSP (20)
Logging (108)
Mail (58)
Messaging (8)
Network (84)
PDF (97)
Report (7)
Scripting (84)
Security (32)
Server (121)
Servlet (26)
SOAP (24)
Testing (54)
Web (15)
XML (309)
Collections:
Other Resources:
JDK 11 jdk.scripting.nashorn.jmod - Scripting Nashorn Module
JDK 11 jdk.scripting.nashorn.jmod is the JMOD file for JDK 11 Scripting Nashorn module.
JDK 11 Scripting Nashorn module compiled class files are stored in \fyicenter\jdk-11.0.1\jmods\jdk.scripting.nashorn.jmod.
JDK 11 Scripting Nashorn module compiled class files are also linked and stored in the \fyicenter\jdk-11.0.1\lib\modules JImage file.
JDK 11 Scripting Nashorn module source code files are stored in \fyicenter\jdk-11.0.1\lib\src.zip\jdk.scripting.nashorn.
You can click and view the content of each source code file in the list below.
✍: FYIcenter
⏎ jdk/nashorn/internal/runtime/BitVector.java
/* * Copyright (c) 2010, 2013, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * * * * * * */ package jdk.nashorn.internal.runtime; import java.util.Arrays; /** * Faster implementation of BitSet */ public final class BitVector implements Cloneable { /** Number of bits per slot. */ private static final int BITSPERSLOT = 64; /** Growth quanta when resizing. */ private static final int SLOTSQUANTA = 4; /** Shift for indexing. */ private static final int BITSHIFT = 6; /** Mask for indexing. */ private static final int BITMASK = BITSPERSLOT - 1; /** Bit area. */ private long[] bits; /** * Constructor. */ public BitVector() { this.bits = new long[SLOTSQUANTA]; } /** * Constructor * @param length initial length in bits */ public BitVector(final long length) { final int need = (int)growthNeeded(length); this.bits = new long[need]; } /** * Copy constructor * @param bits a bits array from another bit vector */ public BitVector(final long[] bits) { this.bits = bits.clone(); } /** * Copy another BitVector into this one * @param other the source */ public void copy(final BitVector other) { bits = other.bits.clone(); } /** * Calculate the number of slots need for the specified length of bits. * @param length Number of bits required. * @return Number of slots needed. */ private static long slotsNeeded(final long length) { return (length + BITMASK) >> BITSHIFT; } /** * Calculate the number of slots need for the specified length of bits * rounded to allocation quanta. * @param length Number of bits required. * @return Number of slots needed rounded to allocation quanta. */ private static long growthNeeded(final long length) { return (slotsNeeded(length) + SLOTSQUANTA - 1) / SLOTSQUANTA * SLOTSQUANTA; } /** * Return a slot from bits, zero if slot is beyond length. * @param index Slot index. * @return Slot value. */ private long slot(final int index) { return 0 <= index && index < bits.length ? bits[index] : 0L; } /** * Resize the bit vector to accommodate the new length. * @param length Number of bits required. */ public void resize(final long length) { final int need = (int)growthNeeded(length); if (bits.length != need) { bits = Arrays.copyOf(bits, need); } final int shift = (int)(length & BITMASK); int slot = (int)(length >> BITSHIFT); if (shift != 0) { bits[slot] &= (1L << shift) - 1; slot++; } for ( ; slot < bits.length; slot++) { bits[slot] = 0; } } /** * Set a bit in the bit vector. * @param bit Bit number. */ public void set(final long bit) { bits[(int)(bit >> BITSHIFT)] |= (1L << (int)(bit & BITMASK)); } /** * Clear a bit in the bit vector. * @param bit Bit number. */ public void clear(final long bit) { bits[(int)(bit >> BITSHIFT)] &= ~(1L << (int)(bit & BITMASK)); } /** * Toggle a bit in the bit vector. * @param bit Bit number. */ public void toggle(final long bit) { bits[(int)(bit >> BITSHIFT)] ^= (1L << (int)(bit & BITMASK)); } /** * Sets all bits in the vector up to the length. * * @param length max bit where to stop setting bits */ public void setTo(final long length) { if (0 < length) { final int lastWord = (int)(length >> BITSHIFT); final long lastBits = (1L << (int)(length & BITMASK)) - 1L; Arrays.fill(bits, 0, lastWord, ~0L); if (lastBits != 0L) { bits[lastWord] |= lastBits; } } } /** * Clears all bits in the vector. */ public void clearAll() { Arrays.fill(bits, 0L); } /** * Test if bit is set in the bit vector. * @param bit Bit number. * @return true if bit in question is set */ public boolean isSet(final long bit) { return (bits[(int)(bit >> BITSHIFT)] & (1L << (int)(bit & BITMASK))) != 0; } /** * Test if a bit is clear in the bit vector. * @param bit Bit number. * @return true if bit in question is clear */ public boolean isClear(final long bit) { return (bits[(int)(bit >> BITSHIFT)] & (1L << (int)(bit & BITMASK))) == 0; } /** * Shift bits to the left by shift. * @param shift Amount of shift. * @param length Length of vector after shift. */ public void shiftLeft(final long shift, final long length) { if (shift != 0) { final int leftShift = (int)(shift & BITMASK); final int rightShift = BITSPERSLOT - leftShift; final int slotShift = (int)(shift >> BITSHIFT); final int slotCount = bits.length - slotShift; int slot, from; if (leftShift == 0) { for (slot = 0, from = slotShift; slot < slotCount; slot++, from++) { bits[slot] = slot(from); } } else { for (slot = 0, from = slotShift; slot < slotCount; slot++) { bits[slot] = (slot(from) >>> leftShift) | (slot(++from) << rightShift); } } } resize(length); } /** * Shift bits to the right by shift. * @param shift Amount of shift. * @param length Length of vector after shift. */ public void shiftRight(final long shift, final long length) { // Make room. resize(length); if (shift != 0) { final int rightShift = (int)(shift & BITMASK); final int leftShift = BITSPERSLOT - rightShift; final int slotShift = (int)(shift >> BITSHIFT); int slot, from; if (leftShift == 0) { for (slot = bits.length, from = slot - slotShift; slot >= slotShift;) { slot--; from--; bits[slot] = slot(from); } } else { for (slot = bits.length, from = slot - slotShift; slot > 0;) { slot--; from--; bits[slot] = (slot(from - 1) >>> leftShift) | (slot(from) << rightShift); } } } // Mask out surplus. resize(length); } /** * Set a bit range. * @param fromIndex from index (inclusive) * @param toIndex to index (exclusive) */ public void setRange(final long fromIndex, final long toIndex) { if (fromIndex < toIndex) { final int firstWord = (int)(fromIndex >> BITSHIFT); final int lastWord = (int)(toIndex - 1 >> BITSHIFT); final long firstBits = (~0L << fromIndex); final long lastBits = (~0L >>> -toIndex); if (firstWord == lastWord) { bits[firstWord] |= firstBits & lastBits; } else { bits[firstWord] |= firstBits; Arrays.fill(bits, firstWord + 1, lastWord, ~0L); bits[lastWord] |= lastBits; } } } }
⏎ jdk/nashorn/internal/runtime/BitVector.java
Or download all of them as a single archive file:
File name: jdk.scripting.nashorn-11.0.1-src.zip File size: 1390965 bytes Release date: 2018-11-04 Download
⇒ JDK 11 jdk.scripting.nashorn.shell.jmod - Scripting Nashorn Shell Module
2020-04-25, 107799👍, 0💬
Popular Posts:
What Is poi-5.2.3.jar? poi-5.2.3.jar is one of the JAR files for Apache POI 5.2.3, which provides an...
Jackson is "the Java JSON library" or "the best JSON parser for Java". Or simply as "JSON for Java"....
Java Cryptography Extension 1.6 JAR File Size and Download Location: File name: jce.jar, jce-1.6.jar...
ANTLR is a powerful parser generator for multiple programming languages including Java. ANTLR contai...
What Is commons-logging-1.2.jar? commons-logging-1.2.jar is the JAR file for Apache Commons Logging ...