inprogress xor list

contracts/xorlist.se

@@ -1,10 +1,27 @@
 # XOR List
 # For Trade Keys, points to hashmap for trade data
-# http://www.geeksforgeeks.org/xor-linked-list-a-memory-efficient-doubly-linked-list-set-2/
 
-data xorlist[](key)
+data head_ref
+data xorlist[](item, nxp)  # nxp = next xor previous
 data hashmap[](value)
 
 
-def xoritem():
-    return("monkey" xor "chowder")
+def init():
+    self.head_ref = 0
+
+
+def push(head_ref, item):
+    new_node_addr = head_ref xor 0
+    self.xorlist[new_node_addr].item = item
+
+    # if head_ref != 0:
+    #     self.xorlist[new_node_addr].nxp = head_ref xor 0
+
+    self.xorlist[new_node_addr].nxp = self.xorlist[self.head_ref].nxp xor 0
+    self.xorlist[self.head_ref].nxp = new_node_addr xor self.xorlist[new_node_addr].nxp
+
+    self.head_ref = new_node_addr
+
+
+def head_ref():
+    return(self.head_ref)

test.py

@@ -22,9 +22,10 @@ minheap = state.abi_contract(minheap_se)
 xorlist = state.abi_contract(xorlist_se)
 
 minheap.push(5)
-# state.mine()
 minheap.push(10)
-minheap.push(20)
-minheap.push(40)
-# minheap.pop()
 print(minheap.top())
+
+xorlist.push(xorlist.head_ref(), 10)
+xorlist.push(xorlist.head_ref(), 20)
+xorlist.push(xorlist.head_ref(), 30)
+xorlist.push(xorlist.head_ref(), 40)