def insert_node(cur,
parent,
properties=None,
position=None,
auto_position=True,
id=None):
"""
Create a ``Node`` object, insert it into the tree and then return
it.
:param parent: Reference to its parent node. If `None`, this will
be the root node.
:type parent: Node or uuid4
:param dict properties: Inheritable key/value pairs
(see :ref:`core-properties`)
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`core-positioning`
:param uuid4 id: Use this ID instead of automatically generating
one.
"""
if id is None:
id = str(uuid.uuid4())
parent_id = None
if parent is not None:
parent_id = str(parent)
if properties is None:
properties = {}
# Can't run set_position() because the node doesn't exist yet
if auto_position:
if isinstance(position, int) and position >= 0:
ensure_free_position(cur, parent, position)
else:
position = find_highest_position(cur, parent) + 1
sql = """
INSERT INTO
nodes
(id, parent, position, properties)
VALUES
(%s, %s, %s, %s);
"""
cur.execute(sql, (id, parent_id, position, json.dumps(properties)))
return NodeData(id, parent_id, position, properties)
def change_parent(cur, node, new_parent, position=None, auto_position=True):
"""
Move node and its subtree from its current to another parent node.
Return updated ``Node`` object with new parent set. Raise
``ValueError`` if ``new_parent`` is inside ``node`` s subtree.
:param node:
:type node: Node or int
:param new_parent: Reference to the new parent node
:type new_parent: Node or int
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`coreapi-positioning`.
"""
new_parent_id = int(new_parent)
if new_parent_id in get_descendant_ids(cur, node):
raise ValueError('Cannot move node into its own subtree.')
# Can't run set_position() here because the node hasn't been moved yet,
# must do it manually
if auto_position:
if type(position) == int and position >= 0:
ensure_free_position(cur, new_parent_id, position)
else:
position = find_highest_position(cur, new_parent_id) + 1
sql = """
UPDATE
nodes
SET
parent=%s,
position=%s
WHERE
id=%s;
"""
cur.execute(sql, (new_parent_id, position, int(node)))
if type(node) == int:
node = get_node(cur, node)
kwargs = node.to_dict()
kwargs['parent'] = new_parent_id
kwargs['position'] = position
return NodeData(**kwargs)
def change_parent(cur, node, new_parent, position=None, auto_position=True):
"""
Move node and its subtree from its current to another parent node.
Return updated ``Node`` object with new parent set. Raise
``ValueError`` if ``new_parent`` is inside ``node`` s subtree.
:param node:
:type node: Node or int
:param new_parent: Reference to the new parent node
:type new_parent: Node or int
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`core-positioning`.
"""
new_parent_id = int(new_parent)
if new_parent_id in get_descendant_ids(cur, node):
raise ValueError('Cannot move node into its own subtree.')
# Can't run set_position() here because the node hasn't been moved yet,
# must do it manually
if auto_position:
if type(position) == int and position >= 0:
ensure_free_position(cur, new_parent_id, position)
else:
position = find_highest_position(cur, new_parent_id) + 1
sql = """
UPDATE
nodes
SET
parent=%s,
position=%s
WHERE
id=%s;
"""
cur.execute(sql, (new_parent_id, position, int(node)))
if type(node) == int:
node = get_node(cur, node)
kwargs = node.to_dict()
kwargs['parent'] = new_parent_id
kwargs['position'] = position
return NodeData(**kwargs)
def insert_node(cur, parent, properties=None, position=None,
auto_position=True, id=None):
"""
Create a ``Node`` object, insert it into the tree and then return
it.
:param parent: Reference to its parent node. If `None`, this will
be the root node.
:type parent: Node or uuid4
:param dict properties: Inheritable key/value pairs
(see :ref:`core-properties`)
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`core-positioning`
:param uuid4 id: Use this ID instead of automatically generating
one.
"""
if id is None:
id = str(uuid.uuid4())
parent_id = None
if parent is not None:
parent_id = str(parent)
if properties is None:
properties = {}
# Can't run set_position() because the node doesn't exist yet
if auto_position:
if isinstance(position, int) and position >= 0:
ensure_free_position(cur, parent, position)
else:
position = find_highest_position(cur, parent) + 1
sql = """
INSERT INTO
nodes
(id, parent, position, properties)
VALUES
(%s, %s, %s, %s);
"""
cur.execute(sql, (id, parent_id, position, json.dumps(properties)))
return NodeData(id, parent_id, position, properties)
def insert_node(cur, parent, properties=None, position=None,
auto_position=True):
"""
Create a ``Node`` object, insert it into the tree and then return
it.
:param parent: Reference to its parent node. If `None`, this will
be the root node.
:type parent: Node or int
:param dict properties: Inheritable key/value pairs
(see :ref:`coreapi-properties`)
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`coreapi-positioning`
"""
parent_id = None
if parent is not None:
parent_id = int(parent)
if properties is None:
properties = {}
# Can't run set_position() because the node doesn't exist yet
if auto_position:
if type(position) == int and position >= 0:
ensure_free_position(cur, parent, position)
else:
position = find_highest_position(cur, parent) + 1
sql = """
INSERT INTO
nodes
(parent, position, properties)
VALUES
(%s, %s, %s);
"""
cur.execute(sql, (parent_id, position, json.dumps(properties)))
cur.execute("SELECT LASTVAL();")
id = cur.fetchone()['lastval']
node = NodeData(id, parent_id, position, properties)
return node
def insert_node(cur, parent, properties=None, position=None,
auto_position=True):
"""
Create a ``Node`` object, insert it into the tree and then return
it.
:param parent: Reference to its parent node. If `None`, this will
be the root node.
:type parent: Node or int
:param dict properties: Inheritable key/value pairs
(see :ref:`core-properties`)
:param int position: Position in between siblings. If 0, the node
will be inserted at the beginning of the
parents children. If -1, the node will be
inserted the the end of the parents children.
If `auto_position` is disabled, this is just a
value.
:param bool auto_position: See :ref:`core-positioning`
"""
parent_id = None
if parent is not None:
parent_id = int(parent)
if properties is None:
properties = {}
# Can't run set_position() because the node doesn't exist yet
if auto_position:
if type(position) == int and position >= 0:
ensure_free_position(cur, parent, position)
else:
position = find_highest_position(cur, parent) + 1
sql = """
INSERT INTO
nodes
(parent, position, properties)
VALUES
(%s, %s, %s);
"""
cur.execute(sql, (parent_id, position, json.dumps(properties)))
cur.execute("SELECT LASTVAL();")
id = cur.fetchone()['lastval']
node = NodeData(id, parent_id, position, properties)
return node
def test_ensure_free_position(cur, root):
ensure_free_position(cur, root, 4)
positions = map(lambda n: n.position, get_children(cur, root))
assert list(positions) == [0, 1, 3]
def test_ensure_free_position(cur, root):
ensure_free_position(cur, root, 4)
positions = map(lambda n: n.position, get_children(cur, root))
assert list(positions) == [0, 1, 3]