Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix various typos #4426

Merged
merged 1 commit into from
Apr 16, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions data_structure.py
Original file line number Diff line number Diff line change
Expand Up @@ -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)

Expand All @@ -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.
"""
Expand All @@ -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.
"""
Expand Down
2 changes: 1 addition & 1 deletion docs/nodes/analyzer/component_analyzer.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
2 changes: 1 addition & 1 deletion docs/nodes/generator/box_mk2.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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
------
Expand Down
2 changes: 1 addition & 1 deletion docs/nodes/quaternion/quaternion_in_mk2.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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.

2 changes: 1 addition & 1 deletion docs/nodes/surface/extremes.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
2 changes: 1 addition & 1 deletion docs/old/Installation_troubleshooting.md
Original file line number Diff line number Diff line change
Expand Up @@ -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.


```
Expand Down
2 changes: 1 addition & 1 deletion docs/old/Introduction_to_Geometry.md
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
2 changes: 1 addition & 1 deletion nodes/modifier_make/wafel.py
Original file line number Diff line number Diff line change
Expand Up @@ -446,7 +446,7 @@ def process(self):
lz1])
k += 10

# streight section
# straight section
else:
'''рёбра'''
# пазы формируем независимо от верх низ
Expand Down
2 changes: 1 addition & 1 deletion utils/nodes_mixins/recursive_nodes.py
Original file line number Diff line number Diff line change
Expand Up @@ -110,7 +110,7 @@ def process_data(self, params)
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()


'''
Expand Down