pgvm 0.1.0__py3-none-any.whl

pgvm/__init__.py

@@ -0,0 +1,5 @@
+from .editable_graph import EditableGraph
+
+__all__=[
+  EditableGraph,
+]

pgvm/editable_graph.py

@@ -0,0 +1,303 @@
+import graphviz
+
+class EditableGraph():
+  """
+  @Summ: 編集可能なgraph構造を与えるclass.
+
+  @Desc:
+  - node番号は非負整数である。負の値はerror用。
+  """
+  ROOT_NODE=0
+  NEW_NODE=1
+  DELETE_NODE=2
+  NEW_EDGE_LABEL="new"
+  DELETE_EDGE_LABEL="delete"
+  PATH_DELIMITER="/"
+
+
+  @classmethod
+  def __initializeGraph(cls):
+    """
+    @Summ: 初期状態のgraphを出力する関数。
+    """
+    initGraph={cls.ROOT_NODE:{"new":cls.NEW_NODE, "delete":cls.DELETE_NODE},
+               cls.NEW_NODE:{},
+               cls.DELETE_NODE:{}           
+    }
+    return initGraph
+
+
+  def __init__(self,data,connectingNode:int,program:list=None):
+    """
+    @Summ: constructor.
+
+    @InsVars:
+      data:
+        @Summ: {node番号(int):{edgeLabel(str):node番号(int)}}。
+        @Type: Dict
+      maxNodeIdx:
+        @Summ: node番号の最大値を記録する。
+        @Type: Int
+      program:
+        @Summ: programのdataを入れる。
+        @Type: Str型二次元配列。
+      programCounter:
+        @Summ: 次に実行するprogramの行番号を記録する。
+        @Desc: 例外messageを出すために必要。
+        @Type: Int
+      programLength:
+        @Summ: 次に実行するprogramの行数を記録する。
+        @Type: Int
+    """
+    initGraph=self.__initializeGraph()
+    initGraph[self.ROOT_NODE]["file"]=connectingNode
+    initGraph|=data
+    self.data=initGraph
+    self.maxNodeIdx=None
+    self.program=program
+    self.programCounter=0
+    if(program is None):
+      self.programLength=0
+    else:
+      self.proramLength=len(program)
+
+  def loadProgramCSV(self,csvFile):
+    """
+    @Summ: programが書かれたCSV fileをloadする関数。
+
+    @Args:
+      csvFile:
+        @Summ: programが書かれたcsv file名。
+        @SemType: str型の二次元配列。
+    """
+    with open(csvFile,mode="r",encoding="utf-8") as f:
+      lineList=f.readlines()
+    programData=[]
+    for line in lineList:
+      if(line[-1]=="\n"):
+        notBreakLine=line[:-1]
+      else:
+        notBreakLine=line
+      argList=notBreakLine.split(",")
+      programData.append(argList)
+    self.program=programData
+    self.programLength=len(programData)
+
+  def __issueNewNode(self):
+    """
+    @Summ: 新しいnode番号を発行する関数。
+
+    @Desc: 最大値を利用して新しい番号を生成している。
+
+    @Returns:
+      @Summ: 新しいnode番号。
+      @Type: Int
+    """
+    if(self.maxNodeIdx is None):
+      self.maxNodeIdx=max(self.data.keys())
+    newNodeIdx=self.maxNodeIdx+1
+    self.maxNodeIdx=newNodeIdx
+    self.data[newNodeIdx]={}
+    return newNodeIdx
+
+  def visualize(self,filename):
+    """
+    @Summ: graphvizで可視化する関数。
+    """
+    graph=graphviz.Digraph()
+    graph.filename=filename
+    graph.format="svg"
+    graph.attr("graph",rankdir="LR")
+    for nodeIdx,edgeDict in self.data.items():
+      # print(nodeIdx)
+      graph.node(str(nodeIdx))
+      for edgeLabel,destNode in edgeDict.items():
+        graph.edge(tail_name=str(nodeIdx), head_name=str(destNode), label=edgeLabel)
+    graph.render()
+
+  def accessNode(self,path:list):
+    """
+    @Summ: pathからedgeを参照する関数。
+
+    @Args:
+      path:
+        @Summ: 参照するedge.
+        @SemType: Str型List.
+    @Returns:
+    - @Summ: nodeの到達履歴。
+      @Desc: 到達不可能になったらそこで終了する。
+      @Type: Int型List
+    - @Summ: 使わなかったedgeLabelの数。この数字を未到達度と呼ぶ。
+      @Desc: 0で到達完了を表す。
+      @Type: Int
+    """
+    history=[self.ROOT_NODE]
+    curEdgeDict=self.data[self.ROOT_NODE]
+    pathLength=len(path)
+    unreached=pathLength
+    for i in range(pathLength):
+      edgeLabel=path[i]
+      curNode=curEdgeDict.get(edgeLabel)
+      if(curNode is None):
+        break
+      history.append(curNode)
+      curEdgeDict=self.data[curNode]
+      unreached-=1
+    return history,unreached
+
+  def changeEdgeDestination(self,oldPath,newPath):
+    """
+    @Summ: edgeの終点を変更する関数。
+
+    @Desc:
+    - nodeの生成を伴わないedgeの生成まではできる。
+    - 始点と終点が同じ辺(二重辺)は禁止。
+
+    @Args:
+      oldPath:
+        @Summ: 現在のedgeの終着点。
+        @Desc:
+        - 未到達度0の時は、既存のedgeの終点を付け替える作業。
+        - 未到達度1の時は、新しいedgeLabelを生成する。
+        - それ以上の未到達度は受け付けない。
+        @SemType: Str型List.
+      newPath:
+        @Summ: edgeの新しい終着点を指定する。
+        @Desc: 未到達度0のpathしか受け付けない。
+        @SemType: Str型List.
+    """
+    oldDestHistory,oldUnused=self.accessNode(oldPath)
+    lastEdgeLabel=oldPath[-1]
+    if(oldUnused==0):
+      edgeStartNode=oldDestHistory[-2]  
+    elif(oldUnused==1):
+      edgeStartNode=oldDestHistory[-1]
+    else:
+      raise RuntimeError(f"line: {self.programCounter}:\n\t{oldPath} is not accessable.")
+    newDestHistory,newUnused=self.accessNode(newPath)
+    if(newUnused>0):
+      raise RuntimeError(f"line: {self.programCounter}:\n\t{newPath} is not accessable.")
+    newEndNode=newDestHistory[-1]
+    edgeInfo=self.data[edgeStartNode]
+    if(newEndNode in edgeInfo.values()):
+      raise RuntimeError(f"line: {self.programCounter}:\n\t Edge endpoint is duplicated.")    #既存のedgeの終端が被る。
+    self.data[edgeStartNode][lastEdgeLabel]=newEndNode
+
+  def deleteEdge(self,path):
+    """
+    @Summ: 到達可能なedgeを削除する関数。
+
+    @Args:
+      path:
+        @Summ: 削除するedge.
+        @SemType: Str型List.
+    """
+    lastNodePath=path[:-1]
+    lastEdge=path[-1]
+    history,unreached=self.accessNode(lastNodePath)
+    if(unreached==0):
+      lastNode=history[-1]
+      del self.data[lastNode][lastEdge]
+    else:
+      raise RuntimeError(f"line: {self.programCounter}:\n\t{path} is not accessable.")
+
+  def generateEdge(self,path):
+    """
+    @Summ: nodeの生成を伴うedgeの生成を行う関数。
+
+    @Args:
+      path:
+        @Summ: 新しく生成するpath.
+        @Desc: 未到達度=1である必要がある。
+        @SemType: Str型List.
+    """
+    history,unreached=self.accessNode(path)
+    if(unreached!=1):
+      raise RuntimeError(f"line: {self.programCounter}:\n\t{path} is not accessable.")
+    lastEdge=path[-1]
+    lastNode=history[-1]
+    newNode=self.__issueNewNode()
+    self.data[lastNode][lastEdge]=newNode
+
+  def execute(self):
+    """
+    @Summ: programを実行する関数。
+    """
+    self.programCounter=0
+    while(True):
+      if(self.programLength<=self.programCounter):
+        break
+      argList=self.program[self.programCounter]
+      if(argList[0]=="cp"):
+        self.executeCopy(argList[1],argList[2])
+        self.programCounter=int(argList[3])
+        continue
+      elif(argList[0]=="if"):
+        isSame=self.executeIf(argList[1],argList[2])
+        if(isSame):
+          self.programCounter=int(argList[3])
+        else:
+          self.programCounter=int(argList[4])
+    return
+
+  def executeCopy(self,path1,path2):
+    """
+    @Summ: copy文を実行する関数。
+
+    @Args:
+      path1:
+        @Summ: copy文の第一引数。編集するpathを表す。
+        @Type: Str
+      path2:
+        @Summ: copy文の第二引数。上書きするpathを表す。
+        @Type: Str
+    """
+    path1EdgeList=path1.split(self.PATH_DELIMITER)
+    if(path2==self.NEW_EDGE_LABEL):
+      self.generateEdge(path1EdgeList)
+    elif(path2==self.DELETE_EDGE_LABEL):
+      self.deleteEdge(path1EdgeList)
+    else:
+      path2EdgeList=path2.split(self.PATH_DELIMITER)
+      self.changeEdgeDestination(path1EdgeList,path2EdgeList)
+
+  def executeIf(self,path1,path2):
+    """
+    @Summ: if文を実行する関数。
+
+    @Desc:
+    - path1==未到達度1∧path2==DELETE_NODEの時、edgeが存在しない時にTrueを出力する。
+
+    @Args:
+      path1:
+        @Summ: if文の第一引数。比較するpathその1。
+        @Type: Str
+      path2:
+        @Summ: if文の第二引数。比較するpathその2。
+        @Type: Str
+    @Returns:
+      @Summ: 同じ値の時にTrue.
+      @Type: Bool
+    """
+    path1EdgeList=path1.split(self.PATH_DELIMITER)
+    path1History,path1unreached=self.accessNode(path1EdgeList)
+    if(path2==self.DELETE_EDGE_LABEL):
+      if(path1unreached==0):
+        return False
+      elif(path1unreached==1):
+        return True
+      else:
+        raise RuntimeError(f"line {self.programCounter}:\n\t{path2} is not accessable.")
+    path2EdgeList=path2.split(self.PATH_DELIMITER)
+    path2History,path2unreached=self.accessNode(path2EdgeList)
+    if(path1unreached!=0):
+      raise RuntimeError(f"line {self.programCounter}:\n\t{path1} is not accessable.")
+    if(path2unreached!=0):
+      raise RuntimeError(f"line {self.programCounter}:\n\t{path2} is not accessable.")
+    path1LastNode=path1History[-1]
+    path2LastNode=path2History[-1]
+    if(path1LastNode==path2LastNode):
+      return True
+    else:
+      return False
+

