Activity
From 27 Sep 2015 to 26 Oct 2015
26 Oct 2015
- 11:54 Design #789 (In Progress): NumTheory: behaviour of InvMod when inverse does not exist
- Currently @InvMod(r,m)@ returns 0 if no inverse exists. This is simple to implement, and can easily be used by the c...
- 11:43 Design #789 (Closed): NumTheory: behaviour of InvMod when inverse does not exist
- Currently @InvMod(r,m)@ returns 0 if there is no inverse of @r@ modulo @m@.
Should it throw an exception (presumab...
22 Oct 2015
- 15:54 Bug #680: DistrMPolyClean does not use MemPool for summands?
- John Abbott wrote:
> I was a bit surprised to find that @DistrMPolyClean@ is not as clean as I had expected.
oops. I... - 15:37 Bug #680 (In Progress): DistrMPolyClean does not use MemPool for summands?
- I have mimicked the idea of @NewSummandPtr@ from @DistrMPolyInlFpPP@. It all compiles, and the tests pass (miracle?)...
- 15:14 Design #649: Make SmallFpImpl safer to use
- I think this is a good choice: it is exactly what we do for @ring@, so the code is overall more coherent
- 12:15 Design #649: Make SmallFpImpl safer to use
- After speaking to Anna, I have added @IsZero@ and @IsOne@, and also the new calls @zero(SmallFp)@ and @one(SmallFp)@....
- 13:49 Support #788 (New): No doc for DistrMPolyInlFpPP
- There is no documentation for @DistrMPolyInlFpPP@.
The documentation for @DistrMPolyInlPP@ is quite scant.
20 Oct 2015
- 17:37 Design #649: Make SmallFpImpl safer to use
- Why did I interfere with working code? Well, it's not working now; it's not even compiling! :-(
Well, @SmallFpImpl@... - 14:55 Feature #735: Convert a PPMonoidElem to RingElem with coefficient one
- Hi Anna. Could you finish this issue, and take it to "feedback"? Thanks, J
- 14:33 Feature #482 (In Progress): Unique copies of rings -- smart ctor
- Continuing with the assumption that rings in the registry will be destroyed (in reverse) order when the @GlobalManage...
19 Oct 2015
- 17:08 Design #787: Remove refcounts from RingElem?
- The comment about memory consumption is partly related to issue #786; if the "waste" per ring is small enough, it may...
- 16:53 Feature #180 (Resolved): GlobalManager: registration of global variables
- I've added some doc to @GlobalManager.txt@; it's probably not the best place, but no other place springs to mind.
... - 15:08 Feature #180: GlobalManager: registration of global variables
- I wonder whether the possibility to register the pair ptr+dtor should be removed later on. At the moment it is used ...
- 14:54 Feature #180: GlobalManager: registration of global variables
- I have implemented the clean version; the "nifty" version can be kept for later if it turns out that the stack of dto...
16 Oct 2015
- 16:19 Design #787: Remove refcounts from RingElem?
- So far we've been creating rings for temporary computations without worrying too much (indeed: starting every time wi...
- 14:07 Design #787 (New): Remove refcounts from RingElem?
- Ref counts tend to work badly in multithreaded environments (since the incr/decr operations have to be atomic, and/or...
- 14:34 Feature #180: GlobalManager: registration of global variables
- It seems that C++ STL provides no guarantees about the order of destruction of elements in a container: see @http://s...
- 14:20 Feature #180: GlobalManager: registration of global variables
- Here is a "trick" which could work:
define a function @void CallDtor(void* dtor) { dtor(); }@ and then
to register an... - 12:11 Feature #180 (In Progress): GlobalManager: registration of global variables
- I discovered yesterday that this has already been implemented (at least partly).
Furthermore the implementation wa... - 12:27 Feature #482: Unique copies of rings -- smart ctor
- I am considering as a "first step" towards possibly implementing unique copies of (some) rings to implement a global ...
15 Oct 2015
- 17:27 Design #785: finite fields: global register of fields already created?
- John Abbott wrote:
> and the rings must be destroyed in the correct order (reverse order of construction).
> THIS ... - 16:36 Design #785: finite fields: global register of fields already created?
- I modified my prototype so that it registered the @std::map@ for global destruction, then realised that the order of ...
- 15:49 Feature #142: Improve threadsafety
- After looking around on internet it seems that C++98 has no portable way of dealing with threadsafety, but C++11 (and...
14 Oct 2015
- 15:04 Design #786: MemPool: review min and max loaf sizes
- Thanks, Anna, for volunteering!
The relevant lines are in @MemPool.C@ around line 100.
Change @MinLoafBytes@ to... - 09:21 Design #786: MemPool: review min and max loaf sizes
- I think that @implicit@ could be a good test.
I can do it, could you give me indications on the first tests to try?... - 09:03 Feature #664: Impl small non-prime finite fields (using logs)
- If we construct a @F_p[x]/(f)@ would it be possible to convert it internally to your @F_q@? (I'm very ignorant on th...
13 Oct 2015
- 17:35 Design #785: finite fields: global register of fields already created?
- John Abbott wrote:
> Presumably the global register will comprise two @std::map@ objects: one for characteristics wh...
12 Oct 2015
- 17:13 Feature #664: Impl small non-prime finite fields (using logs)
- If CoCoALib offers a function which creates a (non-prime?) finite field given just its cardinality (or maybe characte...
- 16:58 Design #785: finite fields: global register of fields already created?
- Presumably the global register will comprise two @std::map@ objects: one for characteristics which fit into @long@, a...
- 16:14 Design #785: finite fields: global register of fields already created?
- JAA and Renzo discussed the idea of automatically creating all small, prime finite fields (up to size 32767, say) dur...
- 11:49 Design #785: finite fields: global register of fields already created?
- A global register of finite fields would imply that once a field has been created it cannot later be destroyed (unles...
- 11:44 Design #785 (New): finite fields: global register of fields already created?
- The rings @ZZ@ and @QQ@ are global and unique -- you cannot (any more) create two copies of @ZZ@ or of @QQ@.
The s... - 16:36 Bug #784: threadsafety: Scott Meyers's advice about cached values
- Here's an example of what Meyers suggests:...
- 11:17 Bug #784: threadsafety: Scott Meyers's advice about cached values
- We definitely want CoCoALib to be threadsafe. It mostly is when compiled with @-DCoCoA_THREADSAFE_HACK@, but some se...
- 11:13 Bug #784 (In Progress): threadsafety: Scott Meyers's advice about cached values
- The first 17 mins of the video @EffectiveModernCpart6.mp4@ by Scott Meyers are about correct threadsafe design of cod...
- 16:01 Design #786: MemPool: review min and max loaf sizes
- Someone should do some benchmarking to see if changing the lower/upper limits for loaf size has any measurable effect...
- 15:58 Design #786: MemPool: review min and max loaf sizes
- The problem arose when I experimented creating all (prime) finite fields up to characteristic 32767. There are about...
- 15:50 Design #786: MemPool: review min and max loaf sizes
- I am reasonably sure that the upper limit is far too large: as it currently stands it can ask the system for 64M of c...
- 15:44 Design #786 (Closed): MemPool: review min and max loaf sizes
- Currently each @MemPool@ has a minimum and maximum loaf size set to 64K and 64M respectively.
Review these values;...
09 Oct 2015
- 20:20 Bug #783 (Feedback): abs for MachineInt
- Checked in several files: new @MachineInt.H@ and several consequential changes.
I got the redmine reference wrong wh... - 13:49 Bug #783: abs for MachineInt
- The problem of @::std::abs@ being hidden (when inside @namespace CoCoA@) persists even after @abs(MachineInt)@ has be...
- 12:23 Bug #783: abs for MachineInt
- I have implemented the suggestion in comment 3 above. Also changed all files which need to be changed; now running a...
- 11:31 Bug #783: abs for MachineInt
- I have observed to uses for @abs(MachineInt)@:
* to obtain the absolute value (_e.g._ in some division/remainder fun... - 10:52 Bug #783 (In Progress): abs for MachineInt
- I think there are two possible approaches:
# rename @abs(MachineInt)@
# ensure that the standard library @abs@ fns ... - 10:50 Bug #783: abs for MachineInt
- I found the problem when trying to investigate why @test-NumTheory1.C@ produced warnings (about comparing @signed@ an...
- 10:46 Bug #783 (Closed): abs for MachineInt
- There is a fn called @abs@ for @MachineInt@; it works fine (and returns an @unsigned long@).
The problem is that i... - 20:18 Feature #586 (Rejected): BigInt ctor from a machine integer
- Checked in the commented out defns of ctors for @BigInt@ direct from machine integer types.
Marking as "Rejected" ... - 14:09 Feature #586: BigInt ctor from a machine integer
- @Christof:
Yes, I implemented 8 new ctors for @BigInt@ direct from the various C++ machine integer types; and yes, t... - 11:32 Feature #586: BigInt ctor from a machine integer
- So to make sure I got it right. You implemented the constructures @BigInt(long)@ and so on, and now get this ambiguit...
- 09:47 Feature #586: BigInt ctor from a machine integer
- I've decided for option *(A)* "undo"; the others seem to be too much hassle+risk.
I'll comment out the new BigInt ...
08 Oct 2015
- 17:53 Feature #586: BigInt ctor from a machine integer
- I'll think about it overnight, but suspect that "undo" is the best (=least bad) solution.
- 17:52 Feature #586: BigInt ctor from a machine integer
- There is an option *(C)* but it is not realistic: I could define @operator>@ between @BigInt@ and each of the actual ...
- 17:51 Feature #586: BigInt ctor from a machine integer
- John Abbott wrote:
> Right now I do not see any good way out of this:
> * *(A)* undo: _i.e._ no implicit coversion ... - 17:33 Feature #586: BigInt ctor from a machine integer
- I have just encountered a bigger problem...
Line 167 of @BigInt.C@ wants to evaluate the expression @N > 0@ where @N... - 16:58 Feature #586: BigInt ctor from a machine integer
- John Abbott wrote:
> However C++ allows only a single stage of conversion when doing automatic conversions.
well,... - 16:33 Feature #586: BigInt ctor from a machine integer
- I have found a catch...
If @a@ and @b@ are variables of type @int@, and the only signature for @lcm@ expects two @Bi... - 15:33 Feature #586: BigInt ctor from a machine integer
- Here are the fns which would benefit from having implicit conversion to @BigInt@:
* @ILogBase@ --> need just 1 signa... - 15:13 Feature #586: BigInt ctor from a machine integer
- On several occasions the design of CoCoALib has preferred the path of "ease of use" over that of "absolute speed". S...
- 12:18 Feature #586: BigInt ctor from a machine integer
- There could be some minor benefit to @NumTheory.H@ especially @PowerMod@ which has 8 different signatures to cover al...
- 12:04 Feature #586: BigInt ctor from a machine integer
- As a check I reinserted the @explicit@ keyword and tried to compile: two (minor) problems arose in @NumTheory.C@ wher...
- 11:02 Feature #586: BigInt ctor from a machine integer
- It seems that I had forgotten about this task. I will try to finish it now.
- 14:48 Support #621 (Closed): Release: CoCoALib-0.99536
- 14:47 Support #754 (Closed): Release: CoCoALib-0.99538 (together with CoCoA-5.1.2)
Also available in: Atom