All Packages Class Hierarchy Previous Next Index
Overview 1 - No description available.
Overview 2 - No description available.
Overview 3 - No description available.
Overview 4 - No description available.
Overview 5 - No description available.
Overview 6 - No description available.
Overview 7 - No description available.
Overview 8 - No description available.
Overview 9 - No description available.
Overview 10 - No description available.
Overview1 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview1
{
public static void main( String[] args )
{
HashMap chemicals = new HashMap();
chemicals.put( "Ca", "Calcium" );
chemicals.put( "Au", "Gold" );
chemicals.put( "He", "Helium" );
System.out.println( "chemicals = " + chemicals );
System.out.println( "Au means " + chemicals.get( "Au" ) );
}
}
chemicals = HashMap( Pair( Au, Gold ), Pair( He, Helium ), Pair( Ca, Calcium ) )
Au means Gold
Overview2 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview2
{
public static void main( String[] args )
{
HashSet set1 = new HashSet();
set1.add( "red" );
set1.add( "blue" );
set1.add( "green" );
HashSet set2 = new HashSet();
set2.add( "yellow" );
set2.add( "blue" );
HashSet set3 = set1.union( set2 );
HashSet set4 = set1.intersection( set2 );
System.out.println( "set1 = " + set1 );
System.out.println( "set2 = " + set2 );
System.out.println( "union of set1 and set2 = " + set3 );
System.out.println( "intersection of set1 and set2 = " + set4 );
}
}
set1 = HashSet( blue, green, red )
set2 = HashSet( blue, yellow )
union of set1 and set2 = HashSet( blue, green, red, yellow )
intersection of set1 and set2 = HashSet( blue )
Overview3 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
import java.util.Enumeration; // JDK enumeration class.
public class Overview3
{
public static void main( String[] args )
{
Array array = new Array(); // Growable array.
array.add( "nemesis" );
array.add( "dig" );
array.add( "myst" );
Enumeration iterator = array.elements();
while ( iterator.hasMoreElements() )
System.out.println( iterator.nextElement() );
System.out.println();
DList list = new DList(); // Doubly-linked list.
list.add( "agatha" );
list.add( "beauty" );
list.add( "truth" );
iterator = list.elements();
while ( iterator.hasMoreElements() )
System.out.println( iterator.nextElement() );
}
}
nemesis
dig
myst
agatha
beauty
truth
Overview4 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview4
{
public static void main( String[] args )
{
Array array = new Array();
array.add( new Integer( 3 ) );
array.add( new Integer( -1 ) );
array.add( new Integer( 2 ) );
System.out.println( "Unsorted Array = " + array );
Sorting.sort( array );
System.out.println( "Sorted = " + array );
}
}
Unsorted Array = Array( 3, -1, 2 )
Sorted = Array( -1, 2, 3 )
Overview5 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
import java.util.Vector;
public class Overview5
{
public static void main( String[] args )
{
Vector vector = new Vector(); // JDK Vector.
vector.addElement( new Integer( 3 ) );
vector.addElement( new Integer( -1 ) );
vector.addElement( new Integer( 2 ) );
System.out.println( "Unsorted java.util.Vector = " + vector );
// A VectorArray makes a JDK vector look like a JGL container.
VectorArray vectorArray = new VectorArray( vector );
Sorting.sort( vectorArray );
System.out.println( "Sorted = " + vector );
}
}
Unsorted java.util.Vector = [3, -1, 2]
Sorted = [-1, 2, 3]
Overview6 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview6
{
public static void main( String[] args )
{
int ints[] = { 3, -1, 2 };
IntArray intArray = new IntArray( ints );
System.out.println( "Unsorted native int array = " + intArray );
Sorting.sort( intArray );
System.out.print( "Sorted native array = " );
for ( int i = 0; i < ints.length; i++ )
System.out.print( ints[ i ] + " " );
System.out.println();
}
}
Unsorted native int array = int[]( 3, -1, 2 )
Sorted native array = -1 2 3
Overview7 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview7
{
public static void main( String[] args )
{
Deque deque = new Deque();
deque.add( "your" );
deque.add( "mission" );
deque.add( "jim" );
System.out.println( "Original deque = " + deque );
Shuffling.randomShuffle( deque );
System.out.println( "Shuffled deque = " + deque );
}
}
Original deque = Deque( your, mission, jim )
Shuffled deque = Deque( your, jim, mission )
Overview8 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview8
{
public static void main( String[] args )
{
Array array = new Array();
array.add( new Integer( 3 ) );
array.add( new Integer( -1 ) );
array.add( new Integer( 2 ) );
System.out.println( "Unsorted Array = " + array );
BinaryPredicate predicate = new GreaterNumber();
Sorting.sort( array, predicate ); // Sort in descending order.
System.out.println( "Sorted = " + array );
}
}
Unsorted Array = Array( 3, -1, 2 )
Sorted = Array( 3, 2, -1 )
Overview9 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview9
{
public static void main( String[] args )
{
Array array1 = new Array();
array1.add( new Integer( 3 ) );
array1.add( new Integer( -1 ) );
array1.add( new Integer( 2 ) );
UnaryPredicate predicate = new PositiveNumber();
int n = Counting.countIf( array1, predicate );
System.out.println( "# of positive numbers in " + array1 + " = " + n );
Array array2 = new Array();
Removing.removeCopyIf( array1, array2, predicate );
System.out.println( "Array without positive numbers = " + array2 );
}
}
# of positive numbers in Array( 3, -1, 2 ) = 2
Array without positive numbers = Array( -1 )
Overview10 Example Code
// Copyright(c) 1996,1997 ObjectSpace, Inc.
import COM.objectspace.jgl.*;
public class Overview10
{
public static void main( String[] args )
{
Array array = new Array();
array.add( "jolly" );
array.add( "good" );
array.add( "show" );
// Create a reverse iterator positioned at the end of the array.
ReverseIterator iterator = new ReverseIterator( array.end() );
while ( iterator.hasMoreElements() )
System.out.println( iterator.nextElement() );
}
}
show
good
jolly
All Packages Class Hierarchy Previous Next Index