Changeset e88604 in git


Ignore:
Timestamp:
May 8, 2012, 2:33:58 PM (12 years ago)
Author:
Martin Lee <martinlee84@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
c7417a693b6ec603fa87535be7e9ec143b3f1518
Parents:
0c4a5ce4e052f47dbeabb2611af8912452262861
git-author:
Martin Lee <martinlee84@web.de>2012-05-08 14:33:58+02:00
git-committer:
Martin Lee <martinlee84@web.de>2012-05-11 11:06:45+02:00
Message:
chg: deleted sparse modular gcd from sm_sparsemod.*
Location:
factory
Files:
4 deleted
4 edited

Legend:

Unmodified
Added
Removed
  • factory/Makefile.am

    r0c4a5ce re88604  
    9090                int_pp.cc \
    9191                int_rat.cc \
    92                 sm_sparsemod.cc \
    93                 sm_util.cc \
    9492                variable.cc \
    9593                NTLconvert.cc \
     
    175173                int_pp.h \
    176174                int_rat.h \
    177                 sm_sparsemod.h \
    178                 sm_util.h \
    179175                timing.h \
    180176                variable.h \
  • factory/cf_chinese.cc

    r0c4a5ce re88604  
    66// cf_chinese.cc - algorithms for chinese remaindering.
    77//
    8 // Used by: cf_gcd.cc, cf_linsys.cc, sm_util.cc
     8// Used by: cf_gcd.cc, cf_linsys.cc
    99//
    1010// Header file: cf_algorithm.h
  • factory/cf_gcd.cc

    r0c4a5ce re88604  
    688688// This is the dispatcher for polynomial gcd calculation.  We call either
    689689// ezgcd(), sparsemod() or gcd_poly1() in dependecy on the current
    690 // characteristic and settings of SW_USE_EZGCD and SW_USE_SPARSEMOD, resp.
     690// characteristic and settings of SW_USE_EZGCD.
    691691//
    692692// Used by gcd() and gcd_poly_univar0().
  • factory/cf_map.cc

    r0c4a5ce re88604  
    66// cf_map.cc - definition of class CFMap.
    77//
    8 // Used by: cf_gcd.cc, fac_multivar.cc, sm_sparsemod.cc
     8// Used by: cf_gcd.cc, fac_multivar.cc
    99//
    1010//}}}
Note: See TracChangeset for help on using the changeset viewer.