Changeset 9f2b6f in git for factory/templates/ftmpl_array.cc

Timestamp:

Jul 16, 1996, 2:24:57 PM (28 years ago)

Author:

Rüdiger Stobbe <stobbe@…>

Branches:

(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')

Children:

70161e0eb6f97b4a4008f8a9dee8629adf6bb83c

Parents:

b4e0579fccaa2c1ecd567dfc168f75ef1795e42c

Message:

"operators += and *= deleted sincethey are not needed in an general
array class als well as the functions sum, prod, crossprod.
"


git-svn-id: file:///usr/local/Singular/svn/trunk@45 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• factory/templates/ftmpl_array.cc (modified) (4 diffs)

factory/templates/ftmpl_array.cc

@@ -1 +1 @@
 // emacs edit mode for this file is -*- C++ -*-
-// $Id: ftmpl_array.cc,v 1.0 1996-05-17 11:06:32 stobbe Exp $
+// $Id: ftmpl_array.cc,v 1.1 1996-07-16 12:24:56 stobbe Exp $
 
 /*
 $Log: not supported by cvs2svn $
+Revision 1.0  1996/05/17 11:06:32  stobbe
+Initial revision
+
 */
 
@@ -116 +119 @@
 }
 
+/*
 template <class T>
 Array<T>& Array<T>::operator*= ( const T & t )
@@ -142 +146 @@
     return *this;
 }
+*/
 
 template <class T>
@@ -163 +168 @@
 }
 
-template <class T>
-T sum ( const Array<T> & a, int f, int l )
-{
-    if ( f < a.min() ) f = a.min();
-    if ( l > a.max() ) l = a.max();
-    T s = 0;
-    for ( int i = f; i <= l; i++ )
-        s += a[i];
-    return s;
-}
-
-template <class T>
-T prod ( const Array<T> & a, int f, int l )
-{
-    if ( f < a.min() ) f = a.min();
-    if ( l > a.max() ) l = a.max();
-    T p = 1;
-    for ( int i = f; i <= l; i++ )
-        p *= a[i];
-    return p;
-}
-
-template <class T>
-T sum ( const Array<T> & a )
-{
-    return sum( a, a.min(), a.max() );
-}
-
-template <class T>
-T prod ( const Array<T> & a )
-{
-    return prod( a, a.min(), a.max() );
-}
-
-
-template <class T>
-T crossprod ( const Array<T> & a, const Array<T> & b )
-{
-    if ( a.size() != b.size() ) {
-        cerr << "warning: array size mismatch." << endl;
-        return 0;
-    }
-    T s = 0;
-    int fa = a.min();
-    int fb = b.min();
-    int n = a.max();
-    for ( ; fa <= n; fa++, fb++ )
-        s += a[fa] * b[fb];
-    return s;
-}