Main Page   Class Hierarchy   Data Structures   File List   Data Fields   Globals  

hdyn_schedule.C File Reference

#include "hdyn.h"

Go to the source code of this file.

Data Structures

struct  node_time

Defines

#define M   7
#define NSTACK   128
#define MAX_COPY   256
#define NC   12
#define WHICH_SORT   4
#define N_ISORT   10

Functions

local void swap (node_time a[], int i, int j)
local void quicksort (node_time a[], int left, int right)
local void quicksort2 (node_time a[], int left, int right)
local void quicksort_nr (node_time arr[], int n)
local void heapsort (node_time arr[], int n)
void insertion_sort (node_time arr[], int n)
local void merge_sort (node_time arr[], int n, int np)
local void update_sort_counters (int n)
void print_sort_counters ()
local void print_sort_compare (node_time nodes[], int iprev, int icurr, char *s)
local void QS (node_time a[], int n, int np=0)
local void sort_node_array (node_time nodes[], int nprev, int nbody)
void clean_up_hdyn_schedule ()
void fast_get_nodes_to_move (hdyn *b, hdyn *list[], int &nlist, xreal &tmin, bool &reset)
void dump_node_list (int n)
void dump_node_list_for (char *s)


Define Documentation

#define M   7
 

Definition at line 144 of file hdyn_schedule.C.

#define MAX_COPY   256
 

Definition at line 279 of file hdyn_schedule.C.

#define NC   12
 

Definition at line 314 of file hdyn_schedule.C.

#define NSTACK   128
 

Definition at line 145 of file hdyn_schedule.C.

#define N_ISORT   10
 

Definition at line 367 of file hdyn_schedule.C.

#define WHICH_SORT   4
 

Definition at line 365 of file hdyn_schedule.C.


Function Documentation

local void QS ( node_time a[],
int n,
int np = 0 ) [inline]
 

Definition at line 371 of file hdyn_schedule.C.

Referenced by sort_node_array().

void clean_up_hdyn_schedule ( )
 

Definition at line 526 of file hdyn_schedule.C.

void dump_node_list ( int n )
 

Definition at line 620 of file hdyn_schedule.C.

void dump_node_list_for ( char * s )
 

Definition at line 633 of file hdyn_schedule.C.

void fast_get_nodes_to_move ( hdyn * b,
hdyn * list[],
int & nlist,
xreal & tmin,
bool & reset )
 

Definition at line 532 of file hdyn_schedule.C.

Referenced by check_and_remove_escapers().

local void heapsort ( node_time arr[],
int n )
 

Definition at line 222 of file hdyn_schedule.C.

Referenced by QS().

void insertion_sort ( node_time arr[],
int n ) [inline]
 

Definition at line 260 of file hdyn_schedule.C.

Referenced by QS().

local void merge_sort ( node_time arr[],
int n,
int np )
 

Definition at line 282 of file hdyn_schedule.C.

Referenced by QS().

local void print_sort_compare ( node_time nodes[],
int iprev,
int icurr,
char * s )
 

Definition at line 340 of file hdyn_schedule.C.

Referenced by sort_node_array().

void print_sort_counters ( )
 

Definition at line 330 of file hdyn_schedule.C.

Referenced by print_statistics().

local void quicksort ( node_time a[],
int left,
int right )
 

Definition at line 76 of file hdyn_schedule.C.

Referenced by QS().

local void quicksort2 ( node_time a[],
int left,
int right )
 

Definition at line 110 of file hdyn_schedule.C.

Referenced by QS(), and merge_sort().

local void quicksort_nr ( node_time arr[],
int n )
 

Definition at line 149 of file hdyn_schedule.C.

Referenced by QS().

local void sort_node_array ( node_time nodes[],
int nprev,
int nbody )
 

Definition at line 418 of file hdyn_schedule.C.

Referenced by fast_get_nodes_to_move().

local void swap ( node_time a[],
int i,
int j ) [inline]
 

Definition at line 63 of file hdyn_schedule.C.

Referenced by parse_command_line(), quicksort(), quicksort2(), quicksort_nr(), and sort_nodes_and_reduce_rnb().

local void update_sort_counters ( int n )
 

Definition at line 318 of file hdyn_schedule.C.

Referenced by sort_node_array().


Generated at Sun Feb 24 09:57:26 2002 for STARLAB by doxygen1.2.6 written by Dimitri van Heesch, © 1997-2001