/ Published in: ActionScript 3
Expand |
Embed | Plain Text
Copy this code and paste it in your HTML
package { /** * QueueADT interface - Designed to give generic functionality to a queue collection type. * This collection is to be implemented in a FIFO principles. With adding, removing, searching, * trace output, and state functions of the collection. * @author : Richard Vacheresse /|\ http://www.rvacheresse.com /|\ * Licensed for free Commercial and Private use creative commons license agreement. * The provided code is in an "as-is" state. Richard Vacheresse makes no warranties * regarding the provided code, and disclaims liability for damages resulting from its use. * @version 1.0 **/ public interface QueueADT { /** * REMOVE THE FIRST OBJECT FROM THE QUEUE * @variable - Generic Object **/ function dequeue():Object; /** * ADD AN OBJECT TO THE END OF THE QUEUE * @variable - Generic Object **/ function enqueue(obj:Object):void; /** * RETURNS WITHOUT REMOVING THE OBJECT AT THE FRONT OF THE QUEUE * @return - Boolean Object **/ function first():Object; /** * RETURN TRUE IF THE NUMBER VALUE OF THE SIZE OF THE QUEUE * @return - Number Object **/ function size():int; /** * RETURN TRUE IF THE QUEUE OBJECT HAS ZERO OBJECTS * @return - Boolean Object **/ function isEmpty():Boolean; /** * RETURN A STRING REPRESENTATION OF THE CURRENT QUEUE OBJECT * @return - String Object **/ function toString():String; } }