gr-libs 0.1.7.post0__py3-none-any.whl → 0.2.2__py3-none-any.whl

gr_libs/ml/neural/utils/__init__.py

@@ -1,2 +1 @@
-from gr_libs.ml.neural.utils.dictlist import DictList
-from gr_libs.ml.neural.utils.penv import ParallelEnv
+""" utility functions for GR algorithms that use neural networks """

gr_libs/ml/neural/utils/dictlist.py

@@ -22,12 +22,12 @@ class DictList(dict):
     def __setitem__(self, index, d):
         for key, value in d.items():
             dict.__getitem__(self, key)[index] = value
-            
+
     def __reduce__(self):
         # Custom serialization method for dill
         return (DictList, (dict(self),))  # Serialize as (DictList, (dict(self),))
 
     def __setstate__(self, state):
         # Custom deserialization method for dill
-        data, = state
-        self.update(data)
+        (data,) = state
+        self.update(data)

gr_libs/ml/planner/mcts/{utils → _utils}/__init__.py

@@ -1,2 +1,2 @@
 from .node import Node
-from .tree import Tree
+from .tree import Tree

gr_libs/ml/planner/mcts/{utils → _utils}/node.py

@@ -1,8 +1,11 @@
 import random
 
+
 class Node:
 
-    def __init__(self, identifier, state, action, action_space, reward, terminal, pos, depth):
+    def __init__(
+        self, identifier, state, action, action_space, reward, terminal, pos, depth
+    ):
         self.identifier = identifier
         self.parent_identifier = None
         self.children_identifiers = []
@@ -21,13 +24,14 @@ class Node:
 
     def __str__(self):
         return "{}: (action={}, visits={}, reward={:d}, ratio={:0.4f})".format(
-                                                  self.state,
-                                                  self.action,
-                                                  self.num_visits,
-                                                  int(self.total_simulation_reward),
-                                                  self.performance)
+            self.state,
+            self.action,
+            self.num_visits,
+            int(self.total_simulation_reward),
+            self.performance,
+        )
 
     def untried_action(self):
         action = random.choice(self.untried_actions)
         self.untried_actions.remove(action)
-        return action
+        return action

gr_libs/ml/planner/mcts/{utils → _utils}/tree.py

@@ -1,22 +1,24 @@
 def vertical_lines(last_node_flags):
     vertical_lines = []
-    vertical_line = '\u2502'
+    vertical_line = "\u2502"
     for last_node_flag in last_node_flags[0:-1]:
         if last_node_flag == False:
-            vertical_lines.append(vertical_line + ' ' * 3)
+            vertical_lines.append(vertical_line + " " * 3)
         else:
             # space between vertical lines
-            vertical_lines.append(' ' * 4)
-    return ''.join(vertical_lines)
+            vertical_lines.append(" " * 4)
+    return "".join(vertical_lines)
+
 
 def horizontal_line(last_node_flags):
-    horizontal_line = '\u251c\u2500\u2500 '
-    horizontal_line_end = '\u2514\u2500\u2500 '
+    horizontal_line = "\u251c\u2500\u2500 "
+    horizontal_line_end = "\u2514\u2500\u2500 "
     if last_node_flags[-1]:
         return horizontal_line_end
     else:
         return horizontal_line
 
+
 class Tree:
 
     def __init__(self):
@@ -39,7 +41,9 @@ class Tree:
         if depth == 0:
             yield "", node
         else:
-            yield vertical_lines(last_node_flags) + horizontal_line(last_node_flags), node
+            yield vertical_lines(last_node_flags) + horizontal_line(
+                last_node_flags
+            ), node
 
         children = [self.nodes[identifier] for identifier in node.children_identifiers]
         last_index = len(children) - 1
@@ -60,7 +64,7 @@ class Tree:
             self.nodes[node.identifier].parent = None
         else:
             self.nodes[parent.identifier].children_identifiers.append(node.identifier)
-            self.nodes[node.identifier].parent_identifier=parent.identifier
+            self.nodes[node.identifier].parent_identifier = parent.identifier
 
     def update_id(self, old_id, new_id):
         assert new_id not in self.nodes.keys()
@@ -78,7 +82,7 @@ class Tree:
         # update the node's children (if there are any?...)
         for child_id in node.children_identifiers:
             self.nodes[child_id].parent_identifier = new_id
-        
+
         self.nodes.pop(old_id)
         self.nodes.update({node.identifier: node})
 
@@ -98,5 +102,5 @@ class Tree:
     def show(self):
         lines = ""
         for edge, node in self.iter(identifier=None, depth=0, last_node_flags=[]):
-            lines += "{}{}\n".format(edge, node)
-        print(lines)
+            lines += f"{edge}{node}\n"
+        print(lines)