Activity
From 15 Oct 2015 to 13 Nov 2015
13 Nov 2015
-
14:51 Design #805: New type for "constant" matrices?
- As predicted in comment 1, there is a problem with @BlockMat2x2@. Not yet sure how to deal with it :-/
-
- In principle the concrete classes for @IdentityMat@ and so on could derive from @matrix@ but then they have to impl l...
-
- I believe that @ConstMatrixView@ is not the right type, because a matrix "view" is a way of looking at another object...
-
- I believe that implementing @IdentityMat@, @StdDegRevLexMat@ and so on as objects of type @ConstMatrixView@ is not co...
-
- What do we want the @StdDegRevLexMat@ to be?
There are two obvious candidiates: here are 3x3 instances...
12 Nov 2015
-
- Rather to my surprise I have failed to create an example where @ZeroMat@ (or @IdentityMat@) misbehaves -- no idea why...
-
- I think that @ZeroMat@ and @IdentityMat@ should produce a result of type @matrix@ and not one of type @ConstMatrixVie...
11 Nov 2015
-
- After some hasty cut-and-paste work I have some code which compiles :-)
I'm not so foolish as to try running it... t... -
- JAA is convinced that this is a good idea.
To get it finished quickly I shall ignore issue #592; it probably shoul... -
- JAA now thinks that there is an example (see issue #803) where it could be useful to have the order matrix(view) quic...
-
- How important is it that @OrdMat@ is fast? Is there a good example where we would want to compute repeatedly the @Or...
-
- The main task I want to simplify is that of implementing @myWDeg@, @myCmpWDeg@ and @myCmpWDegPartial@ for @PPMonoidSp...
-
- Should objects of type @PPOrdering@ be able to compute WDeg vectors and/or individual components of WDeg vectors?
... -
- I have lowered the priority of this issue because it will take some time to complete, and the resulting improvement w...
-
- As far as I can tell @PPMonoidBase::myIndets@ is used only once, in the (inefficient) fn @PPMonoidBase::mySymbolValue...
-
12:15 Feature #802: DivMask: extend interface?
- John Abbott wrote:
> I think updating would mean replacing the div-mask with that for the LCM of the old value and t...
10 Nov 2015
-
- John Abbott wrote:
> Might it be important to store the @StdDeg@ along with the list of (index, exp) pairs? If it i... -
- For @Wdeg@ I am inclined to compute it "on the fly" every time it is needed. If someone reports poor execution speed...
-
- The currently missing functions are: @myCmp@, @myWDeg@ and @myCmpWDeg@ (& a partial version). Also @myComputeDivMask...
-
- There was a very incomplete impl in @PPMonoidSparse.C@, which was already recognized by @Makefile@.
Apparently the... -
- I think updating would mean replacing the div-mask with that for the LCM of the old value and the new indet-power. T...
-
- John Abbott wrote:
> If we do extend the interface of @DivMask@ to accommodate the sparse repr, what should the exte... -
- If we do extend the interface of @DivMask@ to accommodate the sparse repr, what should the extended interface expect:...
-
- Currently the only way to make a (non-trivial) @DivMask@ is to use the function @myAssignFromExpv@ which clearly suit...
-
- The new @PPMonoidSparse@ impl needs to supply a @myComputeDivMask@ mem fn.
The current interface is well suited to... -
- That's fine by me -- less work for me :-)
Indeed @symbols("x[1..3,2..5]")@ is not really that much more readable tha...
09 Nov 2015
-
- John Abbott wrote:
> Do we want this function to handle symbol ranges?
>
> It probably makes sense for @symbols... -
- Do we want this function to handle symbol ranges?
_e.g._ @symbols("x[1..3,2..5]")@ would produce the same result as ... -
- Currently this operation is implemented in a hidden way inside @RingBase::myNew(symbol)@.
The implementation there... -
- Should there be a function which tests whether a given @symbol@ is in given @ring@?
I am thinking of "recursive" s... -
- I had assumed that this issue already existed, but a quick search did not find it.
There is already a partial impl... -
- Implement a PPMonoid which uses a sparse repr for the PPs.
This is useful when there are many indets.
-
- The vector of indets is used in the (mem) function @mySymbolValue@, which currently returns a reference to the image ...
-
- Is it truly useful to have each PPMonoid keep a vector of its own indets?
This is not a problem if the indets are ...
07 Nov 2015
-
- The speed gains varies form platform to platform -- surprise, surprise!
The old @DUPFF@ code was (significantly) f... -
- After comparing @gcd@ for @DUPFp@ and @DUPFF@, I saw that the latter was significantly faster (_e.g._ factor 2 or mor...
05 Nov 2015
-
- This problem is generally easier than @SqFreeFactor@, indeed in @SqFreeFactorPosDerChar0@ it is just computed by the ...
-
- Anna Maria Bigatti wrote:
> John Abbott wrote:
> > I'm not sure; I suspect it will not work in every case.
>
> I... -
- Good point! So if @gcd@ works then we can expect that squarefree decomposition works.
-
- John Abbott wrote:
> I'm not sure; I suspect it will not work in every case.
I thought it would: in char 0 the squar... -
- The *@Fatal error@* messages appeared once again when I tried building CoCoALib from a new unpackaged tar file. The ...
-
- Implemented, documented. No separate test; it is effectively tested inside @test-NumTheory1@
-
- For efficiency it would be nice to have public access to the "fast" function for computing inverses modulo an integer.
-
- [oops cut-and-paste did the wrong thing]
Changing to feedback; implemented the fn mentioned in comments 18-20. See #795 -
- John Abbott wrote:
> I am thinking of the name @InvModNoCheck@; it is pretty clear; it is a bit long, so that ought ... -
- I am thinking of the name @InvModNoCheck@; it is pretty clear; it is a bit long, so that ought to discourage "casual ...
-
- In @NumTheory.H@ there is a fn called @InvMod@ which expects two @MachineInt@; internally it calls the fn @InvMod_pri...
-
- I have resolved the mystery of the two identical functions running at different speeds: my test program was giving (v...
04 Nov 2015
-
- I have implemented @NonRedValue@.
Checked everything last night; revised examples, doc, etc.
Checked in today.
T...
03 Nov 2015
-
- I'm not sure; I suspect it will not work in every case.
What coeff ring did you have in mind? Were you thinking o... -
- In @factor.C@ there is the line:...
-
- I'm compiling some other programs; compilation time varies from 2mins to almost 5mins. I'll ask the technical guy if...
-
- I'm recompiling (with full debugging), and the mysterious @Fatal error@ messages have not reappeared; and anyway desp...
-
- John Abbott wrote:
> The new computer took *100mins* to compile and run the examples. Just running the examples take... -
- The new computer took *100mins* to compile and run the examples. Just running the examples takes only 30secs.
-
- I shall try to investigate this, but it may take a long time. The new computer seems to be quite fast (_e.g._ more t...
-
- The archive creator @ar@ gives warnings about the use of @u@ flag with the @r@ flag (because the default is @D@).
... -
- I quite like @NonRedValue@; it is quite clear, and a bit long (to discourage "casual use"). I'll try changing the co...
02 Nov 2015
-
- John Abbott wrote:
> There is a question about names:
> * *@SmallFpImpl::value@* is the class for reduced values
>... -
- Compilation on the new computer (with fedora 23, due for release tomorrow ?!!? according to Wikipedia) produced sever...
-
- Since I believe that the @find@ command is the culprit, the solution would be to eliminate it. This could be done by...
-
- The situation was the following. The new computer did not have GMP installed, so the attempt to use @-lgmp@ failed, ...
-
- I have new computer (here in Kassel). I am trying to build CoCoALib/CoCoA-5. The @configure@ script took *ages* to ...
30 Oct 2015
-
- When a @SmallFpImpl@ is printed currently it appears as @SmallFpImpl(p)@ where @p@ is the prime. Should the export c...
-
- I am not entirely happy with the length of the names for the export conventions:
* *@GlobalSettings::SymmResidues@*
... -
- I like all types in CoCoALib to be printable; naturally this includes *@value@* and *@uvalue@*.
@SmallFpImpl@ offers... -
- I now disagree with my comment number 3. I think that the impl using new types (classes) to represent the values is ...
-
- I'm hoping Anna will "volunteer" to do this ;-)
29 Oct 2015
-
- Victor Shoup said he made NTL threadsafe (using C++11)
-
- John Abbott wrote:
> Now I am slightly undecided which implementation I prefer:
> Impl *(A)*:
> [...]
> Impl *(B)... -
- Now I am slightly undecided which implementation I prefer:
Impl *(A)*:... -
- There is quite a lot of cruft in @DistrMPolyClean.C@.
Remove everything that is no longer needed.
Perhaps also chec... -
- I have now revised the code so that it uses its @MemPool@ for summands; essentially I had to "steal" the idea of @New...
28 Oct 2015
-
- John Abbott wrote:
>
> Making @InvMod@ throw an exception is an interface change, so it could in principle break... -
- The problem was a missing pair of curly brackets around a "then" clause comprising two commands (location @DistrMPoly...
-
- I compiled CoCoALib with the @MemPool@ debugging options active.
In @test-SparsePolyRing1.C@ I inserted the followin... -
- I have run @test-SparsePolyRing1@ with @MemPool@ verbose active, and there were lots of warnings about freeing @ZERO ...
26 Oct 2015
-
- Currently @InvMod(r,m)@ returns 0 if no inverse exists. This is simple to implement, and can easily be used by the c...
-
- Currently @InvMod(r,m)@ returns 0 if there is no inverse of @r@ modulo @m@.
Should it throw an exception (presumab...
22 Oct 2015
-
- John Abbott wrote:
> I was a bit surprised to find that @DistrMPolyClean@ is not as clean as I had expected.
oops. I... -
- I have mimicked the idea of @NewSummandPtr@ from @DistrMPolyInlFpPP@. It all compiles, and the tests pass (miracle?)...
-
- I think this is a good choice: it is exactly what we do for @ring@, so the code is overall more coherent
-
- After speaking to Anna, I have added @IsZero@ and @IsOne@, and also the new calls @zero(SmallFp)@ and @one(SmallFp)@....
-
- There is no documentation for @DistrMPolyInlFpPP@.
The documentation for @DistrMPolyInlPP@ is quite scant.
20 Oct 2015
-
- Why did I interfere with working code? Well, it's not working now; it's not even compiling! :-(
Well, @SmallFpImpl@... -
- Hi Anna. Could you finish this issue, and take it to "feedback"? Thanks, J
-
- Continuing with the assumption that rings in the registry will be destroyed (in reverse) order when the @GlobalManage...
19 Oct 2015
-
- 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
-
- 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...
Also available in: Atom