All Classes and Interfaces
Class
Description
An
AbstractIntSet is a mutable, unbounded set of integers.An
AbstractIntSet is a mutable, unbounded set of integers.A partial implementation of a
Poly.A mutable directed graph implementation based on a
Map between nodes and their
outgoing sets.A partially mutable directed graph implementation based on an adjacency matrix.
A simple program that reads a list of words from standard input and prints all anagrams of size
at least 2.
An arc of a directed graph with nodes of type
T.A mutable directed graph implementation based on a list of
Arcs and one of
nodes.A class providing some utility methods for arrays.
An astronomical system.
Allows verification of the behavior of an astronomical system.
Allows verification of the behavior of an astronomical system.
A queue is a mutable data structure that provides access to its elements in
first-in/first-out order.
A queue is a mutable data structure that provides access to its elements in
first-in/first-out order.
A class to exercise a
BoundedIntQueue.A class to exercise a
BoundedIntQueue.Vedi testo,
A celestial body.
Esercizio 4.4 di PDJ.
A collection of
Consumers to be used in graph visits.A class representing decimal digits of a long.
A class representing decimal digits of a long, endowed with a non zero digits iterator, based on
an anonymous class.
A class representing decimal digits of a long, endowed with a non zero digits iterator, based on
the external
NonZeroDigitsGenerator class.A class representing decimal digits of a long, endowed with a non zero digits iterator, based on
the inner
NonZeroDigitsGeneratorIG classA class representing decimal digits of a long, endowed with a non zero digits iterator, based on
the nested static
NonZeroDigitsGeneratorNS class.A nested static class implementing the genrator.
A dense polynomial with integer coefficients.
An interface representing an directed graph where nodes are of generic type
T.Tests directed graph package generating a Dot file.
A collection of utilities related to
DiGraphs.Tests directed graph package with visits.
Thrown when an application attempts to use extract elements from an empty
IntSet.Esercizio 3.1 di PDJ.
Vedi testo,
Vedi testo,
ma leggendo dal flusso d'ingresso (invece che usando gli argomenti sulla linea di comando).
Primo esempio di astrazione per parametrizzazione.
Secondo esempio di astrazione per parametrizzazione.
Terzo esempio di astrazione per parametrizzazione.
Quarto esempio di astrazione per parametrizzazione.
A class to handle a list of rectangles and organize them as in histogram.
A class to handle a list of rectangles and organize them as in histogram.
A class to test
Histogram.A class to test
Histogram.An implicit, immutable directed graph implementation.
Generator (in Liskov parlance) of the ints contained in a
List.A mutable class representing a range of integers, with configurable initial from, to, and step
values.
A class to test int ranges.
A class to test
IntRanges.IntSets are mutable, unbounded sets of integers.IntSets are mutable, unbounded sets of integers.IntSets are mutable, unbounded sets of integers.IntSets are mutable, unbounded sets of integers.IntSets are mutable, unbounded sets of integers.A concrete set of integer.
A concrete set of integers.
A collection of methods for
IntSets.A class to test some methods of
IntSet.A class to test some methods of
IntSet.Classe per il test di
IntSet IntGenerator.A class to test
IntSet and OrderedIntSet.A class to test
IntSet and OrderedIntSet.Esercizio 3.3 di PDJ.
Utility methods for iterators.
Vedi testo,
An partial implementation of
AbstractIntSet based on List.A class providing some utility methods for lists.
A subtype of
ListUtils.PositiveIntBox that can be created from negative ints.A box containing a positive integer.
Example of
MaxIntSet taken from section 7.4 of the textbook by Liskov et al..Test class for
MaxIntSet.Vedi testo.
Thrown when an application attempts to use a negative exponent in a
Poly.A generator returning the non zero digits of a long from the least to the most significant one.
Ordered list of integers without duplicates.
A class to test ordered lists.
A class to test
OrderedIntList.A concrete sorted set of integers.
A concrete sorted set of integers.
A class representing an immutable pair of objects.
Soluzione dell'esercizio Palindroma(versione
con cicli).
A planet.
Immutable three-dimensional point with integer coordinates.
Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.Polys are immutable polynomials with integer coefficients.A non-null term of a polynomial.
A class to test some methods of
Poly.A class to test some methods of
Poly.A class to test some methods of
Poly.A class to test some methods of
Poly.A class to test some methods of
Poly.A collection of methods for
Polys.Classe che rappresenta un portafoglio azionario.
Rappresenta una azione di una società.
A class to test some methods of
PortafoglioAzionario.A set of integer that can be preallocated to a given capacity.
Iteratore che genera i numeri primi.
A collection of utilities related to
Queuess.Classe di utilità per il calcolo delle radici quadrate.
Classe di utilità per il calcolo delle radici quadrate.
Classe client per il calcolo delle radici quadrate.
Classe client per il calcolo delle radici quadrate.
A rational number is an immutable number that can be expressed as the quotient or fraction \( p/q
\) of two
ints, a numerator \( p \) and a non-zero denominator \( q \).A rational number is an immutable number that can be expressed as the quotient or fraction \( p/q
\) of two
ints, a numerator \( p \) and a non-zero denominator \( q \).A class to exercise a
RationalNumber.A class to exercise a
RationalNumber.A mutable class representing a rectangle with integer valued base and height.
A mutable class representing a rectangle with integer valued base and height.
Vedi testo, ma
senza il vincolo sul valore massimo per `N`.
La prima classe Java.
Esercizio 4.2 di PDJ.
Una classe che mostra alcune caratteristiche legate all'ereditarietà.
Vedi testo, ma
leggendo gli addendi dal flusso di ingresso.
SparsePolys are immutable polynomials with integer coefficients such that the number of
nonzero coefficient is small with respect to the degree.SparsePolys are immutable polynomials with integer coefficients such that the number of
nonzero coefficient is small with respect to the degree.SparsePolys are immutable polynomials with integer coefficients such that the number of
nonzero coefficient is small with respect to the degree.A sparse implementation of
Poly.SparsePolys are immutable polynomials with integer coefficients such that the number of
nonzero coefficient is small with respect to the degree.A record holding a non zero term of the polynomial.
A record holding a non-zero term of the polynomial.
A record holding a non-zero term of the polynomial.
A record holding a non-zero term of the polynomial.
A class to test some methods of
SparsePoly.A class to test some methods of
SparsePoly.A class to test some methods of
SparsePoly.A class to test some methods of
SparsePoly.A mutable class representing a square with integer valued base.
A mutable class representing a square with integer valued base.
A fixed star.
A class to collect a sequence of strings and format them.
Utility class with some string iterators.
Utility class with some string iterators.
A class to test
StringIterators.A class to test
StringIterators.A class to exercise some methods of
StringToIntMap.A class to exercise some methods of
StringToIntMap.Esercizio 3.2 di PDJ.
Esercizio 4.3 di PDJ.
Vedi testo.