git-svn-id: http://root.cern.ch/svn/root/trunk@23548 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23525 27541ba8-7e3a-0410-8455-c3a389f83636

- fix for -Wshadow


git-svn-id: http://root.cern.ch/svn/root/trunk@23524 27541ba8-7e3a-0410-8455-c3a389f83636

- rename variable "Name" to "name"
- rename also methods like a(), b() , x() to X() , A(), B() to be consistent with ROOT coding convention


git-svn-id: http://root.cern.ch/svn/root/trunk@23522 27541ba8-7e3a-0410-8455-c3a389f83636

 For other new feature of this version see the file math/unuran/src/unuran-1.2.3-root/NEWS
 
- fix also a compilation problem for the test on gcc 4.3
- improve distclean-unuran target. Remove also old directories


git-svn-id: http://root.cern.ch/svn/root/trunk@23502 27541ba8-7e3a-0410-8455-c3a389f83636

Fix shadowed variables


git-svn-id: http://root.cern.ch/svn/root/trunk@23492 27541ba8-7e3a-0410-8455-c3a389f83636

  make now consistent with original Fortran code 
(available at Phystat : https://plone4.fnal.gov/P0/phystat/packages/0707001/1.1.0/view )


git-svn-id: http://root.cern.ch/svn/root/trunk@23481 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23477 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23475 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23472 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23471 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23440 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23431 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23414 27541ba8-7e3a-0410-8455-c3a389f83636

Add a new method in the C++ exported NN function that takes an array as input.


git-svn-id: http://root.cern.ch/svn/root/trunk@23260 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23092 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@23073 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22957 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22954 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22926 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22924 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22920 27541ba8-7e3a-0410-8455-c3a389f83636

- fix problem building dictionary library for testIO


git-svn-id: http://root.cern.ch/svn/root/trunk@22918 27541ba8-7e3a-0410-8455-c3a389f83636

- appl fix from Harals Soleng (bug https://savannah.cern.ch/bugs/index.php?35076 ) for operator+ between 2 matrix expressions


git-svn-id: http://root.cern.ch/svn/root/trunk@22916 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22910 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22901 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22886 27541ba8-7e3a-0410-8455-c3a389f83636

   mathcore
   mathmore
   fftw
   foam
   fumili
   genvector
   matrix
   minuit
   minuit2
   mlp
   physics
   smatrix
   splot
   unuran
   quadp


git-svn-id: http://root.cern.ch/svn/root/trunk@22885 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22867 27541ba8-7e3a-0410-8455-c3a389f83636

anyway). Include paths remain the same.


git-svn-id: http://root.cern.ch/svn/root/trunk@22866 27541ba8-7e3a-0410-8455-c3a389f83636

- remove TMathImp.h file to fix documentaiton problem
- change name for class GaussIntegratorOneDim to GaussIntegrator


git-svn-id: http://root.cern.ch/svn/root/trunk@22728 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22528 27541ba8-7e3a-0410-8455-c3a389f83636

 
- merge classes from math (TMath, TComplex and TRandom) in libMathCore
- change various functions of TMath (work from David ):
	- make a single template functions for all the various types (like Sort or Binart Search) 
        - use std implementations for Sort, BinarySearch, LocMin
        - use mathcore special functions for Gamma and Beta functions 

- remove genvector from mathcore
- add classes for integration, derivation and root findings using the algorithms of TF1
-  use the plug-in manager to instantiates different implementations of the same classes in MathMore


git-svn-id: http://root.cern.ch/svn/root/trunk@22518 27541ba8-7e3a-0410-8455-c3a389f83636

ROOT can not be compiled with gcc-4.3.
Some ROOT source files doesn't contain required #include directives,
for example, they use strlen(), but #include <string.h> is missed or
malloc() is used and #include <stdlib.h> is missed. 

Earlier versions of gcc allowed some headers to be included implicitly,
but issued a warning (-Wimplicit-function-declaration). Newer one,
gcc-4.3 denies such silly behaviour: all required headers must be explicitly
included. 

Attached patch fixes this. Also it fixes another issue, which disallows
ROOT to compile under gcc-4.3: C functions don't belong to namespace std,
so expressions like std::memcpy() are no longer valid and plain memcpy()
should be used instead.


git-svn-id: http://root.cern.ch/svn/root/trunk@22419 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@22168 27541ba8-7e3a-0410-8455-c3a389f83636

this patch prevents all dictionaries from being rebuild when non dict related
changes are made in CINT. When the dictionaries change the new
cint/inc/cintdictversion.h must be updated which triggers a dictionary
rebuild. For example:
touch cint/src/v6_var.cxx && make: rebuild no dictionaries
touch cint/inc/cintdictversion.h && make: rebuild all dictionaries
touch utils/src/rootcint.cxx && make: rebuild all dictionaries


git-svn-id: http://root.cern.ch/svn/root/trunk@21802 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@21322 27541ba8-7e3a-0410-8455-c3a389f83636

git-svn-id: http://root.cern.ch/svn/root/trunk@21169 27541ba8-7e3a-0410-8455-c3a389f83636

* implement rebinning, add, multiply, divide (incl. binomial)
* fix error calculation, now similar to TH1 etc
* allow for non-equal bin sizes: call constructor without bin edges,
call SetBinEdges() afterwards


git-svn-id: http://root.cern.ch/svn/root/trunk@21041 27541ba8-7e3a-0410-8455-c3a389f83636

//
//  Method Improvement by Jason A Detwiler (JADetwiler@lbl.gov)
//  -----------------------------------------------------------
//   The nuts-and-bolts of the TMath::KolmogorovTest() algorithm is a for-loop
//   over the two sorted arrays a and b representing empirical distribution
//   functions. The for-loop handles 3 cases: when the next points to be 
//   evaluated satisfy a>b, a<b, or a=b:
//    
//      for (Int_t i=0;i<na+nb;i++) {
//         if (a[ia-1] < b[ib-1]) {
//            rdiff -= sa;
//            ia++;
//            if (ia > na) {ok = kTRUE; break;}
//         } else if (a[ia-1] > b[ib-1]) {
//            rdiff += sb;
//            ib++;
//            if (ib > nb) {ok = kTRUE; break;}
//         } else {
//            rdiff += sb - sa;
//            ia++;
//            ib++;
//            if (ia > na) {ok = kTRUE; break;}
//            if (ib > nb) {ok = kTRUE; break;}
//        }
//         rdmax = TMath::Max(rdmax,TMath::Abs(rdiff));
//      }
//    
//   For the last case, a=b, the algorithm advances each array by one index in an
//   attempt to move through the equality. However, this is incorrect when one or
//   the other of a or b (or both) have a repeated value, call it x. For the KS
//   statistic to be computed properly, rdiff needs to be calculated after all of
//   the a and b at x have been tallied (this is due to the definition of the
//   empirical distribution function; another way to convince yourself that the
//   old CERNLIB method is wrong is that it implies that the function defined as the
//   difference between a and b is multi-valued at x -- besides being ugly, this
//   would invalidate Kolmogorov's theorem).
//    
//   The solution is to just add while-loops into the equality-case handling to
//   perform the tally:
//    
//         } else {
//            double x = a[ia-1];
//            while(a[ia-1] == x && ia <= na) {
//              rdiff -= sa;
//              ia++;
//            }
//            while(b[ib-1] == x && ib <= nb) {
//              rdiff += sb;
//              ib++;
//            }
//            if (ia > na) {ok = kTRUE; break;}
//            if (ib > nb) {ok = kTRUE; break;}
//         }


git-svn-id: http://root.cern.ch/svn/root/trunk@21031 27541ba8-7e3a-0410-8455-c3a389f83636