Geant4 11.1.1
Toolkit for the simulation of the passage of particles through matter
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
G4KDMap.hh
Go to the documentation of this file.
1//
2// ********************************************************************
3// * License and Disclaimer *
4// * *
5// * The Geant4 software is copyright of the Copyright Holders of *
6// * the Geant4 Collaboration. It is provided under the terms and *
7// * conditions of the Geant4 Software License, included in the file *
8// * LICENSE and available at http://cern.ch/geant4/license . These *
9// * include a list of copyright holders. *
10// * *
11// * Neither the authors of this software system, nor their employing *
12// * institutes,nor the agencies providing financial support for this *
13// * work make any representation or warranty, express or implied, *
14// * regarding this software system or assume any liability for its *
15// * use. Please see the license in the file LICENSE and URL above *
16// * for the full disclaimer and the limitation of liability. *
17// * *
18// * This code implementation is the result of the scientific and *
19// * technical work of the GEANT4 collaboration. *
20// * By using, copying, modifying or distributing the software (or *
21// * any work based on the software) you agree to acknowledge its *
22// * use in resulting scientific publications, and indicate your *
23// * acceptance of all terms of the Geant4 Software license. *
24// ********************************************************************
25//
26// Author: Mathieu Karamitros
27
28// The code is developed in the framework of the ESA AO7146
29//
30// We would be very happy hearing from you, send us your feedback! :)
31//
32// In order for Geant4-DNA to be maintained and still open-source,
33// article citations are crucial.
34// If you use Geant4-DNA chemistry and you publish papers about your software,
35// in addition to the general paper on Geant4-DNA:
36//
37// Int. J. Model. Simul. Sci. Comput. 1 (2010) 157–178
38//
39// we would be very happy if you could please also cite the following
40// reference papers on chemistry:
41//
42// J. Comput. Phys. 274 (2014) 841-882
43// Prog. Nucl. Sci. Tec. 2 (2011) 503-508
44
45#ifndef G4ITMAPROOM_HH
46#define G4ITMAPROOM_HH
47
48#include <map>
49//#include <unordered_map>
50#include <vector>
51#include <deque>
52#include <cmath>
53#include <iostream>
54
55#include "G4Types.hh"
56
57class G4KDNode_Base;
58
60{
61public :
62 __1DSortOut(std::size_t dimension);
63 __1DSortOut(const __1DSortOut& right);
65 G4KDNode_Base* GetMidle(std::size_t& /*G4KDNode_deque*/);
66
67 std::deque<G4KDNode_Base*>::iterator Insert(G4KDNode_Base*);
69 void Sort();
70 void Erase(std::deque<G4KDNode_Base*>::iterator &);
71 std::size_t Size()
72 {
73 return fContainer.size();
74 }
75
76protected :
78 {
79 sortOutNDim(std::size_t dimension)
80 {
81 fDimension = dimension;
82 }
83 G4bool operator() (G4KDNode_Base* const& lhs, G4KDNode_Base* const& rhs);
84 std::size_t fDimension;
85 };
86
87 std::deque<G4KDNode_Base*> fContainer;
89};
90
92{
93public:
94 G4KDMap(std::size_t dimensions): fSortOut(dimensions, __1DSortOut(dimensions))
95 {
96 fIsSorted = false;
97// for(std::size_t i = 0 ; i < dimensions ; ++i)
98// {
99// fSortOut[i] = new __1DSortOut(i);
100// }
101 }
102
103 void Insert(G4KDNode_Base* pos);
104 void Sort();
105
106 G4KDNode_Base* PopOutMiddle(std::size_t dimension);
107 std::size_t GetDimension()
108 {
109 return fSortOut.size();
110 }
111
112 std::size_t GetSize()
113 {
114 return fMap.size();
115 }
116
117private:
118 G4bool fIsSorted;
119 std::vector<__1DSortOut> fSortOut;
120 std::map<G4KDNode_Base*, std::vector<std::deque<G4KDNode_Base*>::iterator>> fMap;
121
122 // A mettre directement dans G4KDNode
123};
124
125
126#endif // G4ITMAPROOM_HH
bool G4bool
Definition: G4Types.hh:86
int G4int
Definition: G4Types.hh:85
std::size_t GetDimension()
Definition: G4KDMap.hh:107
std::size_t GetSize()
Definition: G4KDMap.hh:112
void Insert(G4KDNode_Base *pos)
Definition: G4KDMap.cc:90
void Sort()
Definition: G4KDMap.cc:196
G4KDNode_Base * PopOutMiddle(std::size_t dimension)
Definition: G4KDMap.cc:137
G4KDMap(std::size_t dimensions)
Definition: G4KDMap.hh:94
G4KDNode_Base * GetMidle(std::size_t &)
Definition: G4KDMap.cc:56
std::deque< G4KDNode_Base * >::iterator Insert(G4KDNode_Base *)
Definition: G4KDMap.cc:63
G4KDNode_Base * PopOutMiddle()
Definition: G4KDMap.cc:68
G4int GetDimension()
Definition: G4KDMap.cc:51
void Erase(std::deque< G4KDNode_Base * >::iterator &)
Definition: G4KDMap.cc:85
void Sort()
Definition: G4KDMap.cc:80
std::size_t Size()
Definition: G4KDMap.hh:71
sortOutNDim fSortOutNDim
Definition: G4KDMap.hh:88
std::deque< G4KDNode_Base * > fContainer
Definition: G4KDMap.hh:87
G4bool operator()(G4KDNode_Base *const &lhs, G4KDNode_Base *const &rhs)
Definition: G4KDMap.cc:35
std::size_t fDimension
Definition: G4KDMap.hh:84
sortOutNDim(std::size_t dimension)
Definition: G4KDMap.hh:79