Changes between Version 3 and Version 4 of guiNeaPig/BeamInteraction
- Timestamp:
- Oct 7, 2008, 5:10:55 PM (16 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
guiNeaPig/BeamInteraction
v3 v4 15 15 16 16 each slice-step is defined by two values : ''firstSliceOfBeam1'' and ''lastSliceOfBeam2'', treating pairs (''SliceOfBeam1-SliceOfBeam2''), with ''SliceOfBeam1'' running in increasing order from ''firstSliceOfBeam1'' to ''min(n_slice, lastSliceOfBeam2)'' and ''SliceOfBeam2'' running in decreasing order from ''lastSliceOfBeam2'' to ''firstSliceOfBeam1''. The number of pairs at each slice_step is : ''firstSliceOfBeam1 + lastSliceOfBeam2 + 1''. 17 A slice-step consists of a call to the GUINEA-method : iteration_on_overlaping_slices(int firstSliceOfBeam1, int lastSliceOfBeam2,...) or iteration_on_overlaping_slices_with_trackpair(...,int firstSliceOfBeam1, int lastSliceOfBeam2,...) 17 18 19 Each slice-step (in methods iteration_on_overlaping_slices or iteration_on_overlaping_slices_with_trackpair) is computed by splitting into 'time-steps' (the number of time steps per slice-steps is given through the keyword 'n_t' in the file acc.dat). 20 One of these 'time-steps' is a call to the GUINEA-method : make_time_step_on_slices(unsigned int firstSliceOfBeam1, unsigned int lastSliceOfBeam2, ...). 21 Finally, the interaction of a single pair (''sliceOfBeam1''-''sliceOfBeam2'') is realized by a call to the GUINEA-method : 18 22 19 Each slice-step is computed by splitting into 'time-steps' (the number of time steps per slice-steps is given through the keyword 'n_t' in the file acc.dat). 23 [wiki:guiNeaPig/MakeStep make_step(int sliceOfBeam1, int sliceOfBeam2,...)]