1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
/*************************************************************************
* Copyright (C) 2008 by Sergei Dorofeenko *
* sega@users.berlios.de *
* *
* This program is free software; it is licensed under the terms of the *
* GNU General Public License v2 or later. See file LICENSE for details. *
*************************************************************************/
#pragma once
#include <core/InteractionContainer.hpp>
#include <pkg/common/Collider.hpp>
#include <vector>
namespace yade { // Cannot have #include directive inside.
class SpatialQuickSortCollider : public Collider {
protected:
struct AABBBound {
Vector3r min, max;
int id;
};
class xBoundComparator {
public:
bool operator()(shared_ptr<AABBBound> b1, shared_ptr<AABBBound> b2) { return b1->min[0] < b2->min[0]; }
};
vector<shared_ptr<AABBBound>> rank;
public:
void action() override;
// clang-format off
YADE_CLASS_BASE_DOC(SpatialQuickSortCollider,Collider,"Collider using quicksort along axes at each step, using :yref:`Aabb` bounds. \n\n Its performance is lower than that of :yref:`InsertionSortCollider` (see `Colliders' performance <https://yade-dem.org/wiki/Colliders_performace>`_), but the algorithm is simple enought to make it good for checking other collider's correctness.");
// clang-format on
DECLARE_LOGGER;
};
REGISTER_SERIALIZABLE(SpatialQuickSortCollider);
} // namespace yade
|
