Commit 8af6c6a7 by Eric Coissac

Remove warnings

parent 8c71a358
......@@ -105,8 +105,8 @@ cdef class DiGraph:
return key in self._nodes
cpdef dict addNode(self,int node):
cdef char[50] buffer
cdef bytes key
cdef char[50] buffer # @DuplicatedSignature
cdef bytes key # @DuplicatedSignature
cdef dict node_attrs
assert node < INT32_MAX,'Node id must be less than %d' % INT32_MAX
......@@ -155,10 +155,10 @@ cdef class DiGraph:
return edges_attrs
cpdef bint hasEdge(self, int node1, int node2):
cdef char[50] buffer1
cdef char[50] buffer2
cdef bytes key1
cdef bytes key2
cdef char[50] buffer1 # @DuplicatedSignature
cdef char[50] buffer2 # @DuplicatedSignature
cdef bytes key1 # @DuplicatedSignature
cdef bytes key2 # @DuplicatedSignature
cdef tuple edgek
snprintf(buffer1,50,b"%d",node1)
......@@ -217,7 +217,6 @@ cdef class DiGraph:
cdef int edge
cdef list lines=[]
cdef str line
# cdef dict attr
for node1 in self.nodeIterator(nodePredicate):
......@@ -281,11 +280,11 @@ cdef class DiGraph:
return dot
cpdef deleteEdge(self, int node1, int node2, int edge=-1):
cdef char[50] buffer1
cdef char[50] buffer2
cdef bytes key1
cdef bytes key2
cdef tuple edgek
cdef char[50] buffer1 # @DuplicatedSignature
cdef char[50] buffer2 # @DuplicatedSignature
cdef bytes key1 # @DuplicatedSignature
cdef bytes key2 # @DuplicatedSignature
cdef tuple edgek # @DuplicatedSignature
snprintf(buffer1,50,b"%d",node1)
......@@ -327,9 +326,9 @@ cdef class DiGraph:
cdef DiGraph graph
cdef set nodeset = set()
cdef int node
cdef int node2
cdef char[50] buffer1
cdef char[50] buffer2
cdef int node2 # @DuplicatedSignature
cdef char[50] buffer1 # @DuplicatedSignature
cdef char[50] buffer2 # @DuplicatedSignature
cdef bytes key1
cdef bytes key2
cdef tuple edge
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment