| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2019-04-20 | Cleanup: add missing macros to clang-format | Campbell Barton | |
| 2019-04-17 | ClangFormat: apply to source, most of intern | Campbell Barton | |
| Apply clang format as proposed in T53211. For details on usage and instructions for migrating branches without conflicts, see: https://wiki.blender.org/wiki/Tools/ClangFormat | |||
| 2019-04-14 | Cleanup: doxy comments | Campbell Barton | |
| Use doxy references to function and enums, also correct some names which became out of sync. | |||
| 2019-03-27 | Cleanup: style, use braces for blenlib | Campbell Barton | |
| 2019-02-18 | doxygen: add newline after \file | Campbell Barton | |
| While \file doesn't need an argument, it can't have another doxy command after it. | |||
| 2019-02-06 | Cleanup: remove redundant doxygen \file argument | Campbell Barton | |
| Move \ingroup onto same line to be more compact and make it clear the file is in the group. | |||
| 2019-02-01 | Cleanup: remove redundant, invalid info from headers | Campbell Barton | |
| BF-admins agree to remove header information that isn't useful, to reduce noise. - BEGIN/END license blocks Developers should add non license comments as separate comment blocks. No need for separator text. - Contributors This is often invalid, outdated or misleading especially when splitting files. It's more useful to git-blame to find out who has developed the code. See P901 for script to perform these edits. | |||
| 2018-12-17 | Fix T59404: Mistake in recent EdgeHash refactor broke edge generations in ↵ | Bastien Montagne | |
| mesh validate code. | |||
| 2018-12-13 | Cleanup: macro hygiene, style, doxy comments | Campbell Barton | |
| 2018-12-13 | BLI_edgehash: assert when edges use the same vert | Campbell Barton | |
| This was removed on the recent upgrade. | |||
| 2018-12-13 | BLI: New Edgehash and EdgeSet implementation | Jacques Lucke | |
| The new data structure uses open addressing instead of chaining to resolve collisions in the hash table. This new structure was never slower than the old implementation in my tests. Code that first inserts all edges and then iterates through all edges (e.g. to remove duplicates) benefits the most, because the `EdgeHashIterator` becomes a simple for loop over a continuous array. Reviewer: campbellbarton Differential Revision: D4050 | |||
| 2018-12-12 | Merge branch 'master' into blender2.8 | Campbell Barton | |
| 2018-12-12 | Cleanup: use colon separator after parameter | Campbell Barton | |
| Helps separate variable names from descriptive text. Was already used in some parts of the code, double space and dashes were used elsewhere. | |||
| 2018-10-18 | Cleanup: Remove more #if 0 blocks | Jacques Lucke | |
| Continuation of https://developer.blender.org/D3802 Reviewers: brecht Differential Revision: https://developer.blender.org/D3808 | |||
| 2018-02-15 | Cleanup: use '_len' instead of '_size' w/ BLI API | Campbell Barton | |
| - When returning the number of items in a collection use BLI_*_len() - Keep _size() for size in bytes. - Keep _count() for data structures that don't store length (hint this isn't a simple getter). See P611 to apply instead of manually resolving conflicts. | |||
| 2017-10-28 | Cleanup: use uint type in BLI | Campbell Barton | |
| 2015-12-12 | Correct own mistake in 3e499c1a | Campbell Barton | |
| 2015-11-29 | Cleanup: sync edgehash w/ ghash remove logic | Campbell Barton | |
| 2015-11-29 | Cleanup: rename `hash` -> `bucket_index`, edgehash API | Campbell Barton | |
| Was confusing since a hash isn't typically used as an index on its own. Also C99 for loop for bucket resize loop. | |||
| 2015-11-29 | Cleanup: ghash/edgehash style | Campbell Barton | |
| Call functions on own lines (nicer for debugging) | |||
| 2015-05-20 | doxygen: corrections/updates | Campbell Barton | |
| Also add depsgraph & physics | |||
| 2015-04-09 | Remove invalid assert | Campbell Barton | |
| 2015-04-07 | EdgeHash: ensure function, avoids multiple lookups | Campbell Barton | |
| 2014-12-18 | cleanup: use const for smallhash & minor edits | Campbell Barton | |
| 2014-12-17 | Docs: comments (hash table & beauty fill) | Campbell Barton | |
| 2014-12-09 | Add edgehash remove, clear functions, Heap clear | Campbell Barton | |
| Edgehash was missing removal functions (remove, popkey, clear), since it wasn't needed so far, but is based on same code as ghash which has them. also add heap clear() method so we can reuse heaps. (needed for upcoming fix). | |||
| 2014-08-12 | GHash: add flag get/set for gset | Campbell Barton | |
| 2014-08-07 | GHash/EdgeHash: avoid NULL check on iterator init | Campbell Barton | |
| 2014-07-15 | Edgehash: Improve magic number for hashing | Campbell Barton | |
| Gives consistently better results. Tested with wide variety of meshes. | |||
| 2014-07-14 | GHash, EdgeHash: add debugging function to measure the hash quality | Campbell Barton | |
| Can use to check on improvements to hash functions. | |||
| 2014-07-14 | Remove redundant NULL check | Campbell Barton | |
| 2014-06-13 | GSet, GHash: Add BLI_gset_add, since its common to add members to a set | Campbell Barton | |
| also rename BLI_edgeset_reinsert -> BLI_edgeset_add, in this case its the same. | |||
| 2014-04-21 | GHash, Edgehash: add lookup_default() funcs. | Campbell Barton | |
| Returns a fallback argument when the key isn't found. | |||
| 2014-04-20 | GHash, EdgeHash: hint on unlikely branch | Campbell Barton | |
| also avoid searching buckets for empty hashes | |||
| 2014-04-08 | GHash/Edgehash: make simple iterator checking functions inline. | Campbell Barton | |
| also remove NULL check, only a few areas made use of this. | |||
| 2014-04-08 | Mempool: delay allocating an initial chunk, its not always used | Campbell Barton | |
| 2014-04-05 | Mempool: remove BLI_MEMPOOL_SYSMALLOC, MEM_* allocs are more efficient now | Campbell Barton | |
| 2014-03-15 | Code cleanup: use r_ prefix for return args | Campbell Barton | |
| 2014-01-21 | Replace XOR swapping by default ("naive", with extra var) one. | Bastien Montagne | |
| Ref: http://en.wikipedia.org/wiki/XOR_swap_algorithm, modern compilers/CPUs are much more efficient with "naive" algo than XOR one. Doubled check, for me in an optimized build, XOR is several times slower than naive algo. | |||
| 2013-11-01 | code cleanup: spelling | Campbell Barton | |
| 2013-09-02 | add hash iterator functions to access the pointer to the value. | Campbell Barton | |
| 2013-09-01 | move strict compiler checks into a header so its easier to manage in one ↵ | Campbell Barton | |
| place (pragmas were copied around). also enable more strict warnings for BLF (which had some incorrect casts). | |||
| 2013-08-31 | mempool internal change, use unsigned ints where possible (less overhead), | Campbell Barton | |
| also quiet compiler warning for BLI_LINKSTACK_FREE macro. | |||
| 2013-08-26 | internal changes to ghash/edgehash, reorganize to split out resizing the ↵ | Campbell Barton | |
| hash from insertion. | |||
| 2013-08-26 | add some safety checks in debug mode to ensure sets/hashes aren't confused. | Campbell Barton | |
| 2013-08-26 | minor changes to edgehassh/ghash | Campbell Barton | |
| - no need to zero vars when freeing ghash - de duplicate ghash remove code. - edgehash clear now works more like ghash. | |||
| 2013-08-26 | replace hashes with sets where possible. | Campbell Barton | |
| 2013-08-26 | BKI_gset and EdgeSet api, use when hash values aren't used (reuses ghash ↵ | Campbell Barton | |
| internally without allocating space for the value). | |||
| 2013-08-25 | clearing the mempool can now keep more then a single element reserved. | Campbell Barton | |
| 2013-08-25 | doxygen docs for ghash/edgehash | Campbell Barton | |
Welcome to mirror list, hosted at ThFree Co, Russian Federation.
 |
index : git.blender.org/blender.git | |
| Unnamed repository; edit this file 'description' to name the repository. | www-data |
| summaryrefslogtreecommitdiff |