Package | Description |
---|---|
java.nio.file |
Defines interfaces and classes for the Java virtual machine to access files,
file attributes, and file systems.
|
java.util |
Contains the collections framework, legacy collection classes, event model,
date and time facilities, random-number generator, and miscellaneous utility
classes.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DirectoryStream<T>
An object to iterate over the entries in a directory.
|
interface |
Path
An object that may be used to locate a file in a file system.
|
Modifier and Type | Method and Description |
---|---|
abstract Iterable<FileStore> |
FileSystem.getFileStores()
Returns an object to iterate over the underlying file stores.
|
abstract Iterable<Path> |
FileSystem.getRootDirectories()
Returns an object to iterate over the paths of the root directories.
|
Modifier and Type | Interface and Description |
---|---|
interface |
Collection<E>
The root interface in the collection hierarchy.
|
interface |
Deque<E>
A linear collection that supports element insertion and removal at
both ends.
|
interface |
List<E>
An ordered collection (also known as a sequence).
|
interface |
Queue<E>
A collection designed for holding elements prior to processing.
|
interface |
Set<E>
A collection that contains no duplicate elements.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractCollection<E>
This class provides a skeletal implementation of the Collection
interface, to minimize the effort required to implement this interface.
|
class |
AbstractList<E>
This class provides a skeletal implementation of the
List
interface to minimize the effort required to implement this interface
backed by a "random access" data store (such as an array). |
class |
AbstractQueue<E>
This class provides skeletal implementations of some
Queue
operations. |
class |
AbstractSequentialList<E>
This class provides a skeletal implementation of the List
interface to minimize the effort required to implement this interface
backed by a "sequential access" data store (such as a linked list).
|
class |
AbstractSet<E>
This class provides a skeletal implementation of the Set
interface to minimize the effort required to implement this
interface.
|
class |
ArrayDeque<E>
Resizable-array implementation of the
Deque interface. |
class |
ArrayList<E>
Resizable-array implementation of the List interface.
|
class |
HashSet<E>
This class implements the Set interface, backed by a hash table
(actually a HashMap instance).
|
class |
LinkedHashSet<E>
Hash table and linked list implementation of the Set interface,
with predictable iteration order.
|
class |
LinkedList<E>
Doubly-linked list implementation of the
List and Deque
interfaces. |
class |
ServiceLoader<S>
A simple service-provider loading facility.
|
class |
Stack<E>
The
Stack class represents a last-in-first-out
(LIFO) stack of objects. |
class |
Vector<E>
The
Vector class implements a growable array of
objects. |
Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved. Use of this specification is subject to license terms.