X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fadd.cpp;h=0f25d2dc7a444a29fa11d513dad89ea6e896cc14;hp=9d054379aa5c24781ad5697fac9d72171bb1bdd7;hb=8bcccf834ad41e94a1a4f3a0304c2945b228b4f4;hpb=66c0f31c678e6c1938d637636b230ea376c157c1

diff --git a/ginac/add.cpp b/ginac/add.cpp
index 9d054379..0f25d2dc 100644
--- a/ginac/add.cpp
+++ b/ginac/add.cpp
@@ -1,7 +1,8 @@
 /** @file add.cpp
  *
- *  Implementation of GiNaC's sums of expressions.
- *
+ *  Implementation of GiNaC's sums of expressions. */
+
+/*
  *  GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
@@ -24,6 +25,9 @@
 
 #include "add.h"
 #include "mul.h"
+#include "debugmsg.h"
+
+namespace GiNaC {
 
 //////////
 // default constructor, destructor, copy constructor assignment operator and helpers
@@ -419,9 +423,9 @@ ex add::eval(int level) const
 
 exvector add::get_indices(void) const
 {
-    // all terms in the sum should have the same indices (compatible tensors)
-    // however this is not checked, since there is no function yet which
-    // compares indices (idxvector can be unsorted) !!!!!!!!!!!
+    // FIXME: all terms in the sum should have the same indices (compatible
+    // tensors) however this is not checked, since there is no function yet
+    // which compares indices (idxvector can be unsorted)
     if (seq.size()==0) {
         return exvector();
     }
@@ -649,5 +653,4 @@ unsigned add::precedence=40;
 const add some_add;
 type_info const & typeid_add=typeid(some_add);
 
-
-
+} // namespace GiNaC