Differential D16683 Diff 58488 source/blender/blenkernel/BKE_node.h

Changeset View

Standalone View

	Show First 20 Lines • Show All 662 Lines • ▼ Show 20 Lines
	/**			/**
	* \note Goes over entire tree.			* \note Goes over entire tree.
	*/			*/
	void nodeUnlinkNode(struct bNodeTree ntree, struct bNode node);			void nodeUnlinkNode(struct bNodeTree ntree, struct bNode node);
	/**			/**
	* Find the first available, non-duplicate name for a given node.			* Find the first available, non-duplicate name for a given node.
	*/			*/
	void nodeUniqueName(struct bNodeTree ntree, struct bNode node);			void nodeUniqueName(struct bNodeTree ntree, struct bNode node);
				/**
				* Create a new unique integer identifier for the node. Also set the node's
				* index in the tree, which is an eagerly maintained cache.
				*/
	void nodeUniqueID(struct bNodeTree ntree, struct bNode node);			void nodeUniqueID(struct bNodeTree ntree, struct bNode node);

	/**			/**
	* Rebuild the `node_by_id` runtime vector set. Call after removing a node if not handled			* Rebuild the `node_by_id` runtime vector set. Call after removing a node if not handled
	* separately. This is important instead of just using `nodes_by_id.remove()` since it maintains			* separately. This is important instead of just using `nodes_by_id.remove()` since it maintains
	* the node order.			* the node order.
	*/			*/
	void nodeRebuildIDVector(struct bNodeTree *node_tree);			void nodeRebuildIDVector(struct bNodeTree *node_tree);
	▲ Show 20 Lines • Show All 928 Lines • Show Last 20 Lines