source: git/libfac/factor.h @ f152c5

spielwiese
Last change on this file since f152c5 was f152c5, checked in by Hans Schoenemann <hannes@…>, 13 years ago
removed Factorize2 git-svn-id: file:///usr/local/Singular/svn/trunk@14303 2c84dea3-7e68-4137-9b89-c4e89433aadc
  • Property mode set to 100644
File size: 2.9 KB
Line 
1// Header file for libfac.a
2// Created by -- makeheader --
3// $Id$
4///////////////////////////////////////
5#ifndef FACTOR_H
6#define FACTOR_H
7
8#include <factory/factory.h>
9
10// Set this to a nonzero value to interrupt the computation
11extern int libfac_interruptflag;
12
13// some values you can ask for:
14extern const char * libfac_name;
15extern const char * libfac_version;
16extern const char * libfac_date;
17extern const char * libfac_author;
18
19CFFList Factorize( const CanonicalForm & F, const CanonicalForm & mipo, int is_SqrFree=0 ) ;
20CFFList newfactoras( const CanonicalForm & f, const CFList & as, int &success);
21CFFList newcfactor( const CanonicalForm & f, const CFList & as, int &success);
22
23//// Note: InternalSqrFree does only the work needed for factorization.
24// CFFList SqrFree( const CanonicalForm & f ) ;
25
26typedef List<CFList> ListCFList;
27typedef List<int> IntList ;
28typedef ListIterator<int> IntListIterator ;
29typedef List<Variable> Varlist;
30typedef ListIterator<Variable> VarlistIterator;
31
32////////////////////////////////////////
33/// from charsets:
34
35class PremForm {
36public:
37  CFList FS1;
38  CFList FS2;
39  inline PremForm& operator=( const PremForm&  value ){
40    if ( this != &value ){
41      FS1 = value.FS1;
42      FS2 = value.FS2;
43    }
44    return *this;
45  }
46};
47
48CanonicalForm  Prem( const CanonicalForm &f, const CanonicalForm &g );
49CanonicalForm  Prem( const CanonicalForm &f, const CFList &L );
50CFList         Prem( const CFList &AS, const CFList &L );
51CFList     MCharSetN( const CFList &PS, PremForm & Remembern );
52ListCFList IrrCharSeries( const CFList &PS, int opt=0 );
53
54// the next three give you a heuristically optimal reorderd list of the
55// variables. For internal and external (e.g. Singular/Macaulay2) library use.
56// This is really experimental!
57// See the comments in reorder.cc.
58//
59// this gives you a heuristically optimal ordering for the ring variables
60// if you use the irreducible characteristic series.
61Varlist  neworder( const CFList & PolyList );
62// the same as neworder(...) only returning a list of CanonicalForm 's
63// (i.e. the variables as CanonicalForms)
64CFList   newordercf(const CFList & PolyList );
65// the same as neworder(...) only returning a list of int 's (i.e. the levels)
66IntList  neworderint(const CFList & PolyList );
67
68// for library internal use only:
69// next function reorders the variables in PS:
70// a code segment to use:
71// ...
72// #include <tmpl_inst.h> // for typedef's
73// CFList PS= <setup-your-list-of-CanonicalForms>;
74// Varlist betterorder= neworder(PS);
75// PS= reorder(betterorder,PS); // reorder variables in PS from oldorder
76//                                 to betterorder
77// ListCFList Q= IrrCharSeries( PS );
78// Q= reorder(betterorder,Q);   // revert ordering to oldorder
79//
80CFList reorder( const Varlist & betterorder, const CFList & PS);
81CFFList reorder( const Varlist & betterorder, const CFFList & PS);
82ListCFList reorder(const Varlist & betterorder, const ListCFList & Q);
83
84
85#endif /* FACTOR_H */
Note: See TracBrowser for help on using the repository browser.