introduced nbnxn data structure for bounding boxes
authorBerk Hess <hess@kth.se>
Mon, 22 Jul 2013 12:54:49 +0000 (14:54 +0200)
committerGerrit Code Review <gerrit@gerrit.gromacs.org>
Sun, 25 Aug 2013 11:52:00 +0000 (13:52 +0200)
commitc0cf8ce09792eed64920a110ed3be6ff6844f293
treea4a3381b8007bb1b30e9b145c8ba2c55f4e12554
parent5162abc58656376130295e8f59b34f1c3b6f8bde
introduced nbnxn data structure for bounding boxes

The nbnxn search code now uses a well organized bounding box data
structure instead of a complicated indexed plain float array
for the cluster bounding boxes.

Change-Id: Ia5adf2d33d495cff3178ca950e8c16aefcfef1fb
src/mdlib/nbnxn_internal.h
src/mdlib/nbnxn_search.c
src/mdlib/nbnxn_search_simd_2xnn.h
src/mdlib/nbnxn_search_simd_4xn.h