Activity

From 08 Feb 2018 to 09 Mar 2018

18:18 Design #950: factor and SmoothFactor for integers --> FactorINT, FactorINT_TrialDiv, FactorINT_PollardRho: Maybe there could be a fn called *@IsPrime3@* which is guaranteed (reasonably) fast, and returns a @bool3@?
John Abbott
18:14 Design #1145 (In Progress): File names, coding conventions: Fns, Ops, Operations? part 2: JAA has a preference for *@Ops@* rather than *@Operations@*. I think they are equally clear, and see no advantage in... John Abbott
18:08 Feature #1155 (Resolved): Create a new "prime source" iterator: I have added 4 "iterators: *@PrimeSeq@*, *@PrimeSeqForCRT@*, *@FastMostlyPrimeSeq@*, *@NoSmallFactorsSeq@*.
First ... John Abbott
18:05 Design #1162: Check semantics of NoSmallFactorSeq: Currently the choice of biggest prime which is "filtered" is somewhat arbitrary.
Is it worth doing anything more ref... John Abbott

09:40 Feature #1158: New function: MinPolyQuotHeuristic --> MinPolyQuot with VerificationLevel: Added @error@ if CoeffRing is not QQ. Anna Maria Bigatti
09:14 Feature #1158 (In Progress): New function: MinPolyQuotHeuristic --> MinPolyQuot with VerificationLevel: Anna Maria Bigatti

18:22 Design #1163 (In Progress): Split SparsePolyRing.C in smaller files: Anna Maria Bigatti
18:20 Design #1163 (Closed): Split SparsePolyRing.C in smaller files: The file is now too long.
Split off code for ideals and for involutive operations,
and whatever can be usefully be ... Anna Maria Bigatti
16:40 Support #1161: Split NumTheory.C into several smaller files: I get a strange infinite loop on a 32-bit machine. Seems to be related to @FastMostlyPrimeSeq@.
Must investigate.... John Abbott
16:37 Design #1162 (Resolved): Check semantics of NoSmallFactorSeq: I have introduced a new class *@FastMostlyPrimeSeq@* which produces an increasing sequence of positive integers which... John Abbott

16:32 Design #1159 (In Progress): Add global enum "verify/DontVerify": After speaking to Anna...
* a "boolean" interface is easy to understand (and simple to use)
* a more sophisticated ... John Abbott
15:48 Design #1162 (Closed): Check semantics of NoSmallFactorSeq: I have just added the new class *@NoSmallFactorSeq@* but it is awkward to use.
Reconsider its public interface. John Abbott
15:41 Support #1161 (In Progress): Split NumTheory.C into several smaller files: I have split off the code to do with prime testing and generation. It is in *@NumTheory-prime@*
*Note* it is better... John Abbott

17:36 Support #1161: Split NumTheory.C into several smaller files: Some suggestions for the subfiles:
primes, RatReconstruct, CRT
Note that there is no need to split the docume... John Abbott
17:35 Support #1161 (Closed): Split NumTheory.C into several smaller files: The file *@NumTheory.C@* has become rather large. Consider splitting it into several smaller files.
John Abbott
17:33 Support #1160 (New): Clean up revised RatReconstructByContFrac code: The @RatReconstructByContFrac@ code has been revised (made better?), but there is lots of commented out cruft.
Cle... John Abbott
16:55 Design #1159: Add global enum "verify/DontVerify": John says it might be better to have a "reliability flag", which takes "0" as "certain".
I am thinking of the functi... Anna Maria Bigatti
16:32 Design #1159 (Closed): Add global enum "verify/DontVerify": should we have a global enum for "verify/DontVerify"?
this could be a pervasive feature in cocoalib.
Anna Maria Bigatti
16:27 Feature #1158 (Closed): New function: MinPolyQuotHeuristic --> MinPolyQuot with VerificationLevel: In our applications a wrong Minimal polinomial can be detected (we proved that if wrong, the degree is too low).
So ... Anna Maria Bigatti

12:37 Design #1156: Printing for RingElem: Part of the motivation is that it seems to be tricky to resolve issue #930 about printing out TwinFloat values as pol... John Abbott
12:30 Design #1156 (New): Printing for RingElem: JAA would like to reconsider the design of printing for @RingElem@ because the current design is rather inelegant. John Abbott

21:10 Feature #1154: SmallFpImpl: new ctor arg to say do-not-check-that-arg-is-prime: Another posibility is for a "prime source" to produce values of a new type @SmallPrime@ (which is really just a @long... John Abbott
20:52 Feature #1154: SmallFpImpl: new ctor arg to say do-not-check-that-arg-is-prime: Several CRT loops look a lot like this:... John Abbott
20:49 Feature #1154 (Closed): SmallFpImpl: new ctor arg to say do-not-check-that-arg-is-prime: I propose adding a new ctor for @SmallFpImpl@ where the caller can use a flag to guarantee that the arg is prime.
... John Abbott
21:02 Feature #1155: Create a new "prime source" iterator: Add a new class to CoCoALib for generating primes in succession -- for use inside CRT loops.
Currently a CRT loop ... John Abbott
20:55 Feature #1155 (Closed): Create a new "prime source" iterator: In CoCoA-4 the old factorizer code had an "iterator" for generating primes in succession.
Add such an object to Co... John Abbott

Also available in: Atom

CoCoA » CoCoALib