00001 // 00002 // ******************************************************************** 00003 // * License and Disclaimer * 00004 // * * 00005 // * The Geant4 software is copyright of the Copyright Holders of * 00006 // * the Geant4 Collaboration. It is provided under the terms and * 00007 // * conditions of the Geant4 Software License, included in the file * 00008 // * LICENSE and available at http://cern.ch/geant4/license . These * 00009 // * include a list of copyright holders. * 00010 // * * 00011 // * Neither the authors of this software system, nor their employing * 00012 // * institutes,nor the agencies providing financial support for this * 00013 // * work make any representation or warranty, express or implied, * 00014 // * regarding this software system or assume any liability for its * 00015 // * use. Please see the license in the file LICENSE and URL above * 00016 // * for the full disclaimer and the limitation of liability. * 00017 // * * 00018 // * This code implementation is the result of the scientific and * 00019 // * technical work of the GEANT4 collaboration. * 00020 // * By using, copying, modifying or distributing the software (or * 00021 // * any work based on the software) you agree to acknowledge its * 00022 // * use in resulting scientific publications, and indicate your * 00023 // * acceptance of all terms of the Geant4 Software license. * 00024 // ******************************************************************** 00025 // 00026 // $Id: G4KDTreeResult.hh 64057 2012-10-30 15:04:49Z gcosmo $ 00027 // 00028 // Author: Mathieu Karamitros (kara (AT) cenbg . in2p3 . fr) 00029 // 00030 // WARNING : This class is released as a prototype. 00031 // It might strongly evolve or even disapear in the next releases. 00032 // 00033 // History: 00034 // ----------- 00035 // 10 Oct 2011 M.Karamitros created 00036 // 00037 // ------------------------------------------------------------------- 00038 00039 #ifndef G4KDTREERESULT_HH 00040 #define G4KDTREERESULT_HH 00041 00042 #include <list> 00043 #include "globals.hh" 00044 #include "G4ReferenceCountedHandle.hh" 00045 class G4KDTree; 00046 class G4KDNode; 00047 struct ResNode; 00048 00049 class G4KDTreeResult; 00050 00051 typedef G4ReferenceCountedHandle<G4KDTreeResult> G4KDTreeResultHandle; 00052 typedef G4ReferenceCountedHandle<ResNode> ResNodeHandle; 00053 00059 class G4KDTreeResult : protected std::list<ResNode> 00060 { 00061 protected : 00062 G4KDTree *fTree; 00063 std::list<ResNode>::iterator fIterator; 00064 00065 public: 00066 G4KDTreeResult(G4KDTree*); 00067 virtual ~G4KDTreeResult(); 00068 00069 void Insert(double, G4KDNode*); 00070 00071 void Clear(); 00072 00073 void Sort(); 00074 00075 /* returns the size of the result set (in elements) */ 00076 size_t GetSize(); 00077 00078 size_t size(); 00079 00080 /* rewinds the result set iterator */ 00081 void Rewind(); 00082 00083 /* returns non-zero if the set iterator reached the end after the last element */ 00084 bool End(); 00085 00086 /* advances the result set iterator 00087 */ 00088 void Next(); 00089 00090 /* returns the data pointer (can be null) of the current result set item 00091 * and optionally sets its position to the pointers(s) if not null. 00092 */ 00093 void* GetItemData(); 00094 void* GetItem(double*& /*position*/); 00095 void* GetItem(double& x, double& y, double& z); // 3D 00096 void* GetItemNDistanceSQ(double& /*distance*/); 00097 void* GetItemNDistanceSQ(double*& /*position*/, double& /*distance*/); 00098 double GetDistanceSqr(); 00099 }; 00100 00101 #endif // G4KDTREERESULT_HH