Changeset e2afced in git for Singular/MinorProcessor.h


Ignore:
Timestamp:
Oct 8, 2009, 12:11:57 PM (15 years ago)
Author:
Frank Seelisch <seelisch@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
0a52b49fcfbb9270ac1d60e85d52e30fd24bbd96
Parents:
967a9d48cc1d702f106bf47d327d87adbaf6833c
Message:
changes due to 32bit vs. 64bit (to make code run on compute servers)


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

Legend:

Unmodified
Added
Removed

  • Singular/MinorProcessor.h

    r967a9d re2afced  
    217217};
    218218
    219 class LongMinorProcessor : public MinorProcessor {
     219class IntMinorProcessor : public MinorProcessor {
    220220    private:
    221221        /**
    … …  
    236236        * @see MinorProcessor::getMinorPrivate (const int, const MinorKey&)
    237237        */
    238         LongMinorValue getMinorPrivate (const int k, const MinorKey& mk,
     238        IntMinorValue getMinorPrivate (const int k, const MinorKey& mk,
    239239                                        const bool multipleMinors,
    240                                         Cache<MinorKey, LongMinorValue>& c);
     240                                        Cache<MinorKey, IntMinorValue>& c);
    241241
    242242        /**
    … …  
    250250        * @see MinorProcessor::getMinorPrivate (const int, const MinorKey&, const bool, Cache<MinorKey, MinorValue>&)
    251251        */
    252         LongMinorValue getMinorPrivate (const int k, const MinorKey& mk);
     252        IntMinorValue getMinorPrivate (const int k, const MinorKey& mk);
    253253    protected:
    254254        bool isEntryZero (const int absoluteRowIndex, const int absoluteColumnIndex) const;
    … …  
    257257        * A constructor for creating an instance.
    258258        */
    259         LongMinorProcessor ();
     259        IntMinorProcessor ();
    260260
    261261        /**
    262262        * A destructor for deleting an instance.
    263263        */
    264         ~LongMinorProcessor ();
     264        ~IntMinorProcessor ();
    265265
    266266        /**
    … …  
    277277        * The sub-matrix is determined by \c rowIndices and \c columnIndices. Computation works recursively
    278278        * using Laplace's Theorem. We always develop along the row or column with most zeros; see
    279         * MinorProcessor::getBestLine (const int, const unsigned long, const unsigned long).
     279        * MinorProcessor::getBestLine (const int, const int, const int).
    280280        * @param dimension the size of the minor to be computed
    281281        * @param rowIndices 0-based indices of the rows of the minor
    … …  
    284284        * @see MinorProcessor::getMinor (const int, const int*, const int*, Cache<MinorKey, MinorValue>&)
    285285        */
    286         LongMinorValue getMinor (const int dimension, const int* rowIndices, const int* columnIndices);
     286        IntMinorValue getMinor (const int dimension, const int* rowIndices, const int* columnIndices);
    287287
    288288        /**
    … …  
    290290        * The sub-matrix is determined by \c rowIndices and \c columnIndices. Computation works recursively
    291291        * using Laplace's Theorem. We always develop along the row or column with most zeros; see
    292         * MinorProcessor::getBestLine (const int, const unsigned long, const unsigned long).
     292        * MinorProcessor::getBestLine (const int, const int, const int).
    293293        * @param dimension the size of the minor to be computed
    294294        * @param rowIndices 0-based indices of the rows of the minor
    … …  
    298298        * @see MinorProcessor::getMinor (const int, const int*, const int*)
    299299        */
    300         LongMinorValue getMinor (const int dimension, const int* rowIndices, const int* columnIndices,
    301                                  Cache<MinorKey, LongMinorValue>& c);
     300        IntMinorValue getMinor (const int dimension, const int* rowIndices, const int* columnIndices,
     301                                 Cache<MinorKey, IntMinorValue>& c);
    302302
    303303        /**
    … …  
    311311        * @see MinorProcessor::hasNextMinor ()
    312312        */
    313         LongMinorValue getNextMinor ();
     313        IntMinorValue getNextMinor ();
    314314
    315315        /**
    … …  
    324324        * @see MinorProcessor::hasNextMinor ()
    325325        */
    326         LongMinorValue getNextMinor (Cache<MinorKey, LongMinorValue>& c);
     326        IntMinorValue getNextMinor (Cache<MinorKey, IntMinorValue>& c);
    327327
    328328        /**
    … …  
    393393        * The sub-matrix is determined by \c rowIndices and \c columnIndices. Computation works recursively
    394394        * using Laplace's Theorem. We always develop along the row or column with most zeros; see
    395         * MinorProcessor::getBestLine (const int, const unsigned long, const unsigned long).
     395        * MinorProcessor::getBestLine (const int, const int, const int).
    396396        * @param dimension the size of the minor to be computed
    397397        * @param rowIndices 0-based indices of the rows of the minor
    … …  
    406406        * The sub-matrix is determined by \c rowIndices and \c columnIndices. Computation works recursively
    407407        * using Laplace's Theorem. We always develop along the row or column with most zeros; see
    408         * MinorProcessor::getBestLine (const int, const unsigned long, const unsigned long).
     408        * MinorProcessor::getBestLine (const int, const int, const int).
    409409        * @param dimension the size of the minor to be computed
    410410        * @param rowIndices 0-based indices of the rows of the minor
Note: See TracChangeset for help on using the changeset viewer.