Index: /trunk/MagicSoft/Mars/Changelog
===================================================================
--- /trunk/MagicSoft/Mars/Changelog	(revision 1203)
+++ /trunk/MagicSoft/Mars/Changelog	(revision 1204)
@@ -1,3 +1,16 @@
                                                                   -*-*- END -*-*-
+
+ 2002/01/21: Thomas Bretz
+ 
+   * mbase/MReadMarsFile.cc, mbase/MReadTree.[h,cc]:
+     - implemented GetFileName
+
+   * mmc/MMcEvt.[hxx,cxx]
+     - implemented WriteAscii
+   
+   * mgui/MGeomPix.h:
+     - implemented first version of GetA
+
+
 
  2002/01/19: Thomas Bretz
Index: /trunk/MagicSoft/Mars/mgui/MGeomPix.h
===================================================================
--- /trunk/MagicSoft/Mars/mgui/MGeomPix.h	(revision 1203)
+++ /trunk/MagicSoft/Mars/mgui/MGeomPix.h	(revision 1204)
@@ -9,7 +9,7 @@
 { 
 private:
-    Float_t fX;  // the x coordinate
-    Float_t fY;  // the y coordinate
-    Float_t fR;  // the r coordinate
+    Float_t fX;  // [mm] the x coordinate
+    Float_t fY;  // [mm] the y coordinate
+    Float_t fR;  // [mm] the r coordinate
 
     Byte_t  fNumNeighbors; // number of valid neighbors
@@ -22,12 +22,12 @@
     void Print(Option_t *opt=NULL) const;
 
-    void Set (Float_t x, Float_t y, Float_t r) { fX=x; fY=y; fR=r; }
+    void Set(Float_t x, Float_t y, Float_t r) { fX=x; fY=y; fR=r; }
 
     void SetNeighbors(Short_t i0=-1, Short_t i1=-1, Short_t i2=-1,
                       Short_t i3=-1, Short_t i4=-1, Short_t i5=-1);
 
-    void SetX (Float_t x) { fX = x; }
-    void SetY (Float_t y) { fY = y; }
-    void SetR (Float_t r) { fR = r; }
+    void SetX(Float_t x) { fX = x; }
+    void SetY(Float_t y) { fY = y; }
+    void SetR(Float_t r) { fR = r; }
 
     Float_t GetX() const  { return fX; }
@@ -35,5 +35,7 @@
     Float_t GetR() const  { return fR; }
 
-    Byte_t GetNumNeighbors() const { return fNumNeighbors; }
+    Float_t GetA() const  { return fR*fR*3; } // FIXME: Algorithm! A hexagonal shape is assumed!
+
+    Byte_t  GetNumNeighbors() const { return fNumNeighbors; }
     Short_t GetNeighbor(Byte_t i) const { return fNeighbors[i]; }
 
