Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCampbell Barton <campbell@blender.org>2022-08-19 06:49:13 +0300
committerCampbell Barton <campbell@blender.org>2022-08-19 06:49:13 +0300
commit1a3bc09e893308cb6d31640856d23006fac56292 (patch)
treee9c3e2701b2350c8b84fc94f9585a9cc3921c0e8 /source/blender/blenkernel
parent2a15040777a04170a00c3591065b8243e40428d5 (diff)
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/blenkernel')
-rw-r--r--source/blender/blenkernel/BKE_outliner_treehash.hh13
-rw-r--r--source/blender/blenkernel/intern/outliner_treehash.cc6
2 files changed, 11 insertions, 8 deletions
diff --git a/source/blender/blenkernel/BKE_outliner_treehash.hh b/source/blender/blenkernel/BKE_outliner_treehash.hh
index f72cec21dbc..b5226f7ed50 100644
--- a/source/blender/blenkernel/BKE_outliner_treehash.hh
+++ b/source/blender/blenkernel/BKE_outliner_treehash.hh
@@ -26,23 +26,24 @@ class TreeHash {
public:
~TreeHash();
- /* create and fill hashtable with treestore elements */
+ /** Create and fill hash-table with treestore elements */
static std::unique_ptr<TreeHash> create_from_treestore(BLI_mempool &treestore);
- /* full rebuild for already allocated hashtable */
+ /** Full rebuild for already allocated hash-table. */
void rebuild_from_treestore(BLI_mempool &treestore);
- /* clear element usage flags */
+ /** Clear element usage flags. */
void clear_used();
- /* Add/remove hashtable elements */
+ /** Add hash-table element. */
void add_element(TreeStoreElem &elem);
+ /** Remove hash-table element. */
void remove_element(TreeStoreElem &elem);
- /* find first unused element with specific type, nr and id */
+ /** Find first unused element with specific type, nr and id. */
TreeStoreElem *lookup_unused(short type, short nr, ID *id) const;
- /* find user or unused element with specific type, nr and id */
+ /** Find user or unused element with specific type, nr and id. */
TreeStoreElem *lookup_any(short type, short nr, ID *id) const;
private:
diff --git a/source/blender/blenkernel/intern/outliner_treehash.cc b/source/blender/blenkernel/intern/outliner_treehash.cc
index 5d13894c265..e832240fe90 100644
--- a/source/blender/blenkernel/intern/outliner_treehash.cc
+++ b/source/blender/blenkernel/intern/outliner_treehash.cc
@@ -39,9 +39,11 @@ class TseGroup {
/* Only allow reset of #TseGroup.lastused counter to 0 once every 1k search. */
#define TSEGROUP_LASTUSED_RESET_VALUE 10000
-/* Allocate structure for TreeStoreElements;
+/**
+ Allocate structure for TreeStoreElements;
* Most of elements in treestore have no duplicates,
- * so there is no need to preallocate memory for more than one pointer */
+ * so there is no need to pre-allocate memory for more than one pointer.
+ */
static TseGroup *tse_group_create(void)
{
TseGroup *tse_group = MEM_new<TseGroup>("TseGroup");