Re: Should we add `a * b` for vectors?

2017-09-27 Thread tn via Digitalmars-d
On Friday, 22 September 2017 at 17:11:56 UTC, Ilya Yaroshenko wrote: Should we add `a * b` to ndslice for 1d vectors? Discussion at https://github.com/libmir/mir-algorithm/issues/91 If it is for element-wise product, then possibly yes. If it is for dot product (as suggested by the github

Re: ddoc latex/formulas?

2016-09-16 Thread tn via Digitalmars-d
On Thursday, 15 September 2016 at 17:32:16 UTC, Adam D. Ruppe wrote: On Thursday, 15 September 2016 at 14:40:24 UTC, Andrei Alexandrescu wrote: Wait, but I just showed how with vanilla ddoc you can immediately use mathjax to do better than adrdox. No need for any pre/postprocessing or

Re: [GSoC] Mir.random.flex - Generic non-uniform random sampling

2016-08-23 Thread tn via Digitalmars-d-announce
On Tuesday, 23 August 2016 at 12:12:30 UTC, Seb wrote: On Tuesday, 23 August 2016 at 11:58:53 UTC, tn wrote: On Monday, 22 August 2016 at 15:34:47 UTC, Seb wrote: http://blog.mir.dlang.io/random/2016/08/22/transformed-density-rejection-sampling.html What are the columns "mu time" and

Re: [GSoC] Mir.random.flex - Generic non-uniform random sampling

2016-08-23 Thread tn via Digitalmars-d-announce
On Monday, 22 August 2016 at 15:34:47 UTC, Seb wrote: http://blog.mir.dlang.io/random/2016/08/22/transformed-density-rejection-sampling.html What are the columns "mu time" and "sigma^2 time" of the benchmark table in the Sampling subsection?

Re: So, to print or not to print?

2016-04-27 Thread tn via Digitalmars-d
On Tuesday, 26 April 2016 at 18:45:09 UTC, Andrei Alexandrescu wrote: On 04/26/2016 02:29 PM, TheGag96 wrote: On Tuesday, 26 April 2016 at 14:33:42 UTC, tn wrote: Maybe the name of the function should then be "writes" and/or "writesln" (instead of "print"), so that it can at least be found

Re: So, to print or not to print?

2016-04-26 Thread tn via Digitalmars-d
On Tuesday, 26 April 2016 at 12:52:13 UTC, Andrei Alexandrescu wrote: On 04/26/2016 08:18 AM, cym13 wrote: The first questions I expect are "when should I use print and when use writeln?" for they share a common role with common features. "When you want spaces between arguments and when you

Re: Pseudo-random numbers in [0, n), covering all numbers in n steps?

2016-02-25 Thread tn via Digitalmars-d
On Thursday, 25 February 2016 at 18:19:56 UTC, John Colvin wrote: I don't know of an algorithm for generating random permutations that isn't in-place (or O(N) storage), but I'm not an expert on the topic so maybe one does exist. These might be relevant:

Re: Idempotent partition around median of 5?

