pygambit 16.3.0__tar.gz → 16.3.2__tar.gz

{pygambit-16.3.0/src/pygambit.egg-info → pygambit-16.3.2}/PKG-INFO

@@ -1,6 +1,6 @@
-Metadata-Version: 2.1
+Metadata-Version: 2.4
 Name: pygambit
-Version: 16.3.0
+Version: 16.3.2
 Summary: The package for computation in game theory
 Home-page: https://www.gambit-project.org
 Author: Theodore Turocy
@@ -22,6 +22,21 @@ Classifier: Topic :: Scientific/Engineering :: Mathematics
 Requires-Python: >=3.9
 License-File: COPYING
 License-File: AUTHORS
+Requires-Dist: numpy
+Requires-Dist: scipy
+Requires-Dist: deprecated
+Dynamic: author
+Dynamic: author-email
+Dynamic: classifier
+Dynamic: description
+Dynamic: home-page
+Dynamic: keywords
+Dynamic: license
+Dynamic: license-file
+Dynamic: project-url
+Dynamic: requires-dist
+Dynamic: requires-python
+Dynamic: summary
 
 Gambit is a package for representing, manuipulating, and analysing
 finite noncooperative games in extensive and normal form.

{pygambit-16.3.0 → pygambit-16.3.2}/setup.py

@@ -107,7 +107,7 @@ def readme():
 
 setuptools.setup(
     name="pygambit",
-    version="16.3.0",
+    version="16.3.2",
     description="The package for computation in game theory",
     long_description=readme(),
     classifiers=[

{pygambit-16.3.0 → pygambit-16.3.2}/src/games/game.cc

@@ -447,10 +447,8 @@ template <class T> Vector<T> MixedStrategyProfile<T>::operator[](const GamePlaye
   CheckVersion();
   auto strategies = m_rep->m_support.GetStrategies(p_player);
   Vector<T> probs(strategies.size());
-  int st = 1;
-  for (auto strategy : strategies) {
-    probs[st] = (*this)[strategy];
-  }
+  std::transform(strategies.begin(), strategies.end(), probs.begin(),
+                 [this](const GameStrategy &s) { return (*m_rep)[s]; });
   return probs;
 }
 

{pygambit-16.3.0 → pygambit-16.3.2}/src/games/gametree.cc

@@ -139,7 +139,6 @@ void GameTreeActionRep::DeleteAction()
     member->children[where]->Invalidate();
     erase_atindex(member->children, where);
   }
-
   if (m_infoset->IsChanceInfoset()) {
     m_infoset->m_efg->NormalizeChanceProbs(m_infoset);
   }
@@ -277,11 +276,11 @@ void GameTreeInfosetRep::RemoveMember(GameTreeNodeRep *p_node)
   if (m_members.empty()) {
     m_player->m_infosets.erase(
         std::find(m_player->m_infosets.begin(), m_player->m_infosets.end(), this));
-    Invalidate();
     int iset = 1;
     for (auto &infoset : m_player->m_infosets) {
       infoset->m_number = iset++;
     }
+    Invalidate();
   }
 }
 

{pygambit-16.3.0 → pygambit-16.3.2}/src/pygambit/__init__.py

@@ -28,4 +28,4 @@ from . import (  # noqa: F401
     supports,  # noqa: F401
 )
 
-__version__ = "16.3.0"
+__version__ = "16.3.2"