diff --git a/data_structure.py b/data_structure.py index 4026b27da9b6811f237d288d099e02256893e850..3c6011fd26ae3859aff4a23db7fe53bb4ffba736 100755 --- a/data_structure.py +++ b/data_structure.py @@ -1456,7 +1456,7 @@ def node_id(node): return node.node_id -# EDGE CACHE settings : used to accellerate the (linear) edge list generation +# EDGE CACHE settings : used to accelerate the (linear) edge list generation _edgeCache = {} _edgeCache["main"] = [] # e.g. [[0, 1], [1, 2], ... , [N-1, N]] (extended as needed) @@ -1482,7 +1482,7 @@ def get_edge_list(n): e.g. [[0, 1], [1, 2], ... , [n-1, n]] - NOTE: This uses an "edge cache" to accellerate the edge list generation. + NOTE: This uses an "edge cache" to accelerate the edge list generation. The cache is extended automatically as needed to satisfy the largest number of edges within the node tree and it is shared by all nodes using this method. """ @@ -1496,7 +1496,7 @@ def get_edge_loop(n): e.g. [[0, 1], [1, 2], ... , [n-2, n-1], [n-1, 0]] - NOTE: This uses an "edge cache" to accellerate the edge list generation. + NOTE: This uses an "edge cache" to accelerate the edge list generation. The cache is extended automatically as needed to satisfy the largest number of edges within the node tree and it is shared by all nodes using this method. """ diff --git a/docs/nodes/analyzer/component_analyzer.rst b/docs/nodes/analyzer/component_analyzer.rst index 5bd480e1b7cea8a051c08168f0e04b9db11ffbe4..dc50fd370f4ddb00198fe0e72289ca4e73815627 100644 --- a/docs/nodes/analyzer/component_analyzer.rst +++ b/docs/nodes/analyzer/component_analyzer.rst @@ -117,7 +117,7 @@ Component Sharpness: .. image:: https://user-images.githubusercontent.com/10011941/71564638-61adba80-2aa4-11ea-9c1f-c1f5551287cf.png -Adjacent Edges, Faces Angle and Neibor Faces Num: +Adjacent Edges, Faces Angle and Neighbor Faces Num: .. image:: https://user-images.githubusercontent.com/10011941/71564682-134ceb80-2aa5-11ea-9b97-15891503f39c.png diff --git a/docs/nodes/generator/box_mk2.rst b/docs/nodes/generator/box_mk2.rst index e1846399366dc68a50df0450390cf08a694c096a..015543c560a5ac3206e0e2f9f576d18bd885bcb0 100644 --- a/docs/nodes/generator/box_mk2.rst +++ b/docs/nodes/generator/box_mk2.rst @@ -4,7 +4,7 @@ Box Functionality ------------- -Offers a Box primitive with variable X,Y and Z divisions, and overal Size. +Offers a Box primitive with variable X,Y and Z divisions, and overall Size. Inputs ------ diff --git a/docs/nodes/quaternion/quaternion_in_mk2.rst b/docs/nodes/quaternion/quaternion_in_mk2.rst index 7523f4c4ad93a1655a3594ab3c85454542d82aed..afe24d00959afcb75bf52c47ce295a697a37fda9 100644 --- a/docs/nodes/quaternion/quaternion_in_mk2.rst +++ b/docs/nodes/quaternion/quaternion_in_mk2.rst @@ -80,7 +80,7 @@ Outputs **Quaternions** -The node outputs a list of one ore more quaternions based on the given input. +The node outputs a list of one or more quaternions based on the given input. The node only generates the quaternions when the output socket is connected. diff --git a/docs/nodes/surface/extremes.rst b/docs/nodes/surface/extremes.rst index 67247f6c1e2ee403163ecf920501015c0ad57ce2..3e79648ed5beb77c1da331e2eb3ec499438d4ca6 100644 --- a/docs/nodes/surface/extremes.rst +++ b/docs/nodes/surface/extremes.rst @@ -47,7 +47,7 @@ This node has the following parameters: * **Search Best**. If checked, the node will try to find global maximum or minimum. Otherwise, the node will return all points it managed to find. * **Method**. This parameter is available in the N panel only. The algorithm - used to find the exterme point. The available values are: + used to find the extreme point. The available values are: * L-BFGS-B * Conjugate Gradient diff --git a/docs/old/Installation_troubleshooting.md b/docs/old/Installation_troubleshooting.md index fd7a09bcbdb6b8b6214b8ccce4e5d5c409e1cc4b..1756071c1e981ff4dd574cefa476fc32bd869bb7 100644 --- a/docs/old/Installation_troubleshooting.md +++ b/docs/old/Installation_troubleshooting.md @@ -21,7 +21,7 @@ binaries python: https://www.python.org/downloads/release/python-341/ numpy: http://sourceforge.net/projects/numpy/files/NumPy/ -To confirm that NumPy is installed properly on your system, for py3.4, launch your python34 interpretter/console and the following NumPy import should produce no error. +To confirm that NumPy is installed properly on your system, for py3.4, launch your python34 interpreter/console and the following NumPy import should produce no error. ``` diff --git a/docs/old/Introduction_to_Geometry.md b/docs/old/Introduction_to_Geometry.md index ed42f8282df8f022bf6c38cbd4dbb4f76af92dbe..10d279ab4a016bc7844b186f05a2329d7e94cfe8 100644 --- a/docs/old/Introduction_to_Geometry.md +++ b/docs/old/Introduction_to_Geometry.md @@ -54,7 +54,7 @@ An example that sets us up for the first Sverchok example is the cube. Conceptua polygons = [[],[],[],[],[],[]] -Once you define polygons then you are also defining edges implicitely. If a polygon has 4 vertices, then it also has 4 edges. Two adjacent polygons may share edges. I think this broadly covers the things you should be comfortable with before Sverchok will make sense. +Once you define polygons then you are also defining edges implicitly. If a polygon has 4 vertices, then it also has 4 edges. Two adjacent polygons may share edges. I think this broadly covers the things you should be comfortable with before Sverchok will make sense. ###Sverchok diff --git a/nodes/modifier_make/wafel.py b/nodes/modifier_make/wafel.py index 9a212a00af2b9bc9825643ab68f0d89ad933b871..d2d11af8808163a24f2ce89916cb66f9a64c444b 100644 --- a/nodes/modifier_make/wafel.py +++ b/nodes/modifier_make/wafel.py @@ -446,7 +446,7 @@ class SvWafelNode(bpy.types.Node, SverchCustomTreeNode): lz1]) k += 10 - # streight section + # straight section else: '''рёбра''' # пазы формируем независимо от верх низ diff --git a/utils/nodes_mixins/recursive_nodes.py b/utils/nodes_mixins/recursive_nodes.py index 5bb38156b9e7bccbb807e0f7c83f86c5d44b0bb7..173d0fd94b024575a0c1c2e12dd7a837cc2e6284 100644 --- a/utils/nodes_mixins/recursive_nodes.py +++ b/utils/nodes_mixins/recursive_nodes.py @@ -110,7 +110,7 @@ class SvRecursiveNode(): bmesh_list, other_param1, other_param2 = params creating the bmesh_list before matching improves performance a lot, but if - you are modifiying the bm in your function do it over a copy -> bm.copy() + you are modifying the bm in your function do it over a copy -> bm.copy() '''