Activity
From 20 Sep 2015 to 19 Oct 2015
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...
-
- I've added some doc to @GlobalManager.txt@; it's probably not the best place, but no other place springs to mind.
... -
- I wonder whether the possibility to register the pair ptr+dtor should be removed later on. At the moment it is used ...
-
- 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...
-
- Ref counts tend to work badly in multithreaded environments (since the incr/decr operations have to be atomic, and/or...
-
- It seems that C++ STL provides no guarantees about the order of destruction of elements in a container: see @http://s...
-
- Here is a "trick" which could work:
define a function @void CallDtor(void* dtor) { dtor(); }@ and then
to register an... -
- I discovered yesterday that this has already been implemented (at least partly).
Furthermore the implementation wa... -
- I am considering as a "first step" towards possibly implementing unique copies of (some) rings to implement a global ...
15 Oct 2015
-
- John Abbott wrote:
> and the rings must be destroyed in the correct order (reverse order of construction).
> THIS ... -
- I modified my prototype so that it registered the @std::map@ for global destruction, then realised that the order of ...
-
- 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
-
- Thanks, Anna, for volunteering!
The relevant lines are in @MemPool.C@ around line 100.
Change @MinLoafBytes@ to... -
- I think that @implicit@ could be a good test.
I can do it, could you give me indications on the first tests to try?... -
- 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
-
- John Abbott wrote:
> Presumably the global register will comprise two @std::map@ objects: one for characteristics wh...
12 Oct 2015
-
- If CoCoALib offers a function which creates a (non-prime?) finite field given just its cardinality (or maybe characte...
-
- Presumably the global register will comprise two @std::map@ objects: one for characteristics which fit into @long@, a...
-
- JAA and Renzo discussed the idea of automatically creating all small, prime finite fields (up to size 32767, say) dur...
-
- A global register of finite fields would imply that once a field has been created it cannot later be destroyed (unles...
-
- The rings @ZZ@ and @QQ@ are global and unique -- you cannot (any more) create two copies of @ZZ@ or of @QQ@.
The s... -
- Here's an example of what Meyers suggests:...
-
- We definitely want CoCoALib to be threadsafe. It mostly is when compiled with @-DCoCoA_THREADSAFE_HACK@, but some se...
-
- The first 17 mins of the video @EffectiveModernCpart6.mp4@ by Scott Meyers are about correct threadsafe design of cod...
-
- Someone should do some benchmarking to see if changing the lower/upper limits for loaf size has any measurable effect...
-
- The problem arose when I experimented creating all (prime) finite fields up to characteristic 32767. There are about...
-
- 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...
-
- Currently each @MemPool@ has a minimum and maximum loaf size set to 64K and 64M respectively.
Review these values;...
09 Oct 2015
-
- Checked in several files: new @MachineInt.H@ and several consequential changes.
I got the redmine reference wrong wh... -
- The problem of @::std::abs@ being hidden (when inside @namespace CoCoA@) persists even after @abs(MachineInt)@ has be...
-
- I have implemented the suggestion in comment 3 above. Also changed all files which need to be changed; now running a...
-
- I have observed to uses for @abs(MachineInt)@:
* to obtain the absolute value (_e.g._ in some division/remainder fun... -
- I think there are two possible approaches:
# rename @abs(MachineInt)@
# ensure that the standard library @abs@ fns ... -
- I found the problem when trying to investigate why @test-NumTheory1.C@ produced warnings (about comparing @signed@ an...
-
- There is a fn called @abs@ for @MachineInt@; it works fine (and returns an @unsigned long@).
The problem is that i... -
- Checked in the commented out defns of ctors for @BigInt@ direct from machine integer types.
Marking as "Rejected" ... -
- @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...
-
- 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
-
- I'll think about it overnight, but suspect that "undo" is the best (=least bad) solution.
-
- There is an option *(C)* but it is not realistic: I could define @operator>@ between @BigInt@ and each of the actual ...
-
- John Abbott wrote:
> Right now I do not see any good way out of this:
> * *(A)* undo: _i.e._ no implicit coversion ... -
- I have just encountered a bigger problem...
Line 167 of @BigInt.C@ wants to evaluate the expression @N > 0@ where @N... -
- John Abbott wrote:
> However C++ allows only a single stage of conversion when doing automatic conversions.
well,... -
- I have found a catch...
If @a@ and @b@ are variables of type @int@, and the only signature for @lcm@ expects two @Bi... -
- Here are the fns which would benefit from having implicit conversion to @BigInt@:
* @ILogBase@ --> need just 1 signa... -
- On several occasions the design of CoCoALib has preferred the path of "ease of use" over that of "absolute speed". S...
-
- There could be some minor benefit to @NumTheory.H@ especially @PowerMod@ which has 8 different signatures to cover al...
-
- As a check I reinserted the @explicit@ keyword and tried to compile: two (minor) problems arose in @NumTheory.C@ wher...
-
- It seems that I had forgotten about this task. I will try to finish it now.
-
-
24 Sep 2015
-
- (Rudimentary) documentation is done.
-
- First prototype is done and working!!
Current design is:
- cone functions are in CoCoALib
- GroebnerFan algorithm ... -
- In the package there are lots of operations on integers and those would surely be faster in cocoalib (at some point)....
-
- First prototype is working.
Investigate and improve it, and implement it in cocoalib.
22 Sep 2015
-
- It does! Thanks for the fix!
*NOTE* phew! Thanks for the confirmation :-)
21 Sep 2015
-
- I have checked in a cleaned up version of the new code.
I hope Christof will verify that this version is still fine.
-
- I can confirm that it is working with your quickly hacked code!
Also available in: Atom