How to stack in java

Class Stack

The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty , and a method to search the stack for an item and discover how far it is from the top.

When a stack is first created, it contains no items.

A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class. For example:

 Deque stack = new ArrayDeque();
Содержание
  1. Field Summary
  2. Fields declared in class java.util.Vector
  3. Fields declared in class java.util.AbstractList
  4. Constructor Summary
  5. Method Summary
  6. Methods declared in class java.util.Vector
  7. Methods declared in class java.lang.Object
  8. Methods declared in interface java.util.Collection
  9. Methods declared in interface java.util.List
  10. Constructor Details
  11. Stack
  12. Method Details
  13. push
  14. pop
  15. peek
  16. empty
  17. search
  18. Field Summary
  19. Fields declared in class java.util.Vector
  20. Fields declared in class java.util.AbstractList
  21. Constructor Summary
  22. Method Summary
  23. Methods declared in class java.util.Vector
  24. Methods declared in class java.lang.Object
  25. Methods declared in interface java.util.Collection
  26. Methods declared in interface java.util.List
  27. Constructor Details
  28. Stack
  29. Method Details
  30. push
  31. pop
  32. peek
  33. empty
  34. search
  35. How to stack in java
  36. Field Summary
  37. Fields declared in class java.util.Vector
  38. Fields declared in class java.util.AbstractList
  39. Constructor Summary
  40. Method Summary
  41. Methods declared in class java.util.Vector
  42. Methods declared in class java.lang.Object
  43. Methods declared in interface java.util.Collection
  44. Methods declared in interface java.util.List
  45. Constructor Detail
  46. Stack
  47. Method Detail
  48. push
  49. pop
  50. peek
  51. empty
  52. search
Читайте также:  Map algorithm in java

Field Summary

Fields declared in class java.util.Vector

Fields declared in class java.util.AbstractList

Constructor Summary

Method Summary

Methods declared in class java.util.Vector

Methods declared in class java.lang.Object

Methods declared in interface java.util.Collection

Methods declared in interface java.util.List

Constructor Details

Stack

Method Details

push

pop

peek

empty

Returns the 1-based position where an object is on this stack. If the object o occurs as an item in this stack, this method returns the distance from the top of the stack of the occurrence nearest the top of the stack; the topmost item on the stack is considered to be at distance 1 . The equals method is used to compare o to the items in this stack.

Report a bug or suggest an enhancement
For further API reference and developer documentation see the Java SE Documentation, which contains more detailed, developer-targeted descriptions with conceptual overviews, definitions of terms, workarounds, and working code examples. Other versions.
Java is a trademark or registered trademark of Oracle and/or its affiliates in the US and other countries.
Copyright © 1993, 2023, Oracle and/or its affiliates, 500 Oracle Parkway, Redwood Shores, CA 94065 USA.
All rights reserved. Use is subject to license terms and the documentation redistribution policy.

Источник

Class Stack

The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty , and a method to search the stack for an item and discover how far it is from the top.

When a stack is first created, it contains no items.

A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class. For example:

 Deque stack = new ArrayDeque();

Field Summary

Fields declared in class java.util.Vector

Fields declared in class java.util.AbstractList

Constructor Summary

Method Summary

Methods declared in class java.util.Vector

Methods declared in class java.lang.Object

Methods declared in interface java.util.Collection

Methods declared in interface java.util.List

Constructor Details

Stack

Method Details

push

pop

peek

empty

search

Returns the 1-based position where an object is on this stack. If the object o occurs as an item in this stack, this method returns the distance from the top of the stack of the occurrence nearest the top of the stack; the topmost item on the stack is considered to be at distance 1 . The equals method is used to compare o to the items in this stack.

Report a bug or suggest an enhancement
For further API reference and developer documentation see the Java SE Documentation, which contains more detailed, developer-targeted descriptions with conceptual overviews, definitions of terms, workarounds, and working code examples. Other versions.
Java is a trademark or registered trademark of Oracle and/or its affiliates in the US and other countries.
Copyright © 1993, 2023, Oracle and/or its affiliates, 500 Oracle Parkway, Redwood Shores, CA 94065 USA.
All rights reserved. Use is subject to license terms and the documentation redistribution policy.

Источник

How to stack in java

The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty , and a method to search the stack for an item and discover how far it is from the top. When a stack is first created, it contains no items. A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class. For example:

 Deque stack = new ArrayDeque();

Field Summary

Fields declared in class java.util.Vector

Fields declared in class java.util.AbstractList

Constructor Summary

Method Summary

Methods declared in class java.util.Vector

Methods declared in class java.lang.Object

Methods declared in interface java.util.Collection

Methods declared in interface java.util.List

Constructor Detail

Stack

Method Detail

push

pop

peek

empty

search

Returns the 1-based position where an object is on this stack. If the object o occurs as an item in this stack, this method returns the distance from the top of the stack of the occurrence nearest the top of the stack; the topmost item on the stack is considered to be at distance 1 . The equals method is used to compare o to the items in this stack.

Report a bug or suggest an enhancement
For further API reference and developer documentation see the Java SE Documentation, which contains more detailed, developer-targeted descriptions with conceptual overviews, definitions of terms, workarounds, and working code examples.
Java is a trademark or registered trademark of Oracle and/or its affiliates in the US and other countries.
Copyright © 1993, 2023, Oracle and/or its affiliates, 500 Oracle Parkway, Redwood Shores, CA 94065 USA.
All rights reserved. Use is subject to license terms and the documentation redistribution policy.

Источник

Оцените статью