pgvm-0.1.0.dist-info/METADATA

@@ -0,0 +1,31 @@
+Metadata-Version: 2.4
+Name: pgvm
+Version: 0.1.0
+Summary: PGVM is an abbreviation for Pointer Graph Virtual Machine.
+Author-email: masaniki <masaniki.software@gmail.com>
+License-Expression: MIT
+Project-URL: Repository, https://github.com/masaniki/python-pgvm
+Project-URL: Issues, https://github.com/masaniki/python-pgvm/issues
+Keywords: graph,node,edge,automaton,processor
+Classifier: Development Status :: 1 - Planning
+Classifier: Programming Language :: Python :: 3.9
+Classifier: Operating System :: OS Independent
+Classifier: Natural Language :: Japanese
+Classifier: Natural Language :: English
+Classifier: Intended Audience :: Information Technology
+Requires-Python: >=3.9
+Description-Content-Type: text/markdown
+License-File: LICENSE.txt
+Requires-Dist: PyYAML
+Requires-Dist: graphviz
+Dynamic: license-file
+
+# Introduction
+
+This is a introduction.
+
+Original document is [HERE](docs/README_JP.md).
+
+# Installing
+
+`pip install pgvm`

pgvm-0.1.0.dist-info/RECORD

@@ -0,0 +1,7 @@
+pgvm/__init__.py,sha256=GY_Au96x1eHCwTyFeo2u7ECsEo1nLIgB30UxSTX774g,75
+pgvm/editable_graph.py,sha256=c40N4VQXM2JYudWl7-J7P6qvrpCHV2B9FBPwFH2nPJ0,9389
+pgvm-0.1.0.dist-info/licenses/LICENSE.txt,sha256=7oOMsj5XGQQ_SippluC7AuCMB_Vrujo2jqT0QkRkN64,1061
+pgvm-0.1.0.dist-info/METADATA,sha256=4wMpxOPO5CgCtou0yOhwme0NgwmZo8BpC1hoUTKY7OQ,965
+pgvm-0.1.0.dist-info/WHEEL,sha256=K260EYznzXsJYBQGqmI8VTxEdiZYNvDZwW9cBh9-_MA,91
+pgvm-0.1.0.dist-info/top_level.txt,sha256=rparoIlC_FHLpXxMvM7xTajsiJYPX0ghdwMbPK3XO3w,5
+pgvm-0.1.0.dist-info/RECORD,,

pgvm-0.1.0.dist-info/WHEEL

@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: setuptools (83.0.0)
+Root-Is-Purelib: true
+Tag: py3-none-any
+

pgvm-0.1.0.dist-info/licenses/LICENSE.txt

@@ -0,0 +1,7 @@
+Copyright 2026 masaniki
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT 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.

pgvm-0.1.0.dist-info/top_level.txt

@@ -0,0 +1 @@
+pgvm