2015-03-05 16:19:20 +00:00
/ *
2015-03-06 16:10:34 +00:00
Copyright ( c ) 2015 , Emir Pasic
All rights reserved .
2015-03-05 16:19:20 +00:00
2015-03-06 16:10:34 +00:00
Redistribution and use in source and binary forms , with or without
modification , are permitted provided that the following conditions are met :
2015-03-05 16:19:20 +00:00
2015-03-06 16:10:34 +00:00
* Redistributions of source code must retain the above copyright notice , this
list of conditions and the following disclaimer .
2015-03-05 16:19:20 +00:00
2015-03-06 16:10:34 +00:00
* Redistributions in binary form must reproduce the above copyright notice ,
this list of conditions and the following disclaimer in the documentation
and / or other materials provided with the distribution .
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES , INCLUDING , BUT NOT LIMITED TO , THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED . IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT , INDIRECT , INCIDENTAL , SPECIAL , EXEMPLARY , OR CONSEQUENTIAL
DAMAGES ( INCLUDING , BUT NOT LIMITED TO , PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES ; LOSS OF USE , DATA , OR PROFITS ; OR BUSINESS INTERRUPTION ) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY , WHETHER IN CONTRACT , STRICT LIABILITY ,
OR TORT ( INCLUDING NEGLIGENCE OR OTHERWISE ) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE , EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE .
2015-03-05 16:19:20 +00:00
* /
2016-06-25 16:17:48 +00:00
// Package stacks provides an abstract Stack interface.
2016-06-25 15:02:21 +00:00
//
// In computer science, a stack is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed. The order in which elements come off a stack gives rise to its alternative name, LIFO (for last in, first out). Additionally, a peek operation may give access to the top without modifying the stack.
//
// Reference: https://en.wikipedia.org/wiki/Stack_%28abstract_data_type%29
2015-03-05 16:19:20 +00:00
package stacks
2015-03-07 18:23:43 +00:00
import "github.com/emirpasic/gods/containers"
2016-06-24 19:52:16 +00:00
// Stack interface that all stacks implement
2016-06-22 01:09:48 +00:00
type Stack interface {
2015-03-05 16:19:20 +00:00
Push ( value interface { } )
Pop ( ) ( value interface { } , ok bool )
Peek ( ) ( value interface { } , ok bool )
2015-03-07 18:23:43 +00:00
2016-06-22 01:09:48 +00:00
containers . Container
2015-03-07 18:23:43 +00:00
// Empty() bool
// Size() int
// Clear()
// Values() []interface{}
2015-03-05 16:19:20 +00:00
}