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 java.desktop.jmod - Desktop Module
JDK 11 java.desktop.jmod is the JMOD file for JDK 11 Desktop module.
JDK 11 Desktop module compiled class files are stored in \fyicenter\jdk-11.0.1\jmods\java.desktop.jmod.
JDK 11 Desktop module compiled class files are also linked and stored in the \fyicenter\jdk-11.0.1\lib\modules JImage file.
JDK 11 Desktop module source code files are stored in \fyicenter\jdk-11.0.1\lib\src.zip\java.desktop.
You can click and view the content of each source code file in the list below.
✍: FYIcenter
⏎ javax/imageio/spi/DigraphNode.java
/* * Copyright (c) 2000, 2014, 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} containing user data associated with the node, * each node maintains a {@code Set}s of nodes which are pointed * to by the current node (available from {@code getOutNodes}). * The in-degree of the node (that is, number of nodes that point to * the current node) may be queried. * */ class DigraphNode<E> implements Cloneable, Serializable { private static final long serialVersionUID = 5308261378582246841L; /** The data associated with this node. */ protected E data; /** * A {@code Set} of neighboring nodes pointed to by this * node. */ protected Set<DigraphNode<E>> outNodes = new HashSet<>(); /** The in-degree of the node. */ protected int inDegree = 0; /** * A {@code Set} of neighboring nodes that point to this * node. */ private Set<DigraphNode<E>> inNodes = new HashSet<>(); public DigraphNode(E data) { this.data = data; } /** Returns the {@code Object} referenced by this node. */ public E getData() { return data; } /** * Returns an {@code Iterator} containing the nodes pointed * to by this node. */ public Iterator<DigraphNode<E>> 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}. * * @return {@code true} if the node was not previously the * target of an edge. */ public boolean addEdge(DigraphNode<E> node) { if (outNodes.contains(node)) { return false; } outNodes.add(node); node.inNodes.add(this); node.incrementInDegree(); return true; } /** * Returns {@code true} if an edge exists between this node * and the given node. * * @param node a {@code DigraphNode}. * * @return {@code true} if the node is the target of an edge. */ public boolean hasEdge(DigraphNode<E> 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} if the node was previously the target * of an edge. */ public boolean removeEdge(DigraphNode<E> 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++) { @SuppressWarnings("unchecked") DigraphNode<E> node = (DigraphNode<E>)inNodesArray[i]; node.removeEdge(this); } Object[] outNodesArray = outNodes.toArray(); for(int i=0; i<outNodesArray.length; i++) { @SuppressWarnings("unchecked") DigraphNode<E> node = (DigraphNode<E>)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: java.desktop-11.0.1-src.zip File size: 7974380 bytes Release date: 2018-11-04 Download
⇒ JDK 11 java.instrument.jmod - Instrument Module
2022-08-06, 194541👍, 5💬
Popular Posts:
What Is jniwrap.jar in JNIWrapper 3.7.1? winpack.jar in JNIWrapper 3.7.1 is an add-on JAR file for J...
Commons Pool provides an Object-pooling API, with three major aspects: 1. A generic object pool inte...
iText is an ideal library for developers looking to enhance web- and other applications with dynamic...
How to download and install xml-commons External Source Package? The source package contains Java so...
The Bouncy Castle Crypto package is a Java implementation of cryptographic algorithms, it was develo...