seqbuild 0.0.74__tar.gz → 0.0.76__tar.gz

{seqbuild-0.0.74/seqbuild.egg-info → seqbuild-0.0.76}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: seqbuild
-Version: 0.0.74
+Version: 0.0.76
 Summary: A collection of algorithms for pseudo-random number generation.
 Home-page: https://github.com/Changissnz/seqbuild
 Author: Richard Pham

{seqbuild-0.0.74 → seqbuild-0.0.76}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "seqbuild"
-version = "0.0.74"
+version = "0.0.76"
 dependencies = [
 "numpy>=1.22.1",
 "matplotlib>=3.5.3",

seqbuild-0.0.76/seqbuild/intigers/mod_prng.py

@@ -0,0 +1,88 @@
+from types import MethodType,FunctionType
+from numpy import add,ufunc,array 
+from copy import deepcopy
+
+"""
+outputs a function for every `next` call, according to 
+the counter `i` modulated by |prngs|. 
+"""
+class ModPRNGOutputter:
+
+    def __init__(self,prngs):
+        for x in prngs: 
+            assert type(x) in {FunctionType,MethodType}, "got {},{}".format(x,type(x))
+        
+        self.prngs = prngs
+        self.i = 0
+
+    def __next__(self):
+        if self.i >= len(self.prngs):
+            self.i = self.i % len(self.prngs)
+        q = self.prngs[self.i]
+        self.i += 1
+        return q 
+
+class BasicIterableContainer:
+
+    def __init__(self,L,cycle_on:bool=True):
+        assert type(L) == list
+        assert len(L) > 0 
+        self.l = L
+        self.cycle_on = cycle_on
+        self.i = 0 
+
+    def __next__(self):
+        if self.i >= len(self.l): 
+            return None
+
+        q = self.l[self.i] 
+        self.i = self.i + 1
+        
+        if self.cycle_on: 
+            self.i = self.i % len(self.l)
+        return q 
+
+"""
+Extension of class<BasicIterableContainer>. After every full iteration 
+of `l`, the base vector, updates `l` to 
+`l` := f(`l`,v). 
+"""
+class NoiseAddedIterableContainer(BasicIterableContainer): 
+
+    def __init__(self,L,v,f=add,op_first:bool=True):
+        super().__init__(L,cycle_on=True)
+        assert type(f) in {FunctionType,MethodType,ufunc}
+        assert type(op_first) == bool
+
+        self.l = array(L)
+        self.l_ = deepcopy(self.l)
+        self.v = v 
+        self.f = f  
+
+        self.started = False 
+        if op_first: self.started = True 
+        return 
+
+    def __next__(self): 
+        if self.started and self.i == 0: 
+            self.l = self.f(self.l,self.v)
+
+        self.started = True 
+        return super().__next__() 
+
+    def reset(self,reset_index:bool=True,v=None): 
+        assert type(reset_index) == bool 
+        if reset_index:
+            self.l = deepcopy(self.l_)
+            self.i = 0 
+
+        if type(v) != type(None):
+            self.v = v 
+        
+        if not reset_index and type(v) != type(None):
+            self.l = self.f(self.l,self.v)
+
+
+def prg__iterable(L,cycle_on:bool=True):
+    bic = BasicIterableContainer(L,cycle_on)
+    return bic.__next__ 

{seqbuild-0.0.74 → seqbuild-0.0.76/seqbuild.egg-info}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: seqbuild
-Version: 0.0.74
+Version: 0.0.76
 Summary: A collection of algorithms for pseudo-random number generation.
 Home-page: https://github.com/Changissnz/seqbuild
 Author: Richard Pham

{seqbuild-0.0.74 → seqbuild-0.0.76}/setup.py

@@ -5,7 +5,7 @@ with open('README.md') as f:
 
 setup(
     name='seqbuild',
-    version='0.0.74',
+    version='0.0.76',
     description='A collection of algorithms for pseudo-random number generation.',
     long_description=readme,
     author='Richard Pham',

seqbuild-0.0.74/seqbuild/intigers/mod_prng.py

@@ -1,45 +0,0 @@
-from types import MethodType,FunctionType
-
-"""
-outputs a function for every `next` call, according to 
-the counter `i` modulated by |prngs|. 
-"""
-class ModPRNGOutputter:
-
-    def __init__(self,prngs):
-        for x in prngs: 
-            assert type(x) in {FunctionType,MethodType}, "got {},{}".format(x,type(x))
-        
-        self.prngs = prngs
-        self.i = 0
-
-    def __next__(self):
-        if self.i >= len(self.prngs):
-            self.i = self.i % len(self.prngs)
-        q = self.prngs[self.i]
-        self.i += 1
-        return q 
-
-class BasicIterableContainer:
-
-    def __init__(self,L,cycle_on:bool=True):
-        assert type(L) == list
-        assert len(L) > 0 
-        self.l = L
-        self.cycle_on = cycle_on
-        self.i = 0 
-
-    def __next__(self):
-        if self.i >= len(self.l): 
-            return None
-
-        q = self.l[self.i] 
-        self.i = self.i + 1
-        
-        if self.cycle_on: 
-            self.i = self.i % len(self.l)
-        return q 
-
-def prg__iterable(L,cycle_on:bool=True):
-    bic = BasicIterableContainer(L,cycle_on)
-    return bic.__next__