|
APCS Java Subset | |||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
ap
containing
AP interfaces and classes (those not part of the Java
distribution).
See:
Description
Interface Summary | |
PriorityQueue | The interface for priority queues as they will be used on the Advanced Placement Computer Science exam. |
Queue | The interface for queues as they will be used on the Advanced Placement Computer Science exam. |
Stack | The interface for stacks as they will be used on the Advanced Placement Computer Science exam. |
Class Summary | |
ArrayPriorityQueue | A simple yet completely functional implementation
of the PriorityQueue interface. |
ArrayStack | A simple yet completely functional implementation
of the Stack interface. |
HeapPriorityQueue | This class implements the PriorityQueue interface using a binary heap. |
ListNode | The class for linked list nodes that will be used and tested on the Advanced Placement Computer Science exam. |
ListQueue | A simple yet completely functional implementation
of the Queue interface. |
TreeNode | The class for nodes in a binary tree that will be used and tested on the Advanced Placement Computer Science exam. |
This is the annotated AP Computer Science Java Subset;
and this is the top-level package ap
containing
AP interfaces and classes (those not part of the Java
distribution).
Note that the official AP Java subset is not in a package
ap
, but this documentation shows it in a package
ap
to make it clear that these classes
and interfaces are part of the AP Computer Science
Java subset and not part of standard Java.
Interfaces and classes
that are in the package ap
, and not in a sub-package,
are only used in the AB course.
|
unofficial documentation for the APCS Java Subset | |||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |