// The first time we (try to) find a given horizon, our initial

// guess is likely to be rather inaccurate, so we may need a
// larger number of iterations.  But if we've found this horizon
// before, then we have its previous position as an initial guess,
// so we shouldn't need as many iterations.


git-svn-id: http://svn.einsteintoolkit.org/cactus/EinsteinAnalysis/AHFinderDirect/trunk@795 f88db872-0e4f-0410-b76b-b9085cfa78c5

2 files changed, 10 insertions, 3 deletions

diff --git a/doc/TODO b/doc/TODO
index 16b8704..d552d9c 100644
--- a/doc/TODO
+++ b/doc/TODO
@@ -1,6 +1,7 @@
 small things
   set centroid variables for drift correction
-  ??larger max_Newton_iterations for initial data than for time evolution??
+  somehow recover after we hit the edge of the grid
+    (right now we never move the trial horizon surface back again!)
   do we work properly with fisheye?
 
 medium things
diff --git a/doc/documentation.tex b/doc/documentation.tex
index 0774358..8226eaa 100644
--- a/doc/documentation.tex
+++ b/doc/documentation.tex
@@ -260,8 +260,14 @@ modern \Cplusplus{} compilers.  As to specific \Cplusplus{} features\dots
 	or other low-level stuff templated on the floating-point or
 	integer datatype, and these templates are always instantiated
 	explicitly.
-\item	\code{bool}, \code{mutable}, and \code{typename}]
-	are used.
+\item	\code{bool}, \code{mutable}, and \code{typename} are used.
+\item	New-style casts are used, \eg{}
+	\begin{verbatim}
+	const CCTK_REAL* const_real_ptr(const void* vp)
+	{
+	return const_cast<const CCTK_REAL*>(vp);
+	}
+	\end{verbatim}
 \item	The code will work ok under either the archaic or the modern
 	\code{for}-loop declaration scope rules.
 \item	C header files are used in the pre-namespaces form