Bookmark and Share

Front Back
absolute pathname
A full path to a file beginning from the name of the storage device.
An indexable
array initialiser
An expression that can be used to initialise an array using assignment
This is the automatic process of wrapping primitive values when called for by the context of usage in a Java program.
This is the automatic process of unwrapping primitive values when called for by the context of usage in a Java program.
A data structure that can contain zero or more unsorted elements. A HashSet uses buckets to implement a set. The hash code of each incoming element is used to decide which bucket to store it in.
Could refer to either an area used for temporary storage as data is transferred between a data source and a data sink
bulk operations
Operations that act on an entire collection without requiring the programmer to focus on individual elements.
The number of characters a StringBuilder object can hold.
A collection consists of a number of
Collection Classes/collection classes
A set of library classes used to create various kinds of collection such as tree structures and queues. When capitalised
Collections Framework
The Collections Framework includes a set of collection interfaces (Collection
comma-delimited file
A file whose items of data (tokens) are separated by commas.
An interface that allows an element type to be sorted. It contains a single method: compareTo().
The sole method of the Comparable interface. Allows classes of objects implementing this interface to be sorted (i.e. gives them a natural ordering).
component (of an array)
The memory location at which an element (or a reference to it) of an array is stored.
component type
The type of the components of an array object this determines the types of the object or primitive value that can be stored in the array.
destructive operation
An operation on a collection that changes the contents in some way is said to be destructive. It is not always obvious whether a method is destructive or non-destructive. A bulk operation may leave a collection unaffected but return an altered copy
diamond operator
From Java 7 onwards the diamond operator
For sets
effective length
The number of meaningful elements that a fixed-size collection actually holds.
The name given to the primitive value stored in
An entry in a map means a key–value pair that is
A method that determines whether two objects are equal or not. Since it is implemented by the class Object
An instance of this class contains the pathname to a file or folder in a systemindependent format. The file specified need not exist instead the pathname may point to a potential new file or folder.
Java keyword that introduces a block of code in a try-catch statement that will always be executed
fixed-size collection
A collection whose number of elements is fixed on creation. Such a collection can neither grow nor shrink.
The process of emptying a buffer so that no data remains in it
for-each statement
A statement that enables iteration through every element of a collection.
A programming language feature that allows the writing of code that supports many types
hash code
In Java
homogeneous collection
A collection in which all the elements are of the same type. All collections in Java are homogeneous.
Identity refers to an object rather than its state. Two reference variables have the same identity if they both reference the same object that is
An object whose state cannot be changed. An object whose state can be changed is said to be mutable.
implementation class
A class that implements an interface
implementing class
In the context of collections
An integer that is used to access the elements of an indexable collection.
indexable collection
A collection in which every element is accessed by an index.
The base class of a hierarchy of classes including FileInputStream
Intersection is a mathematical operation on two or more sets that results in a set containing only the elements common to both sets. The term is used to refer both to the result and to the operation.
A Java utility class that contains static methods for manipulating arrays.
A key is a value that can be used to uniquely identify any object from a given map-based collection. What constitutes a good key may depend on the purpose of the collection.
key set
The set of all the key values for all the entries in some map. A key set is typically used to iterate over a map-based collection.
key–value pair
Maps can be viewed as a set of key–value pairs. Each entry in a map is a key–value pair. For example
The number of elements an array can hold.
An ordered collection of variable size that permits duplicate elements.
A collection type that relates a set of keys to their corresponding values.
Another name for a key–value pair.
natural ordering
In Java
non-destructive operation
An operation on a collection that does not change the contents in any way.
x of y cards Next >|