pyactup 2.2.3__tar.gz → 2.2.4__tar.gz

{pyactup-2.2.3 → pyactup-2.2.4}/PKG-INFO

@@ -1,10 +1,11 @@
 Metadata-Version: 2.1
 Name: pyactup
-Version: 2.2.3
+Version: 2.2.4
 Summary: A lightweight Python implementation of a subset of the ACT-R cognitive architecture’s Declarative Memory
 Home-page: https://dfmorrison.github.io/pyactup-documentation/
 Author: Don Morrison
 Author-email: dfm2@cmu.edu
+License: UNKNOWN
 Platform: any
 Classifier: Intended Audience :: Science/Research
 Classifier: License :: OSI Approved :: MIT License
@@ -55,3 +56,5 @@ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIG
 HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
 OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+

{pyactup-2.2.3 → pyactup-2.2.4}/pyactup.egg-info/PKG-INFO

@@ -1,10 +1,11 @@
 Metadata-Version: 2.1
 Name: pyactup
-Version: 2.2.3
+Version: 2.2.4
 Summary: A lightweight Python implementation of a subset of the ACT-R cognitive architecture’s Declarative Memory
 Home-page: https://dfmorrison.github.io/pyactup-documentation/
 Author: Don Morrison
 Author-email: dfm2@cmu.edu
+License: UNKNOWN
 Platform: any
 Classifier: Intended Audience :: Science/Research
 Classifier: License :: OSI Approved :: MIT License
@@ -55,3 +56,5 @@ PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIG
 HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE
 OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+

{pyactup-2.2.3 → pyactup-2.2.4}/pyactup.py

@@ -37,7 +37,7 @@ may be strictly algorithmic, may interact with human subjects, or may be embedde
 sites.
 """
 
-__version__ = "2.2.3"
+__version__ = "2.2.4"
 
 if "dev" in __version__:
     print("PyACTUp version", __version__)
@@ -901,7 +901,7 @@ class Memory(dict):
                 chunk._references.resize(REFERENCES_FACTOR * chunk._references.size,
                                          refcheck=False)
             chunk._references[chunk._reference_count] = self._time
-        elif  chunk._reference_count < self._optimized_learning:
+        elif chunk._reference_count < self._optimized_learning:
             if chunk._reference_count >= chunk._references.size:
                 chunk._references.resize(min(REFERENCES_FACTOR * chunk._references.size,
                                              self._optimized_learning),
@@ -1413,7 +1413,7 @@ class Memory(dict):
         If only one or two of *function*, *weight* and *derivatve* are supplied, they
         changed without changing those not supplied; the initial defaults are ``True`` for
         *function*, ``1`` for *weight*, and ``None`` for *derivative*. If none
-        of*function*, *weight* nor *derivative* are supplied all are removed, and these
+        of *function*, *weight* nor *derivative* are supplied all are removed, and these
         *attributes* will no longer have an associated similarity computation, and will be
         matched only exactly.
 
@@ -1478,7 +1478,8 @@ class Chunk(dict):
         self.update(content)
         self._creation = memory._time
         self._references = np.empty(1 if self._memory._optimized_learning != 0 else 0,
-                                    dtype=np.int32)
+                                    # dtype=np.int32)
+                                    dtype=np.float64)
         self._reference_count = 0
 
     def __repr__(self):