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
path: root/source/blender/blenlib/BLI_edgehash.h
diff options
context:
space:
mode:
Diffstat (limited to 'source/blender/blenlib/BLI_edgehash.h')
-rw-r--r--source/blender/blenlib/BLI_edgehash.h151
1 files changed, 91 insertions, 60 deletions
diff --git a/source/blender/blenlib/BLI_edgehash.h b/source/blender/blenlib/BLI_edgehash.h
index 7016f147616..66797ee113f 100644
--- a/source/blender/blenlib/BLI_edgehash.h
+++ b/source/blender/blenlib/BLI_edgehash.h
@@ -27,66 +27,87 @@ struct EdgeHash;
typedef struct EdgeHash EdgeHash;
struct _EdgeHash_Edge {
- uint v_low, v_high;
+ uint v_low, v_high;
};
struct _EdgeHash_Entry {
- struct _EdgeHash_Edge edge;
- void *value;
+ struct _EdgeHash_Edge edge;
+ void *value;
};
typedef struct EdgeHashIterator {
- struct _EdgeHash_Entry *entries;
- uint length;
- uint index;
+ struct _EdgeHash_Entry *entries;
+ uint length;
+ uint index;
} EdgeHashIterator;
typedef void (*EdgeHashFreeFP)(void *key);
enum {
- EDGEHASH_FLAG_ALLOW_DUPES = (1 << 0), /* only checked for in debug mode */
+ EDGEHASH_FLAG_ALLOW_DUPES = (1 << 0), /* only checked for in debug mode */
};
-EdgeHash *BLI_edgehash_new_ex(const char *info,
- const unsigned int nentries_reserve);
-EdgeHash *BLI_edgehash_new(const char *info) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
-void BLI_edgehash_free(EdgeHash *eh, EdgeHashFreeFP valfreefp);
-void BLI_edgehash_print(EdgeHash *eh);
-void BLI_edgehash_insert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
-bool BLI_edgehash_reinsert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
-void *BLI_edgehash_lookup(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
-void *BLI_edgehash_lookup_default(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val_default) ATTR_WARN_UNUSED_RESULT;
-void **BLI_edgehash_lookup_p(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
-bool BLI_edgehash_ensure_p(EdgeHash *eh, unsigned int v0, unsigned int v1, void ***r_val) ATTR_WARN_UNUSED_RESULT;
-bool BLI_edgehash_remove(EdgeHash *eh, unsigned int v0, unsigned int v1, EdgeHashFreeFP valfreefp);
-
-void *BLI_edgehash_popkey(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
-bool BLI_edgehash_haskey(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
-int BLI_edgehash_len(EdgeHash *eh) ATTR_WARN_UNUSED_RESULT;
-void BLI_edgehash_clear_ex(EdgeHash *eh, EdgeHashFreeFP valfreefp,
- const unsigned int nentries_reserve);
-void BLI_edgehash_clear(EdgeHash *eh, EdgeHashFreeFP valfreefp);
-
-EdgeHashIterator *BLI_edgehashIterator_new(EdgeHash *eh) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
-void BLI_edgehashIterator_init(EdgeHashIterator *ehi, EdgeHash *eh);
-void BLI_edgehashIterator_free(EdgeHashIterator *ehi);
-
-BLI_INLINE void BLI_edgehashIterator_step(EdgeHashIterator *ehi)
-{ ehi->index++; }
-BLI_INLINE bool BLI_edgehashIterator_isDone(EdgeHashIterator *ehi)
-{ return ehi->index >= ehi->length; }
-BLI_INLINE void BLI_edgehashIterator_getKey(EdgeHashIterator *ehi, unsigned int *r_v0, unsigned int *r_v1)
-{ struct _EdgeHash_Edge edge = ehi->entries[ehi->index].edge; *r_v0 = edge.v_low; *r_v1 = edge.v_high; }
-BLI_INLINE void *BLI_edgehashIterator_getValue(EdgeHashIterator *ehi)
-{ return ehi->entries[ehi->index].value; }
+EdgeHash *BLI_edgehash_new_ex(const char *info, const unsigned int nentries_reserve);
+EdgeHash *BLI_edgehash_new(const char *info) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
+void BLI_edgehash_free(EdgeHash *eh, EdgeHashFreeFP valfreefp);
+void BLI_edgehash_print(EdgeHash *eh);
+void BLI_edgehash_insert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
+bool BLI_edgehash_reinsert(EdgeHash *eh, unsigned int v0, unsigned int v1, void *val);
+void *BLI_edgehash_lookup(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
+void *BLI_edgehash_lookup_default(EdgeHash *eh,
+ unsigned int v0,
+ unsigned int v1,
+ void *val_default) ATTR_WARN_UNUSED_RESULT;
+void **BLI_edgehash_lookup_p(EdgeHash *eh,
+ unsigned int v0,
+ unsigned int v1) ATTR_WARN_UNUSED_RESULT;
+bool BLI_edgehash_ensure_p(EdgeHash *eh, unsigned int v0, unsigned int v1, void ***r_val)
+ ATTR_WARN_UNUSED_RESULT;
+bool BLI_edgehash_remove(EdgeHash *eh, unsigned int v0, unsigned int v1, EdgeHashFreeFP valfreefp);
+
+void *BLI_edgehash_popkey(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
+bool BLI_edgehash_haskey(EdgeHash *eh, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
+int BLI_edgehash_len(EdgeHash *eh) ATTR_WARN_UNUSED_RESULT;
+void BLI_edgehash_clear_ex(EdgeHash *eh,
+ EdgeHashFreeFP valfreefp,
+ const unsigned int nentries_reserve);
+void BLI_edgehash_clear(EdgeHash *eh, EdgeHashFreeFP valfreefp);
+
+EdgeHashIterator *BLI_edgehashIterator_new(EdgeHash *eh) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
+void BLI_edgehashIterator_init(EdgeHashIterator *ehi, EdgeHash *eh);
+void BLI_edgehashIterator_free(EdgeHashIterator *ehi);
+
+BLI_INLINE void BLI_edgehashIterator_step(EdgeHashIterator *ehi)
+{
+ ehi->index++;
+}
+BLI_INLINE bool BLI_edgehashIterator_isDone(EdgeHashIterator *ehi)
+{
+ return ehi->index >= ehi->length;
+}
+BLI_INLINE void BLI_edgehashIterator_getKey(EdgeHashIterator *ehi,
+ unsigned int *r_v0,
+ unsigned int *r_v1)
+{
+ struct _EdgeHash_Edge edge = ehi->entries[ehi->index].edge;
+ *r_v0 = edge.v_low;
+ *r_v1 = edge.v_high;
+}
+BLI_INLINE void *BLI_edgehashIterator_getValue(EdgeHashIterator *ehi)
+{
+ return ehi->entries[ehi->index].value;
+}
BLI_INLINE void **BLI_edgehashIterator_getValue_p(EdgeHashIterator *ehi)
-{ return &ehi->entries[ehi->index].value; }
-BLI_INLINE void BLI_edgehashIterator_setValue(EdgeHashIterator *ehi, void *val)
-{ ehi->entries[ehi->index].value = val; }
+{
+ return &ehi->entries[ehi->index].value;
+}
+BLI_INLINE void BLI_edgehashIterator_setValue(EdgeHashIterator *ehi, void *val)
+{
+ ehi->entries[ehi->index].value = val;
+}
-
-#define BLI_EDGEHASH_SIZE_GUESS_FROM_LOOPS(totloop) ((totloop) / 2)
-#define BLI_EDGEHASH_SIZE_GUESS_FROM_POLYS(totpoly) ((totpoly) * 2)
+#define BLI_EDGEHASH_SIZE_GUESS_FROM_LOOPS(totloop) ((totloop) / 2)
+#define BLI_EDGEHASH_SIZE_GUESS_FROM_POLYS(totpoly) ((totpoly)*2)
/* *** EdgeSet *** */
@@ -94,29 +115,39 @@ struct EdgeSet;
typedef struct EdgeSet EdgeSet;
typedef struct EdgeSetIterator {
- struct _EdgeHash_Edge *edges;
- uint length;
- uint index;
+ struct _EdgeHash_Edge *edges;
+ uint length;
+ uint index;
} EdgeSetIterator;
-EdgeSet *BLI_edgeset_new_ex(const char *info,
- const unsigned int nentries_reserve) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
+EdgeSet *BLI_edgeset_new_ex(const char *info, const unsigned int nentries_reserve)
+ ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
EdgeSet *BLI_edgeset_new(const char *info) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT;
-int BLI_edgeset_len(EdgeSet *es) ATTR_WARN_UNUSED_RESULT;
-bool BLI_edgeset_add(EdgeSet *es, unsigned int v0, unsigned int v1);
-void BLI_edgeset_insert(EdgeSet *es, unsigned int v0, unsigned int v1);
-bool BLI_edgeset_haskey(EdgeSet *es, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
-void BLI_edgeset_free(EdgeSet *es);
+int BLI_edgeset_len(EdgeSet *es) ATTR_WARN_UNUSED_RESULT;
+bool BLI_edgeset_add(EdgeSet *es, unsigned int v0, unsigned int v1);
+void BLI_edgeset_insert(EdgeSet *es, unsigned int v0, unsigned int v1);
+bool BLI_edgeset_haskey(EdgeSet *es, unsigned int v0, unsigned int v1) ATTR_WARN_UNUSED_RESULT;
+void BLI_edgeset_free(EdgeSet *es);
/* rely on inline api for now */
EdgeSetIterator *BLI_edgesetIterator_new(EdgeSet *gs);
void BLI_edgesetIterator_free(EdgeSetIterator *esi);
-BLI_INLINE void BLI_edgesetIterator_getKey(EdgeSetIterator *esi, unsigned int *r_v0, unsigned int *r_v1)
-{ struct _EdgeHash_Edge edge = esi->edges[esi->index]; *r_v0 = edge.v_low; *r_v1 = edge.v_high; }
+BLI_INLINE void BLI_edgesetIterator_getKey(EdgeSetIterator *esi,
+ unsigned int *r_v0,
+ unsigned int *r_v1)
+{
+ struct _EdgeHash_Edge edge = esi->edges[esi->index];
+ *r_v0 = edge.v_low;
+ *r_v1 = edge.v_high;
+}
BLI_INLINE void BLI_edgesetIterator_step(EdgeSetIterator *esi)
-{ esi->index++; }
+{
+ esi->index++;
+}
BLI_INLINE bool BLI_edgesetIterator_isDone(EdgeSetIterator *esi)
-{ return esi->index >= esi->length; }
+{
+ return esi->index >= esi->length;
+}
-#endif /* __BLI_EDGEHASH_H__ */
+#endif /* __BLI_EDGEHASH_H__ */
generated by cgit v1.2.3 (git 2.25.1) at 2024-07-09 17:37:38 +0300