Module grscheller.datastructures.stack
Module grscheller.datastructure.stack - LIFO stack:
Module implementing a LIFO stack using a singularly linked linear tree of nodes. The nodes can be safely shared between different Stack instances and are an implementation detail hidden from client code.
Pushing to, popping from, and getting the length of the stack are all O(1) operations.
Expand source code
# Copyright 2023 Geoffrey R. Scheller
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
"""Module grscheller.datastructure.stack - LIFO stack:
Module implementing a LIFO stack using a singularly linked linear tree of
nodes. The nodes can be safely shared between different Stack instances and
are an implementation detail hidden from client code.
Pushing to, popping from, and getting the length of the stack are all O(1)
operations.
"""
from __future__ import annotations
__all__ = ['PStack', 'FStack']
__author__ = "Geoffrey R. Scheller"
__copyright__ = "Copyright (c) 2023 Geoffrey R. Scheller"
__license__ = "Appache License 2.0"
from typing import Any, Callable, Self
from itertools import chain
from .core.iterlib import merge, exhaust
from .core.carray import CArray
class _Node():
"""Class implementing nodes that can be linked together to form a singularly
linked list. A node always contain data. It either has a reference to the
next _Node object or None to indicate the bottom of the linked list.
Nodes can safely be shared between different Stack instances.
"""
def __init__(self, data: Any, nodeNext: _Node|None):
"""Construct an element of a linked list, semantically immutable.
Note: It is the Stack class's responsibility that the _data property is
never set to None.
"""
self._data = data
self._next = nodeNext
def __bool__(self):
"""Always return true, None will return as false"""
return True
class Stack():
"""Abstract base class for the purposes of DRY inheritance of classes
implementing stack type data structures. Each stack is a very simple
stateful object containing a count of the number of elements on it and
a reference to an immutable node of a linear tree of singularly linked
nodes. Different stack objects can safely share the same data by each
pointing to the same node. Each stack class ensures None values do not
get pushed onto the the stack.
"""
def __init__(self, *ds):
"""Construct a LIFO Stack"""
self._head = None
self._count = 0
for d in ds:
if d is not None:
node = _Node(d, self._head)
self._head = node
self._count += 1
def __bool__(self) -> bool:
"""Returns true if stack is not empty"""
return self._count > 0
def __len__(self) -> int:
"""Returns current number of values on the stack"""
return self._count
def __iter__(self):
"""Iterator yielding data stored in the stack, starting at the head"""
node = self._head
while node:
yield node._data
node = node._next
def __reversed__(self):
"""Reverse iterate over the contents of the stack"""
return reversed(CArray(*self))
def __eq__(self, other: Any):
"""Returns True if all the data stored on the two stacks are the same
and the two stacks are of the same subclass. Worst case is O(n) behavior
which happens when all the corresponding data elements on the two stacks
are equal, in whatever sense they equality is defined, and none of the
nodes are shared.
"""
if not isinstance(other, type(self)):
return False
if self._count != other._count:
return False
left = self._head
right = other._head
nn = self._count
while nn > 0:
if left is right:
return True
if left is None or right is None:
return True
if left._data != right._data:
return False
left = left._next
right = right._next
nn -= 1
return True
class PStack(Stack):
"""Class implementing a Last In, First Out (LIFO) stack data structure. The
stack contains a singularly linked list of nodes. Class designed to share
nodes with other PStack instances.
PStacks are stateful objects where values can be pushed on & popped off.
A stack points to either the top node of a singlely linked list, or to
None which indicates an empty stack.
A stack keeps a count of the number of objects currently on it.
None represents the absence of a value and are ignored if pushed on the
stack. Use another object, like an empty tuple (), as a sentinal value.
"""
def __init__(self, *ds):
"""Construct a stateful LIFO Stack"""
super().__init__(*ds)
def __repr__(self):
"""Display the data in the stack, left to right starting at bottom"""
return '|| ' + ' <- '.join(reversed(CArray(*self).map(lambda x: repr(x)))) + ' ><'
def copy(self) -> PStack:
"""Return shallow copy of a PStack in O(1) time & space complexity"""
pstack = PStack()
pstack._head = self._head
pstack._count = self._count
return pstack
def push(self, *ds: Any) -> Self:
"""Push data that is not NONE onto top of stack,
return the stack being pushed.
"""
for d in ds:
if d is not None:
node = _Node(d, self._head)
self._head = node
self._count += 1
return self
def pop(self) -> Any|None:
"""Pop data off of top of stack"""
if self._head is None:
return None
else:
data = self._head._data
self._head = self._head._next
self._count -= 1
return data
def peak(self) -> Any|None:
"""Returns the data at the top of stack. Does not consume the data.
Note: If stack is empty, return None.
"""
if self._head is None:
return None
return self._head._data
def peakOr(self, default: Any) -> Any:
"""Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return default value.
"""
value = self.peak()
if value is None:
value = default
return value
def map(self, f: Callable[[Any], PStack]) -> None:
"""Maps a function (or callable object) over the values on the stack.
Returns a new stack with new nodes. None values surpressed.
"""
newPStack = PStack(*map(f, reversed(self)))
self._head = newPStack._head
self._count = newPStack._count
def flatMap(self, f: Callable[[Any], PStack]) -> None:
"""Apply function and flatten result, returns new instance.
Merge the stacks produced sequentially front-to-back.
"""
newPStack = PStack(*chain(
*map(reversed, map(f, reversed(self)))
))
self._head = newPStack._head
self._count = newPStack._count
def mergeMap(self, f: Callable[[Any], PStack]) -> None:
"""Apply function and flatten result, returns new instance.
Round Robin Merge the stacks produced until first cached stack is
exhausted.
"""
newPStack = PStack(*merge(
*map(reversed, map(f, reversed(self)))
))
self._head = newPStack._head
self._count = newPStack._count
def exhaustMap(self, f: Callable[[Any], PStack]) -> None:
"""Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until all the cached stacks are
exhausted.
"""
newPStack = PStack(*exhaust(
*map(reversed, map(f, reversed(self)))
))
self._head = newPStack._head
self._count = newPStack._count
class FStack(Stack):
"""Class implementing an immutable singularly linked stack data
structure consisting of a singularly linked list of nodes. This class
designed to share nodes with other FStack instances.
Functional stacks are also immutable objects.
A functional stack points to either the top node in the list, or to None
which indicates an empty stack.
A functional stack has the count of the number of objects on it.
None represents the absence of a value and are ignored if pushed on the
stack. Use another object, like an empty tuple (), as a sentinal values.
"""
def __init__(self, *ds):
"""Construct an immutable LIFO Stack"""
super().__init__(*ds)
def __repr__(self):
"""Display the data in the stack, left to right starting at bottom"""
return '| ' + ' <- '.join(reversed(CArray(*self).map(lambda x: repr(x)))) + ' ><'
def copy(self) -> FStack:
"""Return shallow copy of a FStack in O(1) time & space complexity"""
fstack = FStack()
fstack._head = self._head
fstack._count = self._count
return fstack
def head(self) -> Any|None:
"""Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return None.
"""
if self._head is None:
return None
return self._head._data
def headOr(self, default: Any) -> Any:
"""Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return default value.
"""
value = self.head()
if value is None:
value = default
return value
def tail(self) -> Stack|None:
"""Return tail of the stack. Note, the tail of an empty stack does
not exist, hence return None.
"""
stack = FStack()
if self._head:
stack._head = self._head._next
stack._count = self._count - 1
return stack
return None
def tailOr(self, default: FStack|None=None) -> Stack:
"""Return tail of the stack.
Note: If stack is empty, return default value of type Stack.
If default value not give, return a new empty stack.
"""
stack = self.tail()
if stack is None:
if default is None:
stack = FStack()
else:
stack = default
return stack
def cons(self, data: Any) -> FStack|None:
"""Return a new stack with data as head and self as tail.
Constructing a stack using a non-existent value as
head results in a non-existent stack.
"""
if data is not None:
stack = FStack()
stack._head = _Node(data, self._head)
stack._count = self._count + 1
return stack
else:
return None
def consOr(self, data: Any, default: Any=None) -> FStack:
"""Return a new stack with data as head and self as tail.
If data is None, use default value to construct the new FStack, unless
the default value is also None. In that case, just return the original
FStack.
"""
if data is None:
data = default
stack = FStack()
if data is not None:
stack._head = _Node(data, self._head)
stack._count = self._count + 1
else:
stack._head = self._head
stack._count = self._count
return stack
def map(self, f: Callable[[Any], FStack]) -> FStack:
"""Maps a function (or callable object) over the values on the stack.
Returns a new stack with new nodes. None values surpressed.
"""
return FStack(*map(f, reversed(self)))
def flatMap(self, f: Callable[[Any], FStack]) -> FStack:
"""Apply function and flatten result, returns new instance
Merge the stacks produced sequentially front-to-back.
"""
return FStack(*chain(
*map(reversed, map(f, reversed(self)))
))
def mergeMap(self, f: Callable[[Any], FStack]) -> FStack:
"""Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until first cached stack is
exhausted.
"""
return FStack(*merge(
*map(reversed, map(f, reversed(self)))
))
def exhaustMap(self, f: Callable[[Any], FStack]) -> FStack:
"""Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until all the cached stacks are
exhausted.
"""
return FStack(*exhaust(
*map(reversed, map(f, reversed(self)))
))
if __name__ == "__main__":
pass
Classes
class FStack (*ds)
-
Class implementing an immutable singularly linked stack data structure consisting of a singularly linked list of nodes. This class designed to share nodes with other FStack instances.
Functional stacks are also immutable objects.
A functional stack points to either the top node in the list, or to None which indicates an empty stack.
A functional stack has the count of the number of objects on it.
None represents the absence of a value and are ignored if pushed on the stack. Use another object, like an empty tuple (), as a sentinal values.
Construct an immutable LIFO Stack
Expand source code
class FStack(Stack): """Class implementing an immutable singularly linked stack data structure consisting of a singularly linked list of nodes. This class designed to share nodes with other FStack instances. Functional stacks are also immutable objects. A functional stack points to either the top node in the list, or to None which indicates an empty stack. A functional stack has the count of the number of objects on it. None represents the absence of a value and are ignored if pushed on the stack. Use another object, like an empty tuple (), as a sentinal values. """ def __init__(self, *ds): """Construct an immutable LIFO Stack""" super().__init__(*ds) def __repr__(self): """Display the data in the stack, left to right starting at bottom""" return '| ' + ' <- '.join(reversed(CArray(*self).map(lambda x: repr(x)))) + ' ><' def copy(self) -> FStack: """Return shallow copy of a FStack in O(1) time & space complexity""" fstack = FStack() fstack._head = self._head fstack._count = self._count return fstack def head(self) -> Any|None: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return None. """ if self._head is None: return None return self._head._data def headOr(self, default: Any) -> Any: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return default value. """ value = self.head() if value is None: value = default return value def tail(self) -> Stack|None: """Return tail of the stack. Note, the tail of an empty stack does not exist, hence return None. """ stack = FStack() if self._head: stack._head = self._head._next stack._count = self._count - 1 return stack return None def tailOr(self, default: FStack|None=None) -> Stack: """Return tail of the stack. Note: If stack is empty, return default value of type Stack. If default value not give, return a new empty stack. """ stack = self.tail() if stack is None: if default is None: stack = FStack() else: stack = default return stack def cons(self, data: Any) -> FStack|None: """Return a new stack with data as head and self as tail. Constructing a stack using a non-existent value as head results in a non-existent stack. """ if data is not None: stack = FStack() stack._head = _Node(data, self._head) stack._count = self._count + 1 return stack else: return None def consOr(self, data: Any, default: Any=None) -> FStack: """Return a new stack with data as head and self as tail. If data is None, use default value to construct the new FStack, unless the default value is also None. In that case, just return the original FStack. """ if data is None: data = default stack = FStack() if data is not None: stack._head = _Node(data, self._head) stack._count = self._count + 1 else: stack._head = self._head stack._count = self._count return stack def map(self, f: Callable[[Any], FStack]) -> FStack: """Maps a function (or callable object) over the values on the stack. Returns a new stack with new nodes. None values surpressed. """ return FStack(*map(f, reversed(self))) def flatMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Merge the stacks produced sequentially front-to-back. """ return FStack(*chain( *map(reversed, map(f, reversed(self))) )) def mergeMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until first cached stack is exhausted. """ return FStack(*merge( *map(reversed, map(f, reversed(self))) )) def exhaustMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until all the cached stacks are exhausted. """ return FStack(*exhaust( *map(reversed, map(f, reversed(self))) ))
Ancestors
- grscheller.datastructures.stack.Stack
Methods
def cons(self, data: Any) ‑> FStack | None
-
Return a new stack with data as head and self as tail.
Constructing a stack using a non-existent value as head results in a non-existent stack.
Expand source code
def cons(self, data: Any) -> FStack|None: """Return a new stack with data as head and self as tail. Constructing a stack using a non-existent value as head results in a non-existent stack. """ if data is not None: stack = FStack() stack._head = _Node(data, self._head) stack._count = self._count + 1 return stack else: return None
def consOr(self, data: Any, default: Any = None) ‑> FStack
-
Return a new stack with data as head and self as tail.
If data is None, use default value to construct the new FStack, unless the default value is also None. In that case, just return the original FStack.
Expand source code
def consOr(self, data: Any, default: Any=None) -> FStack: """Return a new stack with data as head and self as tail. If data is None, use default value to construct the new FStack, unless the default value is also None. In that case, just return the original FStack. """ if data is None: data = default stack = FStack() if data is not None: stack._head = _Node(data, self._head) stack._count = self._count + 1 else: stack._head = self._head stack._count = self._count return stack
def copy(self) ‑> FStack
-
Return shallow copy of a FStack in O(1) time & space complexity
Expand source code
def copy(self) -> FStack: """Return shallow copy of a FStack in O(1) time & space complexity""" fstack = FStack() fstack._head = self._head fstack._count = self._count return fstack
def exhaustMap(self, f: Callable[[Any], FStack]) ‑> FStack
-
Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until all the cached stacks are exhausted.
Expand source code
def exhaustMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until all the cached stacks are exhausted. """ return FStack(*exhaust( *map(reversed, map(f, reversed(self))) ))
def flatMap(self, f: Callable[[Any], FStack]) ‑> FStack
-
Apply function and flatten result, returns new instance
Merge the stacks produced sequentially front-to-back.
Expand source code
def flatMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Merge the stacks produced sequentially front-to-back. """ return FStack(*chain( *map(reversed, map(f, reversed(self))) ))
def head(self) ‑> typing.Any | None
-
Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return None.
Expand source code
def head(self) -> Any|None: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return None. """ if self._head is None: return None return self._head._data
def headOr(self, default: Any) ‑> Any
-
Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return default value.
Expand source code
def headOr(self, default: Any) -> Any: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return default value. """ value = self.head() if value is None: value = default return value
def map(self, f: Callable[[Any], FStack]) ‑> FStack
-
Maps a function (or callable object) over the values on the stack.
Returns a new stack with new nodes. None values surpressed.
Expand source code
def map(self, f: Callable[[Any], FStack]) -> FStack: """Maps a function (or callable object) over the values on the stack. Returns a new stack with new nodes. None values surpressed. """ return FStack(*map(f, reversed(self)))
def mergeMap(self, f: Callable[[Any], FStack]) ‑> FStack
-
Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until first cached stack is exhausted.
Expand source code
def mergeMap(self, f: Callable[[Any], FStack]) -> FStack: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until first cached stack is exhausted. """ return FStack(*merge( *map(reversed, map(f, reversed(self))) ))
def tail(self) ‑> grscheller.datastructures.stack.Stack | None
-
Return tail of the stack. Note, the tail of an empty stack does not exist, hence return None.
Expand source code
def tail(self) -> Stack|None: """Return tail of the stack. Note, the tail of an empty stack does not exist, hence return None. """ stack = FStack() if self._head: stack._head = self._head._next stack._count = self._count - 1 return stack return None
def tailOr(self, default: FStack | None = None) ‑> grscheller.datastructures.stack.Stack
-
Return tail of the stack.
Note: If stack is empty, return default value of type Stack. If default value not give, return a new empty stack.
Expand source code
def tailOr(self, default: FStack|None=None) -> Stack: """Return tail of the stack. Note: If stack is empty, return default value of type Stack. If default value not give, return a new empty stack. """ stack = self.tail() if stack is None: if default is None: stack = FStack() else: stack = default return stack
class PStack (*ds)
-
Class implementing a Last In, First Out (LIFO) stack data structure. The stack contains a singularly linked list of nodes. Class designed to share nodes with other PStack instances.
PStacks are stateful objects where values can be pushed on & popped off.
A stack points to either the top node of a singlely linked list, or to None which indicates an empty stack.
A stack keeps a count of the number of objects currently on it.
None represents the absence of a value and are ignored if pushed on the stack. Use another object, like an empty tuple (), as a sentinal value.
Construct a stateful LIFO Stack
Expand source code
class PStack(Stack): """Class implementing a Last In, First Out (LIFO) stack data structure. The stack contains a singularly linked list of nodes. Class designed to share nodes with other PStack instances. PStacks are stateful objects where values can be pushed on & popped off. A stack points to either the top node of a singlely linked list, or to None which indicates an empty stack. A stack keeps a count of the number of objects currently on it. None represents the absence of a value and are ignored if pushed on the stack. Use another object, like an empty tuple (), as a sentinal value. """ def __init__(self, *ds): """Construct a stateful LIFO Stack""" super().__init__(*ds) def __repr__(self): """Display the data in the stack, left to right starting at bottom""" return '|| ' + ' <- '.join(reversed(CArray(*self).map(lambda x: repr(x)))) + ' ><' def copy(self) -> PStack: """Return shallow copy of a PStack in O(1) time & space complexity""" pstack = PStack() pstack._head = self._head pstack._count = self._count return pstack def push(self, *ds: Any) -> Self: """Push data that is not NONE onto top of stack, return the stack being pushed. """ for d in ds: if d is not None: node = _Node(d, self._head) self._head = node self._count += 1 return self def pop(self) -> Any|None: """Pop data off of top of stack""" if self._head is None: return None else: data = self._head._data self._head = self._head._next self._count -= 1 return data def peak(self) -> Any|None: """Returns the data at the top of stack. Does not consume the data. Note: If stack is empty, return None. """ if self._head is None: return None return self._head._data def peakOr(self, default: Any) -> Any: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return default value. """ value = self.peak() if value is None: value = default return value def map(self, f: Callable[[Any], PStack]) -> None: """Maps a function (or callable object) over the values on the stack. Returns a new stack with new nodes. None values surpressed. """ newPStack = PStack(*map(f, reversed(self))) self._head = newPStack._head self._count = newPStack._count def flatMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance. Merge the stacks produced sequentially front-to-back. """ newPStack = PStack(*chain( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count def mergeMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance. Round Robin Merge the stacks produced until first cached stack is exhausted. """ newPStack = PStack(*merge( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count def exhaustMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until all the cached stacks are exhausted. """ newPStack = PStack(*exhaust( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count
Ancestors
- grscheller.datastructures.stack.Stack
Methods
def copy(self) ‑> PStack
-
Return shallow copy of a PStack in O(1) time & space complexity
Expand source code
def copy(self) -> PStack: """Return shallow copy of a PStack in O(1) time & space complexity""" pstack = PStack() pstack._head = self._head pstack._count = self._count return pstack
def exhaustMap(self, f: Callable[[Any], PStack]) ‑> None
-
Apply function and flatten result, returns new instance
Round Robin Merge the stacks produced until all the cached stacks are exhausted.
Expand source code
def exhaustMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance Round Robin Merge the stacks produced until all the cached stacks are exhausted. """ newPStack = PStack(*exhaust( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count
def flatMap(self, f: Callable[[Any], PStack]) ‑> None
-
Apply function and flatten result, returns new instance.
Merge the stacks produced sequentially front-to-back.
Expand source code
def flatMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance. Merge the stacks produced sequentially front-to-back. """ newPStack = PStack(*chain( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count
def map(self, f: Callable[[Any], PStack]) ‑> None
-
Maps a function (or callable object) over the values on the stack.
Returns a new stack with new nodes. None values surpressed.
Expand source code
def map(self, f: Callable[[Any], PStack]) -> None: """Maps a function (or callable object) over the values on the stack. Returns a new stack with new nodes. None values surpressed. """ newPStack = PStack(*map(f, reversed(self))) self._head = newPStack._head self._count = newPStack._count
def mergeMap(self, f: Callable[[Any], PStack]) ‑> None
-
Apply function and flatten result, returns new instance.
Round Robin Merge the stacks produced until first cached stack is exhausted.
Expand source code
def mergeMap(self, f: Callable[[Any], PStack]) -> None: """Apply function and flatten result, returns new instance. Round Robin Merge the stacks produced until first cached stack is exhausted. """ newPStack = PStack(*merge( *map(reversed, map(f, reversed(self))) )) self._head = newPStack._head self._count = newPStack._count
def peak(self) ‑> typing.Any | None
-
Returns the data at the top of stack. Does not consume the data.
Note: If stack is empty, return None.
Expand source code
def peak(self) -> Any|None: """Returns the data at the top of stack. Does not consume the data. Note: If stack is empty, return None. """ if self._head is None: return None return self._head._data
def peakOr(self, default: Any) ‑> Any
-
Returns the data at the head of stack. Does not consume the data.
Note: If stack is empty, return default value.
Expand source code
def peakOr(self, default: Any) -> Any: """Returns the data at the head of stack. Does not consume the data. Note: If stack is empty, return default value. """ value = self.peak() if value is None: value = default return value
def pop(self) ‑> typing.Any | None
-
Pop data off of top of stack
Expand source code
def pop(self) -> Any|None: """Pop data off of top of stack""" if self._head is None: return None else: data = self._head._data self._head = self._head._next self._count -= 1 return data
def push(self, *ds: Any) ‑> Self
-
Push data that is not NONE onto top of stack, return the stack being pushed.
Expand source code
def push(self, *ds: Any) -> Self: """Push data that is not NONE onto top of stack, return the stack being pushed. """ for d in ds: if d is not None: node = _Node(d, self._head) self._head = node self._count += 1 return self