Compare commits
19 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
98387157f5
|
||
|
|
90f494a1f6
|
||
|
|
497b615fe3
|
||
|
|
6349ce2519
|
||
|
|
40a73be7eb
|
||
|
|
2f95167895
|
||
|
|
1d0e31d10d
|
||
|
|
52dffb8041
|
||
|
|
d915f17e2b
|
||
|
|
46d83f2cb9
|
||
|
|
765d634d5c
|
||
|
|
ee6820ef60
|
||
|
|
1951fcda8a
|
||
|
|
440fab9e70
|
||
|
|
b53b729ea1
|
||
|
|
714bf79d22
|
||
|
|
53da59c06e
|
||
|
|
fe00eaf3c8
|
||
|
|
71c7aa5c5c
|
25
CHANGELOG
25
CHANGELOG
@@ -1,3 +1,28 @@
|
|||||||
|
- 0.3.0
|
||||||
|
* Clean up lingering keys in lists when moving from alias state
|
||||||
|
* Properly set default state when set through instantiation
|
||||||
|
* Pass key to verifier (breaking change)
|
||||||
|
* Ensure all states and aliases persisted even if empty
|
||||||
|
* Allow auto-generated aliases when listing all states
|
||||||
|
* Reformat auto-generated aliases, double underscore instead of dot (breaking change)
|
||||||
|
- 0.2.10
|
||||||
|
* Add count active states method
|
||||||
|
* Enable complete replace of NEW state on state instantiation
|
||||||
|
- 0.2.9
|
||||||
|
* Enable access to is_pure method
|
||||||
|
* Numeric option for elements return value
|
||||||
|
- 0.2.8
|
||||||
|
* Remove sync on persist set
|
||||||
|
- 0.2.7
|
||||||
|
* Handle missing files in fs readdir list
|
||||||
|
- 0.2.6
|
||||||
|
* Ensure atomic state lock in fs
|
||||||
|
- 0.2.5
|
||||||
|
* Correct handling of persistent sync when no not-state filter has been set
|
||||||
|
- 0.2.4
|
||||||
|
* Add optional concurrency lock for persistence store, implemented for file store
|
||||||
|
- 0.2.3
|
||||||
|
* Add noop-store, for convenience for code using persist constructor but will only use memory state
|
||||||
- 0.2.2
|
- 0.2.2
|
||||||
* Fix composite state factory load regex
|
* Fix composite state factory load regex
|
||||||
- 0.2.1
|
- 0.2.1
|
||||||
|
|||||||
1
README.rocksdb
Normal file
1
README.rocksdb
Normal file
@@ -0,0 +1 @@
|
|||||||
|
Rocksdb extension requires python 3.9, as it uses lbry-rocksdb which at the time of writing (13.10.2022) does not have a package available for python 3.10.
|
||||||
@@ -1,6 +1,6 @@
|
|||||||
[metadata]
|
[metadata]
|
||||||
name = shep
|
name = shep
|
||||||
version = 0.2.2
|
version = 0.3.0
|
||||||
description = Multi-state key stores using bit masks
|
description = Multi-state key stores using bit masks
|
||||||
author = Louis Holbrook
|
author = Louis Holbrook
|
||||||
author_email = dev@holbrook.no
|
author_email = dev@holbrook.no
|
||||||
@@ -22,7 +22,7 @@ licence_files =
|
|||||||
|
|
||||||
[options]
|
[options]
|
||||||
include_package_data = True
|
include_package_data = True
|
||||||
python_requires = >= 3.6
|
python_requires = >= 3.7
|
||||||
packages =
|
packages =
|
||||||
shep
|
shep
|
||||||
shep.store
|
shep.store
|
||||||
|
|||||||
@@ -32,3 +32,9 @@ class StateTransitionInvalid(Exception):
|
|||||||
"""Raised if state transition verification fails
|
"""Raised if state transition verification fails
|
||||||
"""
|
"""
|
||||||
pass
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
class StateLockedKey(Exception):
|
||||||
|
"""Attempt to write to a state key that is being written to by another client
|
||||||
|
"""
|
||||||
|
pass
|
||||||
|
|||||||
@@ -2,8 +2,13 @@
|
|||||||
import datetime
|
import datetime
|
||||||
|
|
||||||
# local imports
|
# local imports
|
||||||
from .state import State
|
from .state import (
|
||||||
from .error import StateItemExists
|
State,
|
||||||
|
)
|
||||||
|
from .error import (
|
||||||
|
StateItemExists,
|
||||||
|
StateLockedKey,
|
||||||
|
)
|
||||||
|
|
||||||
|
|
||||||
class PersistedState(State):
|
class PersistedState(State):
|
||||||
@@ -17,14 +22,16 @@ class PersistedState(State):
|
|||||||
:type logger: object
|
:type logger: object
|
||||||
"""
|
"""
|
||||||
|
|
||||||
def __init__(self, factory, bits, logger=None, verifier=None, check_alias=True, event_callback=None):
|
def __init__(self, factory, bits, logger=None, verifier=None, check_alias=True, event_callback=None, default_state=None):
|
||||||
super(PersistedState, self).__init__(bits, logger=logger, verifier=verifier, check_alias=check_alias, event_callback=event_callback)
|
super(PersistedState, self).__init__(bits, logger=logger, verifier=verifier, check_alias=check_alias, event_callback=event_callback, default_state=default_state)
|
||||||
self.__store_factory = factory
|
self.__store_factory = factory
|
||||||
self.__stores = {}
|
self.__stores = {}
|
||||||
|
self.__ensure_store(self.base_state_name)
|
||||||
|
|
||||||
|
|
||||||
# Create state store container if missing.
|
# Create state store container if missing.
|
||||||
def __ensure_store(self, k):
|
def __ensure_store(self, k):
|
||||||
|
k = k.upper()
|
||||||
if self.__stores.get(k) == None:
|
if self.__stores.get(k) == None:
|
||||||
self.__stores[k] = self.__store_factory(k)
|
self.__stores[k] = self.__store_factory(k)
|
||||||
|
|
||||||
@@ -34,13 +41,14 @@ class PersistedState(State):
|
|||||||
|
|
||||||
See shep.state.State.put
|
See shep.state.State.put
|
||||||
"""
|
"""
|
||||||
to_state = super(PersistedState, self).put(key, state=state, contents=contents)
|
k = self.to_name(state)
|
||||||
|
|
||||||
k = self.name(to_state)
|
|
||||||
|
|
||||||
self.__ensure_store(k)
|
self.__ensure_store(k)
|
||||||
|
|
||||||
self.__stores[k].put(key, contents)
|
self.__stores[k].put(key, contents)
|
||||||
|
|
||||||
|
super(PersistedState, self).put(key, state=state, contents=contents)
|
||||||
|
|
||||||
self.register_modify(key)
|
self.register_modify(key)
|
||||||
|
|
||||||
|
|
||||||
@@ -56,16 +64,21 @@ class PersistedState(State):
|
|||||||
k_to = self.name(to_state)
|
k_to = self.name(to_state)
|
||||||
self.__ensure_store(k_to)
|
self.__ensure_store(k_to)
|
||||||
|
|
||||||
contents = self.__stores[k_from].get(key)
|
contents = None
|
||||||
self.__stores[k_to].put(key, contents)
|
try:
|
||||||
self.__stores[k_from].remove(key)
|
contents = self.__stores[k_from].get(key)
|
||||||
|
self.__stores[k_to].put(key, contents)
|
||||||
self.sync(to_state)
|
self.__stores[k_from].remove(key)
|
||||||
|
except StateLockedKey as e:
|
||||||
|
super(PersistedState, self).unset(key, or_state, allow_base=True)
|
||||||
|
raise e
|
||||||
|
|
||||||
|
#self.sync(to_state)
|
||||||
|
|
||||||
return to_state
|
return to_state
|
||||||
|
|
||||||
|
|
||||||
def unset(self, key, not_state):
|
def unset(self, key, not_state, allow_base=False):
|
||||||
"""Persist a new state for a key or key/content.
|
"""Persist a new state for a key or key/content.
|
||||||
|
|
||||||
See shep.state.State.unset
|
See shep.state.State.unset
|
||||||
@@ -73,7 +86,7 @@ class PersistedState(State):
|
|||||||
from_state = self.state(key)
|
from_state = self.state(key)
|
||||||
k_from = self.name(from_state)
|
k_from = self.name(from_state)
|
||||||
|
|
||||||
to_state = super(PersistedState, self).unset(key, not_state)
|
to_state = super(PersistedState, self).unset(key, not_state, allow_base=allow_base)
|
||||||
|
|
||||||
k_to = self.name(to_state)
|
k_to = self.name(to_state)
|
||||||
self.__ensure_store(k_to)
|
self.__ensure_store(k_to)
|
||||||
@@ -135,7 +148,7 @@ class PersistedState(State):
|
|||||||
return to_state
|
return to_state
|
||||||
|
|
||||||
|
|
||||||
def sync(self, state=None):
|
def sync(self, state=None, not_state=None, ignore_auto=True):
|
||||||
"""Reload resources for a single state in memory from the persisted state store.
|
"""Reload resources for a single state in memory from the persisted state store.
|
||||||
|
|
||||||
:param state: State to load
|
:param state: State to load
|
||||||
@@ -143,11 +156,20 @@ class PersistedState(State):
|
|||||||
:raises StateItemExists: A content key is already recorded with a different state in memory than in persisted store.
|
:raises StateItemExists: A content key is already recorded with a different state in memory than in persisted store.
|
||||||
# :todo: if sync state is none, sync all
|
# :todo: if sync state is none, sync all
|
||||||
"""
|
"""
|
||||||
states = []
|
|
||||||
|
states_numeric = []
|
||||||
if state == None:
|
if state == None:
|
||||||
states = list(self.all())
|
states_numeric = list(self.all(numeric=True, ignore_auto=ignore_auto))
|
||||||
else:
|
else:
|
||||||
states = [self.name(state)]
|
states_numeric = [state]
|
||||||
|
|
||||||
|
states = []
|
||||||
|
for state in states_numeric:
|
||||||
|
if not_state != None:
|
||||||
|
if state & not_state == 0:
|
||||||
|
states.append(self.name(state))
|
||||||
|
else:
|
||||||
|
states.append(self.name(state))
|
||||||
|
|
||||||
ks = []
|
ks = []
|
||||||
for k in states:
|
for k in states:
|
||||||
@@ -208,13 +230,24 @@ class PersistedState(State):
|
|||||||
|
|
||||||
See shep.state.State.replace
|
See shep.state.State.replace
|
||||||
"""
|
"""
|
||||||
super(PersistedState, self).replace(key, contents)
|
|
||||||
state = self.state(key)
|
state = self.state(key)
|
||||||
k = self.name(state)
|
k = self.name(state)
|
||||||
return self.__stores[k].replace(key, contents)
|
r = self.__stores[k].replace(key, contents)
|
||||||
|
super(PersistedState, self).replace(key, contents)
|
||||||
|
return r
|
||||||
|
|
||||||
|
|
||||||
def modified(self, key):
|
def modified(self, key):
|
||||||
state = self.state(key)
|
state = self.state(key)
|
||||||
k = self.name(state)
|
k = self.name(state)
|
||||||
return self.__stores[k].modified(key)
|
return self.__stores[k].modified(key)
|
||||||
|
|
||||||
|
|
||||||
|
def add(self, key):
|
||||||
|
self.__ensure_store(key)
|
||||||
|
super(PersistedState, self).add(key)
|
||||||
|
|
||||||
|
|
||||||
|
def alias(self, key, *args):
|
||||||
|
self.__ensure_store(key)
|
||||||
|
super(PersistedState, self).alias(key, *args)
|
||||||
|
|||||||
152
shep/state.py
152
shep/state.py
@@ -15,6 +15,18 @@ from shep.error import (
|
|||||||
|
|
||||||
re_name = r'^[a-zA-Z_\.]+$'
|
re_name = r'^[a-zA-Z_\.]+$'
|
||||||
|
|
||||||
|
def join_elements(states):
|
||||||
|
return '_' + '__'.join(states)
|
||||||
|
|
||||||
|
|
||||||
|
def split_elements(s):
|
||||||
|
if len(s) == 0:
|
||||||
|
return []
|
||||||
|
if s[0] == '_':
|
||||||
|
s = s[1:]
|
||||||
|
return s.split('__')
|
||||||
|
|
||||||
|
|
||||||
class State:
|
class State:
|
||||||
"""State is an in-memory bitmasked state store for key-value pairs, or even just keys alone.
|
"""State is an in-memory bitmasked state store for key-value pairs, or even just keys alone.
|
||||||
|
|
||||||
@@ -30,16 +42,26 @@ class State:
|
|||||||
|
|
||||||
base_state_name = 'NEW'
|
base_state_name = 'NEW'
|
||||||
|
|
||||||
def __init__(self, bits, logger=None, verifier=None, check_alias=True, event_callback=None):
|
def __init__(self, bits, logger=None, verifier=None, check_alias=True, event_callback=None, default_state=None):
|
||||||
self.__initial_bits = bits
|
self.__initial_bits = bits
|
||||||
self.__bits = bits
|
self.__bits = bits
|
||||||
self.__limit = (1 << bits) - 1
|
self.__limit = (1 << bits) - 1
|
||||||
self.__c = 0
|
self.__c = 0
|
||||||
setattr(self, self.base_state_name, 0)
|
|
||||||
|
|
||||||
self.__reverse = {0: getattr(self, self.base_state_name)}
|
|
||||||
self.__keys = {getattr(self, self.base_state_name): []}
|
|
||||||
self.__keys_reverse = {}
|
self.__keys_reverse = {}
|
||||||
|
|
||||||
|
if default_state == None:
|
||||||
|
default_state = self.base_state_name
|
||||||
|
else:
|
||||||
|
default_state = self.__check_name_valid(default_state)
|
||||||
|
self.base_state_name = default_state
|
||||||
|
self.__keys_reverse[default_state] = 0
|
||||||
|
|
||||||
|
setattr(self, default_state, 0)
|
||||||
|
|
||||||
|
self.__reverse = {0: default_state}
|
||||||
|
self.__keys = {0: []}
|
||||||
|
|
||||||
self.__contents = {}
|
self.__contents = {}
|
||||||
self.modified_last = {}
|
self.modified_last = {}
|
||||||
self.verifier = verifier
|
self.verifier = verifier
|
||||||
@@ -53,7 +75,7 @@ class State:
|
|||||||
|
|
||||||
|
|
||||||
# return true if v is a single-bit state
|
# return true if v is a single-bit state
|
||||||
def __is_pure(self, v):
|
def is_pure(self, v):
|
||||||
if v == 0:
|
if v == 0:
|
||||||
return True
|
return True
|
||||||
c = 1
|
c = 1
|
||||||
@@ -139,7 +161,7 @@ class State:
|
|||||||
def __add_state_list(self, state, item):
|
def __add_state_list(self, state, item):
|
||||||
if self.__keys.get(state) == None:
|
if self.__keys.get(state) == None:
|
||||||
self.__keys[state] = []
|
self.__keys[state] = []
|
||||||
if not self.__is_pure(state) or state == 0:
|
if not self.is_pure(state) or state == 0:
|
||||||
self.__keys[state].append(item)
|
self.__keys[state].append(item)
|
||||||
c = 1
|
c = 1
|
||||||
for i in range(self.__bits):
|
for i in range(self.__bits):
|
||||||
@@ -185,13 +207,20 @@ class State:
|
|||||||
self.__set(k, v)
|
self.__set(k, v)
|
||||||
|
|
||||||
|
|
||||||
|
def to_name(self, k):
|
||||||
|
if k == None:
|
||||||
|
k = 0
|
||||||
|
return self.name(k)
|
||||||
|
|
||||||
|
|
||||||
def __alias(self, k, *args):
|
def __alias(self, k, *args):
|
||||||
v = 0
|
v = 0
|
||||||
for a in args:
|
for a in args:
|
||||||
a = self.__check_value_cursor(a)
|
a = self.__check_value_cursor(a)
|
||||||
v = self.__check_limit(v | a, pure=False)
|
v = self.__check_limit(v | a, pure=False)
|
||||||
if self.__is_pure(v):
|
if self.is_pure(v):
|
||||||
raise ValueError('use add to add pure values')
|
raise ValueError('use add to add pure values')
|
||||||
|
k = k.replace('.', '__')
|
||||||
return self.__set(k, v)
|
return self.__set(k, v)
|
||||||
|
|
||||||
|
|
||||||
@@ -211,44 +240,76 @@ class State:
|
|||||||
return self.__alias(k, *args)
|
return self.__alias(k, *args)
|
||||||
|
|
||||||
|
|
||||||
def all(self, pure=False):
|
def __all_bit(self):
|
||||||
"""Return list of all unique atomic and alias states.
|
r = []
|
||||||
|
r.append(self.name(0))
|
||||||
|
v = 1
|
||||||
|
while v < self.__limit:
|
||||||
|
r.append(self.name(v))
|
||||||
|
v <<= 1
|
||||||
|
return r
|
||||||
|
|
||||||
|
|
||||||
|
def all(self, pure=False, numeric=False, ignore_auto=True, bit_order=False):
|
||||||
|
"""Return list of all unique atomic and alias state strings.
|
||||||
|
|
||||||
:rtype: list of ints
|
:rtype: list of ints
|
||||||
:return: states
|
:return: states
|
||||||
"""
|
"""
|
||||||
l = []
|
l = []
|
||||||
for k in dir(self):
|
v = None
|
||||||
if k[0] == '_':
|
if bit_order:
|
||||||
|
v = self.__all_bit()
|
||||||
|
else:
|
||||||
|
v = dir(self)
|
||||||
|
for k in v:
|
||||||
|
state = None
|
||||||
|
if k[0] == '_' and ignore_auto:
|
||||||
continue
|
continue
|
||||||
if k.upper() != k:
|
if k.upper() != k:
|
||||||
continue
|
continue
|
||||||
if pure:
|
if pure:
|
||||||
state = self.from_name(k)
|
state = self.from_name(k)
|
||||||
if not self.__is_pure(state):
|
if not self.is_pure(state):
|
||||||
continue
|
continue
|
||||||
l.append(k)
|
if numeric:
|
||||||
l.sort()
|
if state == None:
|
||||||
|
state = self.from_name(k)
|
||||||
|
l.append(state)
|
||||||
|
else:
|
||||||
|
l.append(k)
|
||||||
|
if not bit_order:
|
||||||
|
l.sort()
|
||||||
return l
|
return l
|
||||||
|
|
||||||
|
|
||||||
def elements(self, v):
|
def elements(self, v, numeric=False, as_string=True):
|
||||||
r = []
|
r = []
|
||||||
if v == None or v == 0:
|
if v == None or v == 0:
|
||||||
return self.base_state_name
|
return self.base_state_name
|
||||||
c = 1
|
c = 1
|
||||||
for i in range(self.__bits):
|
for i in range(self.__bits):
|
||||||
if v & c > 0:
|
if (v & c) > 0:
|
||||||
r.append(self.name(c))
|
if numeric:
|
||||||
|
r.append(c)
|
||||||
|
else:
|
||||||
|
r.append(self.name(c))
|
||||||
c <<= 1
|
c <<= 1
|
||||||
return '_' + '.'.join(r)
|
|
||||||
|
if numeric or not as_string:
|
||||||
|
return r
|
||||||
|
|
||||||
|
if len(r) == 1:
|
||||||
|
return self.name(v)
|
||||||
|
|
||||||
|
return join_elements(r) #'_' + '.'.join(r)
|
||||||
|
|
||||||
|
|
||||||
def from_elements(self, k):
|
def from_elements(self, k):
|
||||||
r = 0
|
r = 0
|
||||||
if k[0] != '_':
|
if k[0] != '_':
|
||||||
raise ValueError('elements string must start with underscore (_), got {}'.format(k))
|
raise ValueError('elements string must start with underscore (_), got {}'.format(k))
|
||||||
for v in k[1:].split('.'):
|
for v in k[1:].split('__'):
|
||||||
r |= self.from_name(v)
|
r |= self.from_name(v)
|
||||||
return r
|
return r
|
||||||
|
|
||||||
@@ -284,6 +345,8 @@ class State:
|
|||||||
:return: Numeric state value
|
:return: Numeric state value
|
||||||
"""
|
"""
|
||||||
k = self.__check_name_valid(k)
|
k = self.__check_name_valid(k)
|
||||||
|
if k == self.base_state_name:
|
||||||
|
return 0
|
||||||
return getattr(self, k)
|
return getattr(self, k)
|
||||||
|
|
||||||
|
|
||||||
@@ -391,16 +454,19 @@ class State:
|
|||||||
raise StateCorruptionError(to_state)
|
raise StateCorruptionError(to_state)
|
||||||
|
|
||||||
if self.verifier != None:
|
if self.verifier != None:
|
||||||
r = self.verifier(self, from_state, to_state)
|
r = self.verifier(self, key, from_state, to_state)
|
||||||
if r != None:
|
if r != None:
|
||||||
raise StateTransitionInvalid(r)
|
raise StateTransitionInvalid(r)
|
||||||
|
|
||||||
current_state_list.pop(idx)
|
old_state = self.__keys_reverse.get(key)
|
||||||
|
|
||||||
if self.event_callback != None:
|
if self.event_callback != None:
|
||||||
old_state = self.__keys_reverse.get(key)
|
|
||||||
self.event_callback(key, self.name(old_state), self.name(to_state))
|
self.event_callback(key, self.name(old_state), self.name(to_state))
|
||||||
|
|
||||||
|
if old_state == 0:
|
||||||
|
current_state_list.pop(idx)
|
||||||
|
else:
|
||||||
|
for k in self.elements(from_state, numeric=True):
|
||||||
|
self.__keys[k].remove(key)
|
||||||
self.__add_state_list(to_state, key)
|
self.__add_state_list(to_state, key)
|
||||||
|
|
||||||
self.register_modify(key)
|
self.register_modify(key)
|
||||||
@@ -421,7 +487,7 @@ class State:
|
|||||||
:rtype: int
|
:rtype: int
|
||||||
:returns: Resulting state
|
:returns: Resulting state
|
||||||
"""
|
"""
|
||||||
if not self.__is_pure(or_state):
|
if not self.is_pure(or_state):
|
||||||
raise ValueError('can only apply using single bit states')
|
raise ValueError('can only apply using single bit states')
|
||||||
|
|
||||||
current_state = self.__keys_reverse.get(key)
|
current_state = self.__keys_reverse.get(key)
|
||||||
@@ -436,22 +502,24 @@ class State:
|
|||||||
return self.__move(key, current_state, to_state)
|
return self.__move(key, current_state, to_state)
|
||||||
|
|
||||||
|
|
||||||
def unset(self, key, not_state):
|
def unset(self, key, not_state, allow_base=False):
|
||||||
"""Unset a single bit, moving to a pure or alias state.
|
"""Unset a single bit, moving to a pure or alias state.
|
||||||
|
|
||||||
The resulting state cannot be State.base_state_name (0).
|
If allow_base is set to False, The resulting state cannot be State.base_state_name (0).
|
||||||
|
|
||||||
:param key: Content key to modify state for
|
:param key: Content key to modify state for
|
||||||
:type key: str
|
:type key: str
|
||||||
:param or_state: Atomic stat to add
|
:param or_state: Atomic stat to add
|
||||||
:type or_state: int
|
:type or_state: int
|
||||||
|
:paran allow_base: Allow state to be reset to 0
|
||||||
|
:type allow_base: bool
|
||||||
:raises ValueError: State is not a single bit state, or attempts to revert to State.base_state_name
|
:raises ValueError: State is not a single bit state, or attempts to revert to State.base_state_name
|
||||||
:raises StateItemNotFound: Content key is not registered
|
:raises StateItemNotFound: Content key is not registered
|
||||||
:raises StateInvalid: Resulting state after addition of atomic state is unknown
|
:raises StateInvalid: Resulting state after addition of atomic state is unknown
|
||||||
:rtype: int
|
:rtype: int
|
||||||
:returns: Resulting state
|
:returns: Resulting state
|
||||||
"""
|
"""
|
||||||
if not self.__is_pure(not_state):
|
if not self.is_pure(not_state):
|
||||||
raise ValueError('can only apply using single bit states')
|
raise ValueError('can only apply using single bit states')
|
||||||
|
|
||||||
current_state = self.__keys_reverse.get(key)
|
current_state = self.__keys_reverse.get(key)
|
||||||
@@ -462,7 +530,7 @@ class State:
|
|||||||
if to_state == current_state:
|
if to_state == current_state:
|
||||||
raise ValueError('invalid change for state {}: {}'.format(key, not_state))
|
raise ValueError('invalid change for state {}: {}'.format(key, not_state))
|
||||||
|
|
||||||
if to_state == getattr(self, self.base_state_name):
|
if to_state == getattr(self, self.base_state_name) and not allow_base:
|
||||||
raise ValueError('State {} for {} cannot be reverted to {}'.format(current_state, key, self.base_state_name))
|
raise ValueError('State {} for {} cannot be reverted to {}'.format(current_state, key, self.base_state_name))
|
||||||
|
|
||||||
new_state = self.__reverse.get(to_state)
|
new_state = self.__reverse.get(to_state)
|
||||||
@@ -534,7 +602,7 @@ class State:
|
|||||||
return []
|
return []
|
||||||
|
|
||||||
|
|
||||||
def sync(self, state=None):
|
def sync(self, state=None, not_state=None, ignore_auto=True):
|
||||||
"""Noop method for interface implementation providing sync to backend.
|
"""Noop method for interface implementation providing sync to backend.
|
||||||
|
|
||||||
:param state: State to sync.
|
:param state: State to sync.
|
||||||
@@ -567,7 +635,7 @@ class State:
|
|||||||
state = self.__keys_reverse.get(key)
|
state = self.__keys_reverse.get(key)
|
||||||
if state == None:
|
if state == None:
|
||||||
raise StateItemNotFound(key)
|
raise StateItemNotFound(key)
|
||||||
if not self.__is_pure(state):
|
if not self.is_pure(state):
|
||||||
raise StateInvalid('cannot run next on an alias state')
|
raise StateInvalid('cannot run next on an alias state')
|
||||||
|
|
||||||
if state == 0:
|
if state == 0:
|
||||||
@@ -622,3 +690,27 @@ class State:
|
|||||||
statemask = ~statemask
|
statemask = ~statemask
|
||||||
statemask &= self.__limit
|
statemask &= self.__limit
|
||||||
return statemask
|
return statemask
|
||||||
|
|
||||||
|
|
||||||
|
def purge(self, key):
|
||||||
|
state = self.state(key)
|
||||||
|
state_name = self.name(state)
|
||||||
|
|
||||||
|
v = self.__keys.get(state)
|
||||||
|
v.remove(key)
|
||||||
|
|
||||||
|
del self.__keys_reverse[key]
|
||||||
|
|
||||||
|
try:
|
||||||
|
del self.__contents[key]
|
||||||
|
except KeyError:
|
||||||
|
pass
|
||||||
|
|
||||||
|
try:
|
||||||
|
del self.modified_last[key]
|
||||||
|
except KeyError:
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def count(self):
|
||||||
|
return self.__c
|
||||||
|
|||||||
@@ -13,3 +13,7 @@ class StoreFactory:
|
|||||||
|
|
||||||
def close(self):
|
def close(self):
|
||||||
pass
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def ls(self):
|
||||||
|
raise NotImplementedError()
|
||||||
|
|||||||
@@ -1,12 +1,14 @@
|
|||||||
# standard imports
|
# standard imports
|
||||||
import os
|
import os
|
||||||
import re
|
import re
|
||||||
|
import stat
|
||||||
|
|
||||||
# local imports
|
# local imports
|
||||||
from .base import (
|
from .base import (
|
||||||
re_processedname,
|
re_processedname,
|
||||||
StoreFactory,
|
StoreFactory,
|
||||||
)
|
)
|
||||||
|
from shep.error import StateLockedKey
|
||||||
|
|
||||||
|
|
||||||
class SimpleFileStore:
|
class SimpleFileStore:
|
||||||
@@ -15,15 +17,42 @@ class SimpleFileStore:
|
|||||||
:param path: Filesystem base path for all state directory
|
:param path: Filesystem base path for all state directory
|
||||||
:type path: str
|
:type path: str
|
||||||
"""
|
"""
|
||||||
def __init__(self, path, binary=False):
|
def __init__(self, path, binary=False, lock_path=None):
|
||||||
self.__path = path
|
self.__path = path
|
||||||
os.makedirs(self.__path, exist_ok=True)
|
os.makedirs(self.__path, exist_ok=True)
|
||||||
if binary:
|
if binary:
|
||||||
self.__m = ['rb', 'wb']
|
self.__m = ['rb', 'wb']
|
||||||
else:
|
else:
|
||||||
self.__m = ['r', 'w']
|
self.__m = ['r', 'w']
|
||||||
|
self.__lock_path = lock_path
|
||||||
|
if self.__lock_path != None:
|
||||||
|
os.makedirs(lock_path, exist_ok=True)
|
||||||
|
|
||||||
|
|
||||||
|
def __lock(self, k):
|
||||||
|
if self.__lock_path == None:
|
||||||
|
return
|
||||||
|
fp = os.path.join(self.__lock_path, k)
|
||||||
|
f = None
|
||||||
|
try:
|
||||||
|
f = open(fp, 'x')
|
||||||
|
except FileExistsError:
|
||||||
|
pass
|
||||||
|
if f == None:
|
||||||
|
raise StateLockedKey(k)
|
||||||
|
f.close()
|
||||||
|
|
||||||
|
|
||||||
|
def __unlock(self, k):
|
||||||
|
if self.__lock_path == None:
|
||||||
|
return
|
||||||
|
fp = os.path.join(self.__lock_path, k)
|
||||||
|
try:
|
||||||
|
os.unlink(fp)
|
||||||
|
except FileNotFoundError:
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
def put(self, k, contents=None):
|
def put(self, k, contents=None):
|
||||||
"""Add a new key and optional contents
|
"""Add a new key and optional contents
|
||||||
|
|
||||||
@@ -32,6 +61,7 @@ class SimpleFileStore:
|
|||||||
:param contents: Optional contents to assign for content key
|
:param contents: Optional contents to assign for content key
|
||||||
:type contents: any
|
:type contents: any
|
||||||
"""
|
"""
|
||||||
|
self.__lock(k)
|
||||||
fp = os.path.join(self.__path, k)
|
fp = os.path.join(self.__path, k)
|
||||||
if contents == None:
|
if contents == None:
|
||||||
if self.__m[1] == 'wb':
|
if self.__m[1] == 'wb':
|
||||||
@@ -42,6 +72,7 @@ class SimpleFileStore:
|
|||||||
f = open(fp, self.__m[1])
|
f = open(fp, self.__m[1])
|
||||||
f.write(contents)
|
f.write(contents)
|
||||||
f.close()
|
f.close()
|
||||||
|
self.__unlock(k)
|
||||||
|
|
||||||
|
|
||||||
def remove(self, k):
|
def remove(self, k):
|
||||||
@@ -51,8 +82,10 @@ class SimpleFileStore:
|
|||||||
:type k: str
|
:type k: str
|
||||||
:raises FileNotFoundError: Content key does not exist in the state
|
:raises FileNotFoundError: Content key does not exist in the state
|
||||||
"""
|
"""
|
||||||
|
self.__lock(k)
|
||||||
fp = os.path.join(self.__path, k)
|
fp = os.path.join(self.__path, k)
|
||||||
os.unlink(fp)
|
os.unlink(fp)
|
||||||
|
self.__unlock(k)
|
||||||
|
|
||||||
|
|
||||||
def get(self, k):
|
def get(self, k):
|
||||||
@@ -64,10 +97,12 @@ class SimpleFileStore:
|
|||||||
:rtype: any
|
:rtype: any
|
||||||
:return: Contents
|
:return: Contents
|
||||||
"""
|
"""
|
||||||
|
self.__lock(k)
|
||||||
fp = os.path.join(self.__path, k)
|
fp = os.path.join(self.__path, k)
|
||||||
f = open(fp, self.__m[0])
|
f = open(fp, self.__m[0])
|
||||||
r = f.read()
|
r = f.read()
|
||||||
f.close()
|
f.close()
|
||||||
|
self.__unlock(k)
|
||||||
return r
|
return r
|
||||||
|
|
||||||
|
|
||||||
@@ -77,15 +112,21 @@ class SimpleFileStore:
|
|||||||
:rtype: list of str
|
:rtype: list of str
|
||||||
:return: Content keys in state
|
:return: Content keys in state
|
||||||
"""
|
"""
|
||||||
|
self.__lock('.list')
|
||||||
files = []
|
files = []
|
||||||
for p in os.listdir(self.__path):
|
for p in os.listdir(self.__path):
|
||||||
fp = os.path.join(self.__path, p)
|
fp = os.path.join(self.__path, p)
|
||||||
f = open(fp, self.__m[0])
|
f = None
|
||||||
|
try:
|
||||||
|
f = open(fp, self.__m[0])
|
||||||
|
except FileNotFoundError:
|
||||||
|
continue
|
||||||
r = f.read()
|
r = f.read()
|
||||||
f.close()
|
f.close()
|
||||||
if len(r) == 0:
|
if len(r) == 0:
|
||||||
r = None
|
r = None
|
||||||
files.append((p, r,))
|
files.append((p, r,))
|
||||||
|
self.__unlock('.list')
|
||||||
return files
|
return files
|
||||||
|
|
||||||
|
|
||||||
@@ -110,16 +151,20 @@ class SimpleFileStore:
|
|||||||
:param contents: Contents
|
:param contents: Contents
|
||||||
:type contents: any
|
:type contents: any
|
||||||
"""
|
"""
|
||||||
|
self.__lock(k)
|
||||||
fp = os.path.join(self.__path, k)
|
fp = os.path.join(self.__path, k)
|
||||||
os.stat(fp)
|
os.stat(fp)
|
||||||
f = open(fp, self.__m[1])
|
f = open(fp, self.__m[1])
|
||||||
r = f.write(contents)
|
r = f.write(contents)
|
||||||
f.close()
|
f.close()
|
||||||
|
self.__unlock(k)
|
||||||
|
|
||||||
|
|
||||||
def modified(self, k):
|
def modified(self, k):
|
||||||
|
self.__lock(k)
|
||||||
path = self.path(k)
|
path = self.path(k)
|
||||||
st = os.stat(path)
|
st = os.stat(path)
|
||||||
|
self.__unlock(k)
|
||||||
return st.st_ctime
|
return st.st_ctime
|
||||||
|
|
||||||
|
|
||||||
@@ -133,9 +178,10 @@ class SimpleFileStoreFactory(StoreFactory):
|
|||||||
:param path: Filesystem path as base path for states
|
:param path: Filesystem path as base path for states
|
||||||
:type path: str
|
:type path: str
|
||||||
"""
|
"""
|
||||||
def __init__(self, path, binary=False):
|
def __init__(self, path, binary=False, use_lock=False):
|
||||||
self.__path = path
|
self.__path = path
|
||||||
self.__binary = binary
|
self.__binary = binary
|
||||||
|
self.__use_lock = use_lock
|
||||||
|
|
||||||
|
|
||||||
def add(self, k):
|
def add(self, k):
|
||||||
@@ -146,18 +192,39 @@ class SimpleFileStoreFactory(StoreFactory):
|
|||||||
:rtype: SimpleFileStore
|
:rtype: SimpleFileStore
|
||||||
:return: A filesystem persistence instance with the given identifier as subdirectory
|
:return: A filesystem persistence instance with the given identifier as subdirectory
|
||||||
"""
|
"""
|
||||||
|
lock_path = None
|
||||||
|
if self.__use_lock:
|
||||||
|
lock_path = os.path.join(self.__path, '.lock')
|
||||||
|
|
||||||
k = str(k)
|
k = str(k)
|
||||||
store_path = os.path.join(self.__path, k)
|
store_path = os.path.join(self.__path, k)
|
||||||
return SimpleFileStore(store_path, binary=self.__binary)
|
return SimpleFileStore(store_path, binary=self.__binary, lock_path=lock_path)
|
||||||
|
|
||||||
|
|
||||||
def ls(self):
|
def ls(self):
|
||||||
r = []
|
r = []
|
||||||
for v in os.listdir(self.__path):
|
for v in os.listdir(self.__path):
|
||||||
if re.match(re_processedname, v):
|
if re.match(re_processedname, v):
|
||||||
r.append(v)
|
fp = os.path.join(self.__path, v)
|
||||||
|
st = os.stat(fp)
|
||||||
|
if stat.S_ISDIR(st.st_mode):
|
||||||
|
r.append(v)
|
||||||
return r
|
return r
|
||||||
|
|
||||||
|
|
||||||
|
def have(self, k):
|
||||||
|
lock_path = None
|
||||||
|
if self.__use_lock:
|
||||||
|
lock_path = os.path.join(self.__path, '.lock')
|
||||||
|
for d in self.ls():
|
||||||
|
p = os.path.join(self.__path, d)
|
||||||
|
s = SimpleFileStore(p, binary=self.__binary, lock_path=lock_path)
|
||||||
|
try:
|
||||||
|
s.get(k)
|
||||||
|
except:
|
||||||
|
return False
|
||||||
|
return True
|
||||||
|
|
||||||
|
|
||||||
def close(self):
|
def close(self):
|
||||||
pass
|
pass
|
||||||
|
|||||||
44
shep/store/noop.py
Normal file
44
shep/store/noop.py
Normal file
@@ -0,0 +1,44 @@
|
|||||||
|
# local imports
|
||||||
|
from .base import StoreFactory
|
||||||
|
|
||||||
|
|
||||||
|
class NoopStore:
|
||||||
|
|
||||||
|
def put(self, k, contents=None):
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def remove(self, k):
|
||||||
|
pass
|
||||||
|
|
||||||
|
def get(self, k):
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def list(self):
|
||||||
|
return []
|
||||||
|
|
||||||
|
|
||||||
|
def path(self):
|
||||||
|
return None
|
||||||
|
|
||||||
|
|
||||||
|
def replace(self, k, contents):
|
||||||
|
pass
|
||||||
|
|
||||||
|
def modified(self, k):
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
def register_modify(self, k):
|
||||||
|
pass
|
||||||
|
|
||||||
|
|
||||||
|
class NoopStoreFactory(StoreFactory):
|
||||||
|
|
||||||
|
def add(self, k):
|
||||||
|
return NoopStore()
|
||||||
|
|
||||||
|
|
||||||
|
def ls(self):
|
||||||
|
return []
|
||||||
@@ -11,6 +11,7 @@ from shep.error import (
|
|||||||
StateExists,
|
StateExists,
|
||||||
StateInvalid,
|
StateInvalid,
|
||||||
StateItemExists,
|
StateItemExists,
|
||||||
|
StateLockedKey,
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
@@ -243,18 +244,68 @@ class TestFileStore(unittest.TestCase):
|
|||||||
|
|
||||||
|
|
||||||
def test_factory_ls(self):
|
def test_factory_ls(self):
|
||||||
|
r = self.factory.ls()
|
||||||
|
self.assertEqual(len(r), 4)
|
||||||
|
|
||||||
self.states.put('abcd')
|
self.states.put('abcd')
|
||||||
self.states.put('xxxx', state=self.states.BAZ)
|
self.states.put('xxxx', state=self.states.BAZ)
|
||||||
r = self.factory.ls()
|
r = self.factory.ls()
|
||||||
self.assertEqual(len(r), 2)
|
self.assertEqual(len(r), 4)
|
||||||
|
|
||||||
self.states.put('yyyy', state=self.states.BAZ)
|
self.states.put('yyyy', state=self.states.BAZ)
|
||||||
r = self.factory.ls()
|
r = self.factory.ls()
|
||||||
self.assertEqual(len(r), 2)
|
self.assertEqual(len(r), 4)
|
||||||
|
|
||||||
self.states.put('zzzz', state=self.states.BAR)
|
self.states.put('zzzz', state=self.states.BAR)
|
||||||
r = self.factory.ls()
|
r = self.factory.ls()
|
||||||
self.assertEqual(len(r), 3)
|
self.assertEqual(len(r), 4)
|
||||||
|
|
||||||
|
|
||||||
|
def test_lock(self):
|
||||||
|
factory = SimpleFileStoreFactory(self.d, use_lock=True)
|
||||||
|
states = PersistedState(factory.add, 3)
|
||||||
|
states.add('foo')
|
||||||
|
states.add('bar')
|
||||||
|
states.add('baz')
|
||||||
|
states.alias('xyzzy', states.FOO | states.BAR)
|
||||||
|
states.alias('plugh', states.FOO | states.BAR | states.BAZ)
|
||||||
|
states.put('abcd')
|
||||||
|
|
||||||
|
lock_path = os.path.join(self.d, '.lock')
|
||||||
|
os.stat(lock_path)
|
||||||
|
|
||||||
|
fp = os.path.join(self.d, '.lock', 'xxxx')
|
||||||
|
f = open(fp, 'w')
|
||||||
|
f.close()
|
||||||
|
|
||||||
|
with self.assertRaises(StateLockedKey):
|
||||||
|
states.put('xxxx')
|
||||||
|
|
||||||
|
os.unlink(fp)
|
||||||
|
states.put('xxxx')
|
||||||
|
|
||||||
|
states.set('xxxx', states.FOO)
|
||||||
|
states.set('xxxx', states.BAR)
|
||||||
|
states.replace('xxxx', contents='zzzz')
|
||||||
|
|
||||||
|
fp = os.path.join(self.d, '.lock', 'xxxx')
|
||||||
|
f = open(fp, 'w')
|
||||||
|
f.close()
|
||||||
|
|
||||||
|
with self.assertRaises(StateLockedKey):
|
||||||
|
states.set('xxxx', states.BAZ)
|
||||||
|
|
||||||
|
v = states.state('xxxx')
|
||||||
|
self.assertEqual(v, states.XYZZY)
|
||||||
|
|
||||||
|
with self.assertRaises(StateLockedKey):
|
||||||
|
states.unset('xxxx', states.FOO)
|
||||||
|
|
||||||
|
with self.assertRaises(StateLockedKey):
|
||||||
|
states.replace('xxxx', contents='yyyy')
|
||||||
|
|
||||||
|
v = states.get('xxxx')
|
||||||
|
self.assertEqual(v, 'zzzz')
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
if __name__ == '__main__':
|
||||||
|
|||||||
78
tests/test_noop.py
Normal file
78
tests/test_noop.py
Normal file
@@ -0,0 +1,78 @@
|
|||||||
|
# standard imports
|
||||||
|
import unittest
|
||||||
|
import os
|
||||||
|
import logging
|
||||||
|
import sys
|
||||||
|
import importlib
|
||||||
|
import tempfile
|
||||||
|
|
||||||
|
# local imports
|
||||||
|
from shep.persist import PersistedState
|
||||||
|
from shep.store.noop import NoopStoreFactory
|
||||||
|
from shep.error import (
|
||||||
|
StateExists,
|
||||||
|
StateInvalid,
|
||||||
|
StateItemExists,
|
||||||
|
StateItemNotFound,
|
||||||
|
)
|
||||||
|
|
||||||
|
logging.basicConfig(level=logging.DEBUG)
|
||||||
|
logg = logging.getLogger()
|
||||||
|
|
||||||
|
|
||||||
|
class TestNoopStore(unittest.TestCase):
|
||||||
|
|
||||||
|
def setUp(self):
|
||||||
|
self.factory = NoopStoreFactory()
|
||||||
|
self.states = PersistedState(self.factory.add, 3)
|
||||||
|
self.states.add('foo')
|
||||||
|
self.states.add('bar')
|
||||||
|
self.states.add('baz')
|
||||||
|
|
||||||
|
|
||||||
|
def test_add(self):
|
||||||
|
self.states.put('abcd', state=self.states.FOO, contents='baz')
|
||||||
|
v = self.states.get('abcd')
|
||||||
|
self.assertEqual(v, 'baz')
|
||||||
|
v = self.states.state('abcd')
|
||||||
|
self.assertEqual(v, self.states.FOO)
|
||||||
|
|
||||||
|
|
||||||
|
def test_next(self):
|
||||||
|
self.states.put('abcd')
|
||||||
|
|
||||||
|
self.states.next('abcd')
|
||||||
|
self.assertEqual(self.states.state('abcd'), self.states.FOO)
|
||||||
|
|
||||||
|
self.states.next('abcd')
|
||||||
|
self.assertEqual(self.states.state('abcd'), self.states.BAR)
|
||||||
|
|
||||||
|
self.states.next('abcd')
|
||||||
|
self.assertEqual(self.states.state('abcd'), self.states.BAZ)
|
||||||
|
|
||||||
|
with self.assertRaises(StateInvalid):
|
||||||
|
self.states.next('abcd')
|
||||||
|
|
||||||
|
v = self.states.state('abcd')
|
||||||
|
self.assertEqual(v, self.states.BAZ)
|
||||||
|
|
||||||
|
|
||||||
|
def test_replace(self):
|
||||||
|
with self.assertRaises(StateItemNotFound):
|
||||||
|
self.states.replace('abcd', contents='foo')
|
||||||
|
|
||||||
|
self.states.put('abcd', state=self.states.FOO, contents='baz')
|
||||||
|
self.states.replace('abcd', contents='bar')
|
||||||
|
v = self.states.get('abcd')
|
||||||
|
self.assertEqual(v, 'bar')
|
||||||
|
|
||||||
|
|
||||||
|
def test_factory_ls(self):
|
||||||
|
self.states.put('abcd')
|
||||||
|
self.states.put('xxxx', state=self.states.BAZ)
|
||||||
|
r = self.factory.ls()
|
||||||
|
self.assertEqual(len(r), 0)
|
||||||
|
|
||||||
|
|
||||||
|
if __name__ == '__main__':
|
||||||
|
unittest.main()
|
||||||
@@ -7,6 +7,7 @@ from shep import State
|
|||||||
from shep.error import (
|
from shep.error import (
|
||||||
StateExists,
|
StateExists,
|
||||||
StateInvalid,
|
StateInvalid,
|
||||||
|
StateItemNotFound,
|
||||||
)
|
)
|
||||||
|
|
||||||
logging.basicConfig(level=logging.DEBUG)
|
logging.basicConfig(level=logging.DEBUG)
|
||||||
@@ -123,7 +124,7 @@ class TestState(unittest.TestCase):
|
|||||||
states.set('abcd', states.BAZ)
|
states.set('abcd', states.BAZ)
|
||||||
v = states.state('abcd')
|
v = states.state('abcd')
|
||||||
s = states.name(v)
|
s = states.name(v)
|
||||||
self.assertEqual(s, '_FOO.BAZ')
|
self.assertEqual(s, '_FOO__BAZ')
|
||||||
|
|
||||||
|
|
||||||
def test_peek(self):
|
def test_peek(self):
|
||||||
@@ -250,5 +251,109 @@ class TestState(unittest.TestCase):
|
|||||||
self.assertEqual(mask, states.ALL)
|
self.assertEqual(mask, states.ALL)
|
||||||
|
|
||||||
|
|
||||||
|
def test_remove(self):
|
||||||
|
states = State(1)
|
||||||
|
states.add('foo')
|
||||||
|
|
||||||
|
states.put('xyzzy', contents='plugh')
|
||||||
|
v = states.get('xyzzy')
|
||||||
|
self.assertEqual(v, 'plugh')
|
||||||
|
|
||||||
|
states.next('xyzzy')
|
||||||
|
|
||||||
|
v = states.state('xyzzy')
|
||||||
|
self.assertEqual(states.FOO, v)
|
||||||
|
|
||||||
|
states.purge('xyzzy')
|
||||||
|
|
||||||
|
with self.assertRaises(StateItemNotFound):
|
||||||
|
states.state('xyzzy')
|
||||||
|
|
||||||
|
|
||||||
|
def test_elements(self):
|
||||||
|
states = State(2)
|
||||||
|
states.add('foo')
|
||||||
|
states.add('bar')
|
||||||
|
states.alias('baz', states.FOO, states.BAR)
|
||||||
|
|
||||||
|
v = states.elements(states.BAZ)
|
||||||
|
self.assertIn('FOO', v)
|
||||||
|
self.assertIn('BAR', v)
|
||||||
|
self.assertIsInstance(v, str)
|
||||||
|
|
||||||
|
v = states.elements(states.BAZ, numeric=True)
|
||||||
|
self.assertIn(states.FOO, v)
|
||||||
|
self.assertIn(states.BAR, v)
|
||||||
|
|
||||||
|
v = states.elements(states.BAZ, as_string=False)
|
||||||
|
self.assertIn('FOO', v)
|
||||||
|
self.assertIn('BAR', v)
|
||||||
|
self.assertNotIsInstance(v, str)
|
||||||
|
self.assertIsInstance(v, list)
|
||||||
|
|
||||||
|
|
||||||
|
def test_count(self):
|
||||||
|
states = State(3)
|
||||||
|
states.add('foo')
|
||||||
|
states.add('bar')
|
||||||
|
self.assertEqual(states.count(), 2)
|
||||||
|
states.add('baz')
|
||||||
|
self.assertEqual(states.count(), 3)
|
||||||
|
|
||||||
|
|
||||||
|
def test_pure(self):
|
||||||
|
states = State(2)
|
||||||
|
states.add('foo')
|
||||||
|
states.add('bar')
|
||||||
|
states.alias('baz', states.FOO, states.BAR)
|
||||||
|
|
||||||
|
v = states.is_pure(states.BAZ)
|
||||||
|
self.assertFalse(v)
|
||||||
|
|
||||||
|
v = states.is_pure(states.FOO)
|
||||||
|
self.assertTrue(v)
|
||||||
|
|
||||||
|
|
||||||
|
def test_default(self):
|
||||||
|
states = State(2, default_state='FOO')
|
||||||
|
with self.assertRaises(StateItemNotFound):
|
||||||
|
states.state('NEW')
|
||||||
|
r = getattr(states, 'FOO')
|
||||||
|
self.assertEqual(r, 0)
|
||||||
|
states.state('FOO')
|
||||||
|
states.put('bar')
|
||||||
|
r = states.list(states.FOO)
|
||||||
|
self.assertEqual(len(r), 1)
|
||||||
|
|
||||||
|
|
||||||
|
def test_unset(self):
|
||||||
|
states = State(2)
|
||||||
|
states.add('one')
|
||||||
|
states.add('two')
|
||||||
|
states.alias('three', states.ONE, states.TWO)
|
||||||
|
states.put('foo', state=states.ONE)
|
||||||
|
states.set('foo', states.TWO)
|
||||||
|
r = states.list(states.ONE)
|
||||||
|
self.assertEqual(len(r), 1)
|
||||||
|
r = states.list(states.TWO)
|
||||||
|
self.assertEqual(len(r), 1)
|
||||||
|
r = states.unset('foo', states.ONE)
|
||||||
|
r = states.list(states.ONE)
|
||||||
|
self.assertEqual(len(r), 0)
|
||||||
|
r = states.list(states.TWO)
|
||||||
|
self.assertEqual(len(r), 1)
|
||||||
|
|
||||||
|
|
||||||
|
def test_move(self):
|
||||||
|
states = State(1)
|
||||||
|
states.add('one')
|
||||||
|
states.put('foo')
|
||||||
|
r = states.list(states.NEW)
|
||||||
|
self.assertEqual(len(r), 1)
|
||||||
|
states.move('foo', states.ONE)
|
||||||
|
r = states.list(states.NEW)
|
||||||
|
self.assertEqual(len(r), 0)
|
||||||
|
|
||||||
|
|
||||||
if __name__ == '__main__':
|
if __name__ == '__main__':
|
||||||
unittest.main()
|
unittest.main()
|
||||||
|
|||||||
@@ -43,7 +43,7 @@ class TestStateItems(unittest.TestCase):
|
|||||||
self.mockstore = MockStore()
|
self.mockstore = MockStore()
|
||||||
|
|
||||||
def mockstore_factory(v):
|
def mockstore_factory(v):
|
||||||
self.mockstore.for_state = v
|
#self.mockstore.for_state = v
|
||||||
return self.mockstore
|
return self.mockstore
|
||||||
|
|
||||||
self.states = PersistedState(mockstore_factory, 4)
|
self.states = PersistedState(mockstore_factory, 4)
|
||||||
@@ -71,7 +71,7 @@ class TestStateItems(unittest.TestCase):
|
|||||||
item = b'foo'
|
item = b'foo'
|
||||||
self.states.put(item, self.states.FOO, True)
|
self.states.put(item, self.states.FOO, True)
|
||||||
self.states.move(item, self.states.XYZZY)
|
self.states.move(item, self.states.XYZZY)
|
||||||
self.assertEqual(self.mockstore.for_state, self.states.name(self.states.XYZZY))
|
#self.assertEqual(self.mockstore.for_state, self.states.name(self.states.XYZZY))
|
||||||
# TODO: cant check the add because remove happens after remove, need better mock
|
# TODO: cant check the add because remove happens after remove, need better mock
|
||||||
self.assertIsNone(self.mockstore.v.get(item))
|
self.assertIsNone(self.mockstore.v.get(item))
|
||||||
|
|
||||||
@@ -80,7 +80,7 @@ class TestStateItems(unittest.TestCase):
|
|||||||
item = b'foo'
|
item = b'foo'
|
||||||
self.states.put(item)
|
self.states.put(item)
|
||||||
self.states.move(item, self.states.BAZ)
|
self.states.move(item, self.states.BAZ)
|
||||||
self.assertEqual(self.mockstore.for_state, self.states.name(self.states.BAZ))
|
#self.assertEqual(self.mockstore.for_state, self.states.name(self.states.BAZ))
|
||||||
self.assertIsNone(self.mockstore.v.get(item))
|
self.assertIsNone(self.mockstore.v.get(item))
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
@@ -8,7 +8,7 @@ from shep.error import (
|
|||||||
)
|
)
|
||||||
|
|
||||||
|
|
||||||
def mock_verify(state, from_state, to_state):
|
def mock_verify(state, key, from_state, to_state):
|
||||||
if from_state == state.FOO:
|
if from_state == state.FOO:
|
||||||
if to_state == state.BAR:
|
if to_state == state.BAR:
|
||||||
return 'bar cannot follow foo'
|
return 'bar cannot follow foo'
|
||||||
|
|||||||
Reference in New Issue
Block a user