Categories:
Audio (13)
Biotech (29)
Bytecode (36)
Database (77)
Framework (7)
Game (7)
General (507)
Graphics (53)
I/O (35)
IDE (2)
JAR Tools (102)
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 (322)
Collections:
Other Resources:
JRE 8 rt.jar - com.* 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 com.* package in JRE 1.8.0_191 rt.jar. Java source codes are also provided.
✍: FYIcenter
⏎ com/sun/corba/se/impl/orbutil/graph/GraphImpl.java
/* * Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved. * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. * * * * * * * * * * * * * * * * * * * * */ package com.sun.corba.se.impl.orbutil.graph ; import java.util.Collection ; import java.util.AbstractSet ; import java.util.Iterator ; import java.util.Map ; import java.util.HashMap ; import java.util.Set ; import java.util.HashSet ; public class GraphImpl extends AbstractSet implements Graph { private Map /* Map<Node,NodeData> */ nodeToData ; public GraphImpl() { nodeToData = new HashMap() ; } public GraphImpl( Collection coll ) { this() ; addAll( coll ) ; } /***********************************************************************************/ /************ AbstractSet implementation *******************************************/ /***********************************************************************************/ // Required for AbstractSet public boolean add( Object obj ) // obj must be a Node { if (!(obj instanceof Node)) throw new IllegalArgumentException( "Graphs must contain only Node instances" ) ; Node node = (Node)obj ; boolean found = nodeToData.keySet().contains( obj ) ; if (!found) { NodeData nd = new NodeData() ; nodeToData.put( node, nd ) ; } return !found ; } // Required for AbstractSet public Iterator iterator() { return nodeToData.keySet().iterator() ; } // Required for AbstractSet public int size() { return nodeToData.keySet().size() ; } /***********************************************************************************/ public NodeData getNodeData( Node node ) { return (NodeData)nodeToData.get( node ) ; } private void clearNodeData() { // Clear every node Iterator iter = nodeToData.entrySet().iterator() ; while (iter.hasNext()) { Map.Entry entry = (Map.Entry)iter.next() ; NodeData nd = (NodeData)(entry.getValue()) ; nd.clear( ) ; } } interface NodeVisitor { void visit( Graph graph, Node node, NodeData nd ) ; } // This visits every node in the graph exactly once. A // visitor is allowed to modify the graph during the // traversal. void visitAll( NodeVisitor nv ) { boolean done = false ; // Repeat the traversal until every node has been visited. Since // it takes one pass to determine whether or not each node has // already been visited, this loop always runs at least once. do { done = true ; // Copy entries to array to avoid concurrent modification // problem with iterator if the visitor is updating the graph. Map.Entry[] entries = (Map.Entry[])nodeToData.entrySet().toArray( new Map.Entry[0] ) ; // Visit each node in the graph that has not already been visited. // If any node is visited in this pass, we must run at least one more // pass. for (int ctr=0; ctr<entries.length; ctr++) { Map.Entry current = entries[ctr] ; Node node = (Node)current.getKey() ; NodeData nd = (NodeData)current.getValue() ; if (!nd.isVisited()) { nd.visited() ; done = false ; nv.visit( this, node, nd ) ; } } } while (!done) ; } private void markNonRoots() { visitAll( new NodeVisitor() { public void visit( Graph graph, Node node, NodeData nd ) { Iterator iter = node.getChildren().iterator() ; // Iterator<Node> while (iter.hasNext()) { Node child = (Node)iter.next() ; // Make sure the child is in the graph so it can be // visited later if necessary. graph.add( child ) ; // Mark the child as a non-root, since a child is never a root. NodeData cnd = graph.getNodeData( child ) ; cnd.notRoot() ; } } } ) ; } private Set collectRootSet() { final Set result = new HashSet() ; Iterator iter = nodeToData.entrySet().iterator() ; while (iter.hasNext()) { Map.Entry entry = (Map.Entry)iter.next() ; Node node = (Node)entry.getKey() ; NodeData nd = (NodeData)entry.getValue() ; if (nd.isRoot()) result.add( node ) ; } return result ; } public Set /* Set<Node> */ getRoots() { clearNodeData() ; markNonRoots() ; return collectRootSet() ; } }
⏎ com/sun/corba/se/impl/orbutil/graph/GraphImpl.java
Or download all of them as a single archive file:
File name: jre-rt-com-1.8.0_191-src.zip File size: 8099783 bytes Release date: 2018-10-28 Download
⇒ Backup JDK 8 Installation Directory
2023-02-07, 374071👍, 3💬
Popular Posts:
Jettison is a collection of Java APIs (like STaX and DOM) which read and write JSON. This allows nea...
XOM™ is a new XML object model. It is an open source (LGPL), tree-based API for processing XML with ...
Apache Log4j IOStreams is a Log4j API extension that provides numerous classes from java.io that can...
Apache Avalon began in 1999 as the Java Apache Server Framework and in late 2002 separated from the ...
JDK 17 java.naming.jmod is the JMOD file for JDK 17 Naming module. JDK 17 Naming module compiled cla...