Planet
navi homePPSaboutscreenshotsdownloaddevelopmentforum

source: code/branches/tetris/src/external/bullet/BulletCollision/CollisionDispatch/btUnionFind.cpp @ 8740

Last change on this file since 8740 was 5781, checked in by rgrieder, 15 years ago

Reverted trunk again. We might want to find a way to delete these revisions again (x3n's changes are still available as diff in the commit mails).

  • Property svn:eol-style set to native
File size: 2.0 KB
Line 
1/*
2Bullet Continuous Collision Detection and Physics Library
3Copyright (c) 2003-2006 Erwin Coumans  http://continuousphysics.com/Bullet/
4
5This software is provided 'as-is', without any express or implied warranty.
6In no event will the authors be held liable for any damages arising from the use of this software.
7Permission is granted to anyone to use this software for any purpose,
8including commercial applications, and to alter it and redistribute it freely,
9subject to the following restrictions:
10
111. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
122. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
133. This notice may not be removed or altered from any source distribution.
14*/
15
16#include "btUnionFind.h"
17
18
19
20btUnionFind::~btUnionFind()
21{
22        Free();
23
24}
25
26btUnionFind::btUnionFind()
27{ 
28
29}
30
31void    btUnionFind::allocate(int N)
32{
33        m_elements.resize(N);
34}
35void    btUnionFind::Free()
36{
37        m_elements.clear();
38}
39
40
41void    btUnionFind::reset(int N)
42{
43        allocate(N);
44
45        for (int i = 0; i < N; i++) 
46        { 
47                m_elements[i].m_id = i; m_elements[i].m_sz = 1; 
48        } 
49}
50
51
52class btUnionFindElementSortPredicate
53{
54        public:
55
56                bool operator() ( const btElement& lhs, const btElement& rhs )
57                {
58                        return lhs.m_id < rhs.m_id;
59                }
60};
61
62///this is a special operation, destroying the content of btUnionFind.
63///it sorts the elements, based on island id, in order to make it easy to iterate over islands
64void    btUnionFind::sortIslands()
65{
66
67        //first store the original body index, and islandId
68        int numElements = m_elements.size();
69       
70        for (int i=0;i<numElements;i++)
71        {
72                m_elements[i].m_id = find(i);
73                m_elements[i].m_sz = i;
74        }
75       
76         // Sort the vector using predicate and std::sort
77          //std::sort(m_elements.begin(), m_elements.end(), btUnionFindElementSortPredicate);
78          m_elements.quickSort(btUnionFindElementSortPredicate());
79
80}
81
Note: See TracBrowser for help on using the repository browser.