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 <ideasman42@gmail.com>2019-02-01 17:36:28 +0300
committerCampbell Barton <ideasman42@gmail.com>2019-02-01 17:36:28 +0300
commit65ec7ec524e667ec95ce947a95f6273088dffee6 (patch)
tree68e47c42cefed72c4d360b5b2f473b35cafd96eb /source/blender/blenlib/intern/BLI_kdopbvh.c
parent7b05b2564d8f7ebe915ba212c0dbaf40be568cfc (diff)
Cleanup: remove redundant, invalid info from headers
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.
Diffstat (limited to 'source/blender/blenlib/intern/BLI_kdopbvh.c')
-rw-r--r--source/blender/blenlib/intern/BLI_kdopbvh.c10
1 files changed, 0 insertions, 10 deletions
diff --git a/source/blender/blenlib/intern/BLI_kdopbvh.c b/source/blender/blenlib/intern/BLI_kdopbvh.c
index 621fb05b0f2..c7c9f035375 100644
--- a/source/blender/blenlib/intern/BLI_kdopbvh.c
+++ b/source/blender/blenlib/intern/BLI_kdopbvh.c
@@ -1,6 +1,4 @@
/*
- * ***** BEGIN GPL LICENSE BLOCK *****
- *
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
@@ -17,12 +15,6 @@
*
* The Original Code is Copyright (C) 2006 by NaN Holding BV.
* All rights reserved.
- *
- * The Original Code is: all of this file.
- *
- * Contributor(s): Daniel Genrich, Andre Pinto
- *
- * ***** END GPL LICENSE BLOCK *****
*/
/** \file blender/blenlib/intern/BLI_kdopbvh.c
@@ -611,8 +603,6 @@ static int implicit_leafs_index(const BVHBuildHelper *data, const int depth, con
* - No need to store child/parent relations (they are implicit);
* - Any node child always has an index greater than the parent;
* - Brother nodes are sequential in memory;
- *
- *
* Some math relations derived for general implicit trees:
*
* K = tree_type, ( 2 <= K )