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:
JRE 8 rt.jar - javax.* Package Source Code
JRE 8 rt.jar is the JAR file for JRE 8 RT (Runtime) libraries.
JRE (Java Runtime) 8 is the runtime environment included in JDK 8.
JRE 8 rt.jar libraries are divided into 6 packages:
com.* - Internal Oracle and Sun Microsystems libraries java.* - Standard Java API libraries. javax.* - Extended Java API libraries. jdk.* - JDK supporting libraries. org.* - Third party libraries. sun.* - Old libraries developed by Sun Microsystems.
JAR File Information:
Directory of C:\fyicenter\jdk-1.8.0_191\jre\lib 63,596,151 rt.jar
Here is the list of Java classes of the javax.* package in JRE 1.8.0_191 rt.jar. Java source codes are also provided.
✍: FYIcenter
⏎ javax/imageio/spi/DigraphNode.java
/* * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * * * * * * */ package javax.imageio.spi; import java.io.Serializable; import java.util.HashSet; import java.util.Iterator; import java.util.Set; /** * A node in a directed graph. In addition to an arbitrary * <code>Object</code> containing user data associated with the node, * each node maintains a <code>Set</code>s of nodes which are pointed * to by the current node (available from <code>getOutNodes</code>). * The in-degree of the node (that is, number of nodes that point to * the current node) may be queried. * */ class DigraphNode implements Cloneable, Serializable { /** The data associated with this node. */ protected Object data; /** * A <code>Set</code> of neighboring nodes pointed to by this * node. */ protected Set outNodes = new HashSet(); /** The in-degree of the node. */ protected int inDegree = 0; /** * A <code>Set</code> of neighboring nodes that point to this * node. */ private Set inNodes = new HashSet(); public DigraphNode(Object data) { this.data = data; } /** Returns the <code>Object</code> referenced by this node. */ public Object getData() { return data; } /** * Returns an <code>Iterator</code> containing the nodes pointed * to by this node. */ public Iterator getOutNodes() { return outNodes.iterator(); } /** * Adds a directed edge to the graph. The outNodes list of this * node is updated and the in-degree of the other node is incremented. * * @param node a <code>DigraphNode</code>. * * @return <code>true</code> if the node was not previously the * target of an edge. */ public boolean addEdge(DigraphNode node) { if (outNodes.contains(node)) { return false; } outNodes.add(node); node.inNodes.add(this); node.incrementInDegree(); return true; } /** * Returns <code>true</code> if an edge exists between this node * and the given node. * * @param node a <code>DigraphNode</code>. * * @return <code>true</code> if the node is the target of an edge. */ public boolean hasEdge(DigraphNode node) { return outNodes.contains(node); } /** * Removes a directed edge from the graph. The outNodes list of this * node is updated and the in-degree of the other node is decremented. * * @return <code>true</code> if the node was previously the target * of an edge. */ public boolean removeEdge(DigraphNode node) { if (!outNodes.contains(node)) { return false; } outNodes.remove(node); node.inNodes.remove(this); node.decrementInDegree(); return true; } /** * Removes this node from the graph, updating neighboring nodes * appropriately. */ public void dispose() { Object[] inNodesArray = inNodes.toArray(); for(int i=0; i<inNodesArray.length; i++) { DigraphNode node = (DigraphNode) inNodesArray[i]; node.removeEdge(this); } Object[] outNodesArray = outNodes.toArray(); for(int i=0; i<outNodesArray.length; i++) { DigraphNode node = (DigraphNode) outNodesArray[i]; removeEdge(node); } } /** Returns the in-degree of this node. */ public int getInDegree() { return inDegree; } /** Increments the in-degree of this node. */ private void incrementInDegree() { ++inDegree; } /** Decrements the in-degree of this node. */ private void decrementInDegree() { --inDegree; } }
⏎ javax/imageio/spi/DigraphNode.java
Or download all of them as a single archive file:
File name: jre-rt-javax-1.8.0_191-src.zip File size: 5381005 bytes Release date: 2018-10-28 Download
⇒ JRE 8 rt.jar - org.* Package Source Code
2024-07-16, 284278👍, 7💬
Popular Posts:
How to download and install JDK (Java Development Kit) 7? If you want to write Java applications, yo...
JDK 7 tools.jar is the JAR file for JDK 7 tools. It contains Java classes to support different JDK t...
Jackson is "the Java JSON library" or "the best JSON parser for Java". Or simply as "JSON for Java"....
What Is jaxb-api-2.1.6.jar? Java Architecture for XML Binding (JAXB) is a Java API that allows Java ...
JDK 17 jdk.compiler.jmod is the JMOD file for JDK 17 Compiler tool, which can be invoked by the "jav...