2016-02-06 Thread tn via Digitalmars-d
On Saturday, 6 February 2016 at 13:06:37 UTC, Andrei Alexandrescu wrote: Could you please add two simple calculations? Assuming uniform random distribution of data, compute the average number of swaps as a weighted average of orderings. Also, show the number of lines (one test or one swap per

Re: Idempotent partition around median of 5?

2016-02-06 Thread tn via Digitalmars-d
On Friday, 5 February 2016 at 21:42:41 UTC, Xinok wrote: On Friday, 5 February 2016 at 15:13:56 UTC, tn wrote: On Thursday, 4 February 2016 at 20:30:57 UTC, Timon Gehr wrote: At most 6 comparisons, <=3 swaps, idempotent (optimal number of swaps): ... Inspired by this, I made four other

Re: Idempotent partition around median of 5?

2016-02-06 Thread tn via Digitalmars-d
On Saturday, 6 February 2016 at 01:46:58 UTC, Andrei Alexandrescu wrote: On 02/04/2016 03:30 PM, Timon Gehr wrote: At most 6 comparisons, <=3 swaps, idempotent (optimal number of swaps): Oh, also: could you let that bad boy run and let it find anything that does idempotent partition in 6

Re: Idempotent partition around median of 5?

2016-02-05 Thread tn via Digitalmars-d
On Thursday, 4 February 2016 at 20:30:57 UTC, Timon Gehr wrote: At most 6 comparisons, <=3 swaps, idempotent (optimal number of swaps): ... Inspired by this, I made four other versions of the function that are shorter but make more swaps (at most 4, 6, 7 and 8 swaps respectively). Each

Re: So... add maxCount and maxPos?

2016-01-21 Thread tn via Digitalmars-d
On Thursday, 21 January 2016 at 01:11:19 UTC, Andrei Alexandrescu wrote: On 01/20/2016 04:22 PM, Ivan Kazmenko wrote: 2. The index of minimum or maximum element, mostly using plain array as a range. I write "a.length - a.minPos.length", and it looks completely unintuitive. Additionally, when

Re: [dlang.org] new forum design - preview

2016-01-15 Thread tn via Digitalmars-d
On Thursday, 14 January 2016 at 19:46:33 UTC, anonymous wrote: On 14.01.2016 16:29, tn wrote: I don't use my browser in full screen mode, but the useless white margins are still there. With the horizontal-split mode the line length of the message is less than 60 characters. Compared to that, I

Re: [dlang.org] new forum design - preview

2016-01-14 Thread tn via Digitalmars-d
On Thursday, 14 January 2016 at 12:31:51 UTC, w0rp wrote: I love this redesign. Anyone who complains about not taking up the full width of the screen is wrong. If lines stretch on eternally, they become harder to scan with your eyes. It's a well known effect which has been studied and

Re: What complexity have a log(sum) shape?

2015-12-08 Thread tn via Digitalmars-d
On Tuesday, 8 December 2015 at 15:25:28 UTC, Andrei Alexandrescu wrote: I'm working on the complexity algebra and of course trying to simplify my life :o). One good simplification would be to get rid of log(polynomial_sum) terms such as: log(n + m) log(n^^3 + n1^^2 + n2) etc. Do any of

Re: What complexity have a log(sum) shape?

2015-12-08 Thread tn via Digitalmars-d
On Tuesday, 8 December 2015 at 16:25:50 UTC, tn wrote: ... and that m is more than polynomially larger than s. ... Should of course be "larger than n".

Re: Complexity nomenclature

2015-12-04 Thread tn via Digitalmars-d
On Friday, 4 December 2015 at 03:37:10 UTC, Andrei Alexandrescu wrote: On 12/3/15 10:29 PM, Jack Stouffer wrote: On Friday, 4 December 2015 at 02:21:12 UTC, Andrei Alexandrescu wrote: On 12/03/2015 09:10 PM, Idan Arye wrote: The complexities of the operations is a property of the data

Re: Complexity nomenclature

2015-12-04 Thread tn via Digitalmars-d
On Friday, 4 December 2015 at 09:57:48 UTC, Jakob Ovrum wrote: On Friday, 4 December 2015 at 09:51:05 UTC, tn wrote: "I just want to insert an element. I don't care how long it takes. Why do I need to specify that it should be linear?" In my opinion, there should be "constantInsert",

Re: Complexity nomenclature

2015-12-04 Thread tn via Digitalmars-d
On Friday, 4 December 2015 at 14:08:08 UTC, Andrei Alexandrescu wrote: On 12/04/2015 04:51 AM, tn wrote: "I just want to insert an element. I don't care how long it takes. Why do I need to specify that it should be linear?" Oh but you do care. I don't, if I have a small container of

Re: 521 days, 22 hours, 7 minutes and 52 seconds...

2015-01-27 Thread tn via Digitalmars-d
On Monday, 26 January 2015 at 20:35:31 UTC, Andrei Alexandrescu wrote: On 1/26/15 12:30 PM, Dicebot wrote: We couldn't merge it into std.experimental before because you have stated that even std.experimental modules shouldn't have a breaking changes normally. It was 2 reviews ago. Now you

Re: DUB 0.9.22 released

2014-09-26 Thread tn via Digitalmars-d-announce
On Friday, 26 September 2014 at 06:29:21 UTC, Dragos Carp wrote: Though you could use prerelease and/or build suffixes (1.2.3-0w / 1.2.3+0w). These are very close to what I would like to see. Though, if I understand correctly, build suffix wouldn't work, as for example 1.2.3+0w and 1.2.3+1w

Re: DUB 0.9.22 released

2014-09-23 Thread tn via Digitalmars-d-announce
On Tuesday, 23 September 2014 at 06:22:27 UTC, Jacob Carlborg wrote: On 22/09/14 23:04, tn wrote: What is the recommended way of versioning bindings? If the binding of the target library 1.2.3 is versioned as 1.2.3 and a bug is fixed in the binding (no change in the target library), how

Re: DUB 0.9.22 released

2014-09-22 Thread tn via Digitalmars-d-announce
On Monday, 22 September 2014 at 09:33:52 UTC, Sönke Ludwig wrote: If you can think of any potentially important and especially backwards-incompatible changes/additions, please mention them (ideally as GitHub tickets), so that we can include them before the 1.0.0 release. What is the

Re: Redesign of gdcproject.org

2014-08-01 Thread tn via Digitalmars-d
On Monday, 28 July 2014 at 10:27:02 UTC, Iain Buclaw wrote: - GDC's homepage is now getting a UI update. Staging area for the new look is found here: http://staging.dgnu.org I think the old logo was better. The new one looks weird, like it was unfinished.