lars/geant4
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Import Geant4 3.0.0 source tree

Browse Source
This commit is contained in:
Gabriele Cosmo
2016-06-08 15:55:53 +02:00
parent e7d7193284
commit cfcb558cfe
3050 changed files with 91703 additions and 48310 deletions
Download Patch File Download Diff File Expand all files Collapse all files
source/geometry/solids/BREPS/src/G4Sort.cc
+11 -16
View File
@@ -5,28 +5,27 @@
// based on the Program) you indicate your acceptance of this statement,
// and all its terms.
//
// $Id: G4Sort.cc,v 1.2 1999/12/15 14:50:02 gunter Exp $
// GEANT4 tag $Name: geant4-02-00 $
// $Id: G4Sort.cc,v 1.3 2000/08/28 08:57:59 gcosmo Exp $
// GEANT4 tag $Name: geant4-03-00 $
//
// File: G4Sort.cc
// Author: Alan Breakstone
// ----------------------------------------------------------------------
// GEANT 4 source file
//
// Description
//
// Routines to G4Sort arrays of various kinds of numbers
// G4Sort.cc
//
// ----------------------------------------------------------------------
#include "G4Sort.hh"
void G4Sort_double( G4double v[], int left, int right )
void sort_double( G4double v[], G4int left, G4int right )
{
// G4Sort elements in array from v[left] to v[right]
// used recursively
// algorithm comes from Kernighan and Ritchie, "The C Programming
// Language", second edition, p.87
int i, last;
G4int i, last;
if ( left >= right ) // do nothing if array contains
return; // fewer than two elements
@@ -39,13 +38,13 @@ void G4Sort_double( G4double v[], int left, int right )
swap_double( v, left, last ); // restore partition element
G4Sort_double( v, left, last-1 );
G4Sort_double( v, last+1, right );
sort_double( v, left, last-1 );
sort_double( v, last+1, right );
return;
}
void swap_double( G4double v[], int i, int j )
void swap_double( G4double v[], G4int i, G4int j )
{
/* interchange elements i and j in an array */
G4double temp;
@@ -53,7 +52,3 @@ void swap_double( G4double v[], int i, int j )
v[i] = v[j];
v[j] = temp;
}