The 2nd Monitor

« first day (4308 days earlier) ← previous day next day → last day (5 days later) »

Duga

00:22

REFRESH! There are 5056 unanswered questions (93.4779 answered)

2 hours later…

Duga

02:44

@njuffa Yes the 4 sinh() implementations as my_sinh_fX(double x) are all incomplete. They only address the range of x >= 709 to focus the issue on that end of the x range. I thought my complete general sinh() would cloud the issue of these x corner values and so decidedly omitted that part. I have plans on posting that later on Code review. — chux 18 secs ago

2 hours later…

Duga

04:32

If you're asking for opinions, SO is not the place. Consider going to [//codereview.stackexchange.com]. — musicamante 5 secs ago

9 hours later…

pacmaninbw

13:46

@Mast Can this question in the CV queue be saved?

1 hour later…

Mast

14:57

@pacmaninbw OP has abandoned it.

1 hour later…

Sᴀᴍ Onᴇᴌᴀ

16:07

Monking

skiwi

17:05

Monking

Captain Obvious

17:43

Q: Calculating the pattern behind the Levi-Civita symbol, works for all N >= 3

I have a code that calculates the pattern behind the Levi-Civita symbol. Unfortunately, it cheats for N >= 10. Any ideas how I can calculate the pattern for N >= 10 explicitly, without cheating? Any review comments and questions are very welcome. Thank you for your time. #include <Eigen/Dense> us...

2 hours later…

Duga

20:05

There is a related site, Code Review, dedicated to code reviews, but you really need to read the guidelines first, as this is likely off-topic there as written, as well. — David Makogon 37 secs ago

Captain Obvious

21:04

Q: Descriptor with cache depending on the update of another attribute

Python 3.11 here. I have created a descriptor that caches the value of the decorated method while the watched attribute has not changed. It can be used like so: class TestClass: def __init__(self, attr): self.attr = attr @CustomMethod(attribute_to_watch='attr') def nodes(...

python

1 hour later…

Captain Obvious

22:11

Q: Needleman-Wunsch algorithm with affine gap cost

Needleman-Wunsch is a bioinformatics algorithm used to align 2 sequences. The algorithm outputs the score of the alignment and a Vec containing all operations to reconstruct the alignment. I do not handle at this stage any print/pretty print of the alignment. I am mostly interested in general com...