Activity

John Abbott's activity

From 23 Feb 2018 to 24 Mar 2018

13:26 CoCoALib 0.20 hour (Feature #1169 (Closed): New function: RandomLinearForm (CoCoALib)): Doubt John Abbott
13:26 CoCoALib Feature #1169: New function: RandomLinearForm (CoCoALib): I am not so convinced of the utility of @RandomLinearForm(P,lo,hi)@, and suggest commenting it out until we find a ge... John Abbott

14:12 CoCoALib 0.50 hour (Design #1168 (In Progress): ideal: does const ourGetPtr really need to be private?): Mmmm John Abbott
14:12 CoCoALib Design #1168 (In Progress): ideal: does const ourGetPtr really need to be private?: If many functions have to be @friend@ that is not a good sign.
I'm too busy to think about it now, so suggest making... John Abbott

18:48 CoCoALib Feature #1167 (In Progress): New class VerificationLevel: JAA has checked in a first impl (using KISS philosophy).
Anna will test it shortly.
The idea is that fns which ... John Abbott
18:48 CoCoALib 1.00 hour (Feature #1167 (Closed): New class VerificationLevel): First impl John Abbott
18:43 CoCoALib Feature #1167 (Closed): New class VerificationLevel: To help offer the user the chance to choose between guaranteed algorithms and fast, probably-correct ones,
create a ... John Abbott

16:45 CoCoALib Feature #1131 (Resolved): Sturm sequence: The implementation seems to be mostly complete (for coeffs in QQ).
The elements of the sequence are scaled so that t... John Abbott
16:45 CoCoALib 1.00 hour (Feature #1131 (Closed): Sturm sequence): Apparently almost done John Abbott
11:51 CoCoALib Design #1166 (In Progress): C++11: allows large integer literals (in NumTheory-prime.C): I'd like the code to compile whenever a 64-bit (or wider) integer type is available. This is guaranteed if the C++ s... John Abbott
11:51 CoCoALib 0.50 hour (Design #1166 (Closed): C++11: allows large integer literals (in NumTheory-prime.C)): Some notes John Abbott
11:47 CoCoALib Design #1166 (Closed): C++11: allows large integer literals (in NumTheory-prime.C): I would like to include some "large" (greater than 2^32) integer literals in @NumTheory-prime.C@.
This cannot be d... John Abbott

18:18 CoCoALib 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:18 CoCoALib 0.10 hour (Design #950 (Closed): factor and SmoothFactor for integers --> FactorINT, FactorINT_TrialDiv, FactorINT_PollardRho): Another idea John Abbott
18:14 CoCoALib 0.10 hour (Design #1145 (Closed): File names, coding conventions: Fns, Ops, Operations? part 2): Opinion John Abbott
18:14 CoCoALib 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 CoCoALib 20.00 hours (Feature #1155 (Closed): Create a new "prime source" iterator): Mostly done? John Abbott
18:08 CoCoALib Feature #1155 (Resolved): Create a new "prime source" iterator: I have added 4 "iterators: *@PrimeSeq@*, *@PrimeSeqForCRT@*, *@FastMostlyPrimeSeq@*, *@NoSmallFactorsSeq@*.
First ... John Abbott
18:05 CoCoALib 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
18:05 CoCoALib 0.25 hour (Design #1162 (Closed): Check semantics of NoSmallFactorSeq): Small factor limit? John Abbott

16:40 CoCoALib 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:40 CoCoALib 0.50 hour (Support #1161 (Closed): Split NumTheory.C into several smaller files): Problem on 32-bit computer John Abbott
16:37 CoCoALib 5.00 hours (Design #1162 (Closed): Check semantics of NoSmallFactorSeq): Mostly done? John Abbott
16:37 CoCoALib 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 CoCoALib 0.25 hour (Design #1159 (Closed): Add global enum "verify/DontVerify"): Some thoughts John Abbott
16:32 CoCoALib 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 CoCoALib 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 CoCoALib 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
15:41 CoCoALib 15.00 hours (Support #1161 (Closed): Split NumTheory.C into several smaller files): Partly done John Abbott

Also available in: Atom