[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-commits
Subject:    KDE/kdeedu/kstars/kstars/htmesh
From:       Alexey Khudyakov <alexey.skladnoy () gmail ! com>
Date:       2011-02-20 18:03:13
Message-ID: 20110220180313.35226AC8C4 () svn ! kde ! org
[Download RAW message or body]

SVN commit 1221838 by khudyakov:

Remove more dead code

 M  +1 -0      SpatialIndex.cpp  
 M  +1 -15     SpatialIndex.h  
 M  +0 -28     SpatialIndex.hxx  


--- trunk/KDE/kdeedu/kstars/kstars/htmesh/SpatialIndex.cpp #1221837:1221838
@@ -16,6 +16,7 @@
 //#
 
 #include "SpatialIndex.h"
+#include "SpatialException.h"
 
 #ifdef _WIN32
 #include <malloc.h>
--- trunk/KDE/kdeedu/kstars/kstars/htmesh/SpatialIndex.h #1221837:1221838
@@ -23,11 +23,8 @@
 #include <SpatialGeneral.h>
 #include <SpatialVector.h>
 #include <SpatialEdge.h>
-#include <SpatialException.h>
-  // begin add dcd
+
 #include <vector>
-#include <string>
-#include <algorithm>
 
 
 //########################################################################
@@ -94,17 +91,6 @@
   /// find a node by giving a ra,dec in degrees.
   uint64 idByPoint(const float64 & ra, const float64 & dec) const;
 
-  /// find a node by giving a vector. 
-  /**@return The ID of the node is returned. */
-  char* nameByPoint(SpatialVector & vector, char* s=NULL) const;
-
-  /// find a node by giving a ra,dec in degrees.
-  char* nameByPoint(const float64 & ra, const float64 & dec, 
-		    char* s=NULL) const;
-
-  /// return number of vertices
-  size_t nVertices() const;
-
   /// return the actual vertex vectors
   void nodeVertex(const uint64 id, 
      		  SpatialVector & v1, 
--- trunk/KDE/kdeedu/kstars/kstars/htmesh/SpatialIndex.hxx #1221837:1221838
@@ -10,15 +10,6 @@
 //#                     The Johns Hopkins University
 //#
 
-/////////////NVERTICES////////////////////////////////////
-// nVertices: return number of vertices
-inline size_t
-SpatialIndex::nVertices() const
-{
-  //dcdtmp return vertices_.length();
-	return vertices_.size();
-}
-
 //////////////////IDBYPOINT////////////////////////////////////////////////
 // Find a leaf node where a ra/dec points to
 inline uint64
@@ -26,22 +17,3 @@
   SpatialVector v(ra,dec);
   return idByPoint(v);
 }
-
-//////////////////NAMEBYPOINT//////////////////////////////////////////////
-// Find a leaf node where a ra/dec points to, return its name
-//
-
-inline char*
-SpatialIndex::nameByPoint(const float64 & ra, const float64 & dec, 
-			  char* name) const {
-  return nameById(idByPoint(ra,dec), name);
-}
-
-//////////////////NAMEBYPOINT//////////////////////////////////////////////
-// Find a leaf node where v points to, return its name
-//
-
-inline char*
-SpatialIndex::nameByPoint(SpatialVector & vector, char* name) const {
-  return nameById(idByPoint(vector),name);
-}
[prev in list] [next in list] [prev in thread] [next in thread]