Re: Why is mangling different for separate compilation?

On Friday, 26 February 2016 at 12:45:35 UTC, Atila Neves wrote: foo.d: - void main() { import bar; foreach(ut; __traits(getUnitTests, bar)) ut(); } - bar.d: - unittest { assert(1 == 2); } - # compile all at once dmd -unittest foo.d bar.d # fine # compile separately

Re: RosettaCode-D

On Saturday, 27 February 2016 at 04:19:06 UTC, BBasile wrote: On Saturday, 27 February 2016 at 02:48:16 UTC, Andrew Edwards I am asking the community's assistance to improve the quality of this repo and prepare for use in nightly testing of the D compiler. Andrew what about - travis-CI ?

Re: Syntax highlighting of backticks now supported in Notepad++

On Tuesday, 23 February 2016 at 17:01:47 UTC, Andre wrote: Hi, with the newest version of Notepad++ (6.9) strings enclosed with backticks `Hello World!` are now correctly highlighted. Kind regards André yay! but, some(..or many?)style theme coudn't support D. Unsupport style list(npp 6.9

Re: Choosing arity of a template function

It isn't cheating but IMO it's bad form. If you can do it without __traits(compiles) (or is(typeof()), etc.) you should, because there are many reasons why something will not compile, and only one of those reasons is the one you want to know. If there's no way around using it, you should still

[Issue 15729] New: [REG(master)] broken library causes OPTLINK error 162 and 163

https://issues.dlang.org/show_bug.cgi?id=15729 Issue ID: 15729 Summary: [REG(master)] broken library causes OPTLINK error 162 and 163 Product: D Version: D2 Hardware: x86_64 OS: Windows Status:

Re: A lazy-chain for std.range?

On Saturday, 27 February 2016 at 04:37:26 UTC, Jakob Ovrum wrote: With std.typecons.Option[1] it becomes: return elements .map!(…) .filter!(…) .frontOption .getOrElse(fallback); `fallback` is a lazy argument. [1]

Re: static init of associative array of enums not working.. why?

On Saturday, 27 February 2016 at 04:37:24 UTC, Øivind wrote: Should I file a ticket for this? It is already known, just nobody has fixed it yet (and probably won't for a long time still)

Re: static init of associative array of enums not working.. why?

On Saturday, 27 February 2016 at 04:35:41 UTC, Adam D. Ruppe wrote: It just isn't implemented in the compiler. Instead, you can declare it outside and set it in a static module constructor: That was quick! Thank you. Should I file a ticket for this?

Re: static init of associative array of enums not working.. why?

On Saturday, 27 February 2016 at 04:15:06 UTC, Øivind wrote: Shouldn't this work? According to "Static Initialization of AAs" on this page, it should: https://dlang.org/spec/hash-map.html It just isn't implemented in the compiler. Instead, you can declare it outside and set it in a static

Re: A lazy-chain for std.range?

On Saturday, 27 February 2016 at 04:31:03 UTC, Mint wrote: So, I noticed that one way I frequently use the chain function defined std.range is as sort of an else-clause. ie. return elements .map!( . . . ) .filter!( . . . ) .chain(fallback.only) .front; After

A lazy-chain for std.range?

So, I noticed that one way I frequently use the chain function defined std.range is as sort of an else-clause. ie. return elements .map!( . . . ) .filter!( . . . ) .chain(fallback.only) .front; After transforming and filtering elements, chain would effectively

static init of associative array of enums not working.. why?

Shouldn't this work? According to "Static Initialization of AAs" on this page, it should: https://dlang.org/spec/hash-map.html enum DevicePropDataType { dString, dDateTime } enum DevicePropValType { property, miscDate } immutable DevicePropDataType[DevicePropValType] propDType = [

Re: RosettaCode-D

On Saturday, 27 February 2016 at 02:48:16 UTC, Andrew Edwards wrote: In efforts to actively maintain the D code on RosettaCode and provide additional code for beta testing, I've thrown together https://github.com/AndrewEdwards/RosettaCode-D. All of the code was copied form

Re: Why is mangling different for separate compilation?

On 2/26/2016 4:45 AM, Atila Neves wrote: '_D3bar16__unittestL2_531FZv' '_D3bar14__unittestL2_1FZv' It uses a sequence number to generate different ids for the unit tests. In the former, it's the 531st unit test, the latter, the first.

Re: RosettaCode-D

On Saturday, 27 February 2016 at 02:54:00 UTC, cym13 wrote: On Saturday, 27 February 2016 at 02:48:16 UTC, Andrew Edwards wrote: In efforts to actively maintain the D code on RosettaCode and provide additional code for beta testing, I've thrown together

Re: RosettaCode-D

On Saturday, 27 February 2016 at 02:48:16 UTC, Andrew Edwards wrote: In efforts to actively maintain the D code on RosettaCode and provide additional code for beta testing, I've thrown together https://github.com/AndrewEdwards/RosettaCode-D. All of the code was copied form

RosettaCode-D

In efforts to actively maintain the D code on RosettaCode and provide additional code for beta testing, I've thrown together https://github.com/AndrewEdwards/RosettaCode-D. All of the code was copied form https://github.com/acmeism/RosettaCodeData but as one may guess it does not all compile

Re: Choosing arity of a template function

On Sat, 27 Feb 2016 01:25:31 +, Era Scarecrow wrote: > On Friday, 26 February 2016 at 23:53:06 UTC, Chris Wright wrote: >> On Fri, 26 Feb 2016 23:46:11 +, cym13 wrote: >>> On Friday, 26 February 2016 at 23:18:30 UTC, Era Scarecrow wrote: On Friday, 26 February 2016 at 23:11:32 UTC,

Re: Choosing arity of a template function

On Friday, 26 February 2016 at 23:53:06 UTC, Chris Wright wrote: On Fri, 26 Feb 2016 23:46:11 +, cym13 wrote: On Friday, 26 February 2016 at 23:18:30 UTC, Era Scarecrow wrote: On Friday, 26 February 2016 at 23:11:32 UTC, Andrei Alexandrescu wrote: Urgh, forgot the "static" in front of the

Re: Choosing arity of a template function

On Friday, 26 February 2016 at 23:11:32 UTC, Andrei Alexandrescu wrote: Urgh, forgot the "static" in front of the second "if". It does work now. Nevertheless, I'm still on lookout for a more elegant solution! I have this mindset that using __traits(compiles) is some sort of cheating. There's

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

On 02/26/2016 04:57 PM, H. S. Teoh via Digitalmars-d wrote: On Fri, Feb 26, 2016 at 09:26:54PM +, Joseph Rushton Wakeling via Digitalmars-d wrote: On Friday, 26 February 2016 at 12:21:11 UTC, Andrei Alexandrescu wrote: On 02/26/2016 03:05 AM, Joseph Rushton Wakeling wrote: I can probably

Re: Choosing arity of a template function

On Fri, 26 Feb 2016 23:46:11 +, cym13 wrote: > On Friday, 26 February 2016 at 23:18:30 UTC, Era Scarecrow wrote: >> On Friday, 26 February 2016 at 23:11:32 UTC, Andrei Alexandrescu wrote: >>> Urgh, forgot the "static" in front of the second "if". It does work >>> now. >> >> Perhaps that

Re: Choosing arity of a template function

On Friday, 26 February 2016 at 23:18:30 UTC, Era Scarecrow wrote: On Friday, 26 February 2016 at 23:11:32 UTC, Andrei Alexandrescu wrote: Urgh, forgot the "static" in front of the second "if". It does work now. Perhaps that should be an error instead; Going from a static if to an else if...

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

On Friday, 26 February 2016 at 23:05:00 UTC, John Colvin wrote: This was what I was trying to get at in my initial post, but I failed to get the idea across properly. Yea. It didn't even click with me at first, because when I first read Andrei's email I jumped straight in my head to the

Re: Choosing arity of a template function

On Friday, 26 February 2016 at 23:11:32 UTC, Andrei Alexandrescu wrote: Urgh, forgot the "static" in front of the second "if". It does work now. Perhaps that should be an error instead; Going from a static if to an else if... seems easy enough to spot and insist a fix (much like assignment

Re: Choosing arity of a template function

On 02/26/2016 06:09 PM, Andrei Alexandrescu wrote: A generic function receives an argument called "partition" by alias. That may work in one of the following ways: partition(range); partition!less(range); partition!less(range, n); // n is a number I tried this: static if (is(partition ==

Choosing arity of a template function

A generic function receives an argument called "partition" by alias. That may work in one of the following ways: partition(range); partition!less(range); partition!less(range, n); // n is a number I tried this: static if (is(partition == function) || is(partition == delegate))

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

On Friday, 26 February 2016 at 19:35:38 UTC, Joseph Rushton Wakeling wrote: On Thursday, 25 February 2016 at 17:27:25 UTC, Andrei Alexandrescu wrote: This could be fixed by devising a PRNG that takes a given period n and generates all numbers in [0, n) in exactly n steps. On reflection, I

[Issue 15728] New: ICE while simd vec.f.array compared to ordinal array

https://issues.dlang.org/show_bug.cgi?id=15728 Issue ID: 15728 Summary: ICE while simd vec.f.array compared to ordinal array Product: D Version: D2 Hardware: x86_64 OS: Linux Status: NEW Severity:

Re: Official compiler

On 2/26/2016 1:10 PM, Timon Gehr wrote: Different passes are not really required once semantic analysis becomes asynchronous. Just keep track of semantic analysis dependencies, with strong and weak dependencies and different means to resolve cycles of weak dependencies. Then write the semantic

Re: Syntax highlighting of backticks now supported in Notepad++

On Tuesday, 23 February 2016 at 17:01:47 UTC, Andre wrote: Hi, with the newest version of Notepad++ (6.9) strings enclosed with backticks `Hello World!` are now correctly highlighted. Kind regards André You have a list here of what's not handled:

Re: Official compiler

On 2/26/2016 10:34 AM, Iain Buclaw via Digitalmars-d wrote: One interesting line of development (though would be difficult to implement) would be to do all three semantic passes asynchronously using fibers. I'd be terrified of all the synchronizing that would be necessary there. The lexing,

Re: Official compiler

On 2/26/2016 11:17 AM, David Nadlinger wrote: I was referring to something different in my post, though, as the question concerned "low-hanging fruit". The problem there is really just that template names sometimes grow unreasonably long pretty quickly. As an example, without wanting to divulge

Re: Official compiler

On 2/26/2016 3:45 AM, Dibyendu Majumdar wrote: On Friday, 26 February 2016 at 11:35:04 UTC, Dibyendu Majumdar wrote: On Friday, 26 February 2016 at 06:19:27 UTC, Walter Bright wrote: [...] I recall there was a thread in the LLVM mailing list last year about moving to a different license. So

Re: Official compiler

On 2/26/2016 5:15 AM, Steven Schveighoffer wrote: I think it's much stronger when the email/logs are maintained by a disinterested third party. For example, I'd say emails that were maintained on a private server by one of the parties in the case would be less reliable than logs stored on

[Issue 15727] New: DMD adds default opEqals to structure with SIMD vector

https://issues.dlang.org/show_bug.cgi?id=15727 Issue ID: 15727 Summary: DMD adds default opEqals to structure with SIMD vector Product: D Version: D2 Hardware: x86_64 OS: Linux Status: NEW Severity:

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

On Fri, Feb 26, 2016 at 09:26:54PM +, Joseph Rushton Wakeling via Digitalmars-d wrote: > On Friday, 26 February 2016 at 12:21:11 UTC, Andrei Alexandrescu wrote: > >On 02/26/2016 03:05 AM, Joseph Rushton Wakeling wrote: > >>I can probably find the PRs if you want to see the context. > > > >I

Re: Syntax highlighting of backticks now supported in Notepad++

On Friday, 26 February 2016 at 19:33:09 UTC, Andre wrote: On Friday, 26 February 2016 at 15:31:33 UTC, Remo wrote: On Wednesday, 24 February 2016 at 02:57:20 UTC, Charles wrote: On Tuesday, 23 February 2016 at 17:01:47 UTC, Andre wrote: Hi, with the newest version of Notepad++ (6.9) strings

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

On Friday, 26 February 2016 at 12:21:11 UTC, Andrei Alexandrescu wrote: On 02/26/2016 03:05 AM, Joseph Rushton Wakeling wrote: I can probably find the PRs if you want to see the context. I understand the motivation behind that statement, and am not worried about pointing fingers etc. Would

Re: Official compiler

On 26 Feb 2016 10:16 pm, "Timon Gehr via Digitalmars-d" < digitalmars-d@puremagic.com> wrote: > > On 26.02.2016 19:34, Iain Buclaw via Digitalmars-d wrote: >> >> On 26 Feb 2016 9:45 am, "Walter Bright via Digitalmars-d" >> > wrote:

Re: Official compiler

On 26.02.2016 19:34, Iain Buclaw via Digitalmars-d wrote: On 26 Feb 2016 9:45 am, "Walter Bright via Digitalmars-d" > wrote: > > On 2/26/2016 12:20 AM, Iain Buclaw via Digitalmars-d wrote: >> >> I thought that mulithreaded I/O

LDC 1.0.0-alpha1 has been released! Please help testing!

Hi everyone, LDC 1.0.0-alpha1, the LLVM-based D compiler, is available for download! This ALPHA release is based on the 2.069.2 frontend and standard library and supports LLVM 3.5-3.8. The 1.0 release will be a major milestone. Please help testing to make it the best release ever! As

[Issue 15722] std.algorithm sum should favour speed

https://issues.dlang.org/show_bug.cgi?id=15722 --- Comment #3 from Cédric Picard --- (In reply to adamsibson from comment #2) > (In reply to Cédric Picard from comment #1) > > I would rather have a comment in the doc saying "Pairwise summation is > > slower than naive

Re: [OT] Some neat ideas from the Kotlin language

On my experience programming using Optional's functional interfaces is more reliable then explicit logic, so in case when we have value semantic and Optional then Kotlin's approach is not very useful. My old experiments about this (obviously java-inspired): optional.d import std.typecons;

Re: Normal distribution

On Friday, 26 February 2016 at 20:15:10 UTC, Andrei Alexandrescu wrote: Would it work to define Gaussian generators as regular generators (same as the existing ones), which keep the uniform engine as a member? Assuming that the uniform engine was uniquely and only used by that Gaussian

Re: Calling python code from D

On Friday, 26 February 2016 at 17:15:02 UTC, Wyatt wrote: On Thursday, 25 February 2016 at 22:28:52 UTC, jmh530 wrote: I think PyD is really your best option. That's what I figured, but I wanted to be sure because, well... http://pyd.readthedocs.org/en/latest/embed.html ...these are some

Re: Normal distribution

On 2/26/16 2:32 PM, Joseph Rushton Wakeling wrote: Yup. The basic problem of getting this stuff into phobos are the architectural problems discussed in that talk. Unlike uniform distribution (which is straightforward to implement as a function, no questions asked), the normal distribution is

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

On Friday, 26 February 2016 at 12:23:24 UTC, Andrei Alexandrescu wrote: On 02/26/2016 03:34 AM, Joseph Rushton Wakeling wrote: http://apfelmus.nfshost.com/articles/random-permutations.html This touches the input, we just want to cover it. I thought the whole point of that article was that

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

On Friday, 26 February 2016 at 12:23:24 UTC, Andrei Alexandrescu wrote: On 02/26/2016 03:34 AM, Joseph Rushton Wakeling wrote: http://apfelmus.nfshost.com/articles/random-permutations.html This touches the input, we just want to cover it.

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

On Thursday, 25 February 2016 at 17:27:25 UTC, Andrei Alexandrescu wrote: This could be fixed by devising a PRNG that takes a given period n and generates all numbers in [0, n) in exactly n steps. On reflection, I have a nasty feeling there's a fundamental problem with this proposed approach.

Re: Normal distribution

On Friday, 26 February 2016 at 19:11:15 UTC, John Colvin wrote: On Friday, 26 February 2016 at 18:23:41 UTC, Andrei Alexandrescu wrote: On 02/20/2016 09:06 AM, Edwin van Leeuwen wrote: On Saturday, 20 February 2016 at 14:01:22 UTC, Andrei Alexandrescu wrote: Do we have a good quality

Re: Syntax highlighting of backticks now supported in Notepad++

On Friday, 26 February 2016 at 15:31:33 UTC, Remo wrote: On Wednesday, 24 February 2016 at 02:57:20 UTC, Charles wrote: On Tuesday, 23 February 2016 at 17:01:47 UTC, Andre wrote: Hi, with the newest version of Notepad++ (6.9) strings enclosed with backticks `Hello World!` are now correctly

Re: Official compiler

On Fri, Feb 26, 2016 at 01:53:21PM -0500, Andrei Alexandrescu via Digitalmars-d wrote: > On 02/26/2016 10:38 AM, David Nadlinger wrote: > >On Thursday, 25 February 2016 at 23:06:43 UTC, H. S. Teoh wrote: > >>Are there any low-hanging fruit left that could make dmd faster? > > > >A big one would

Re: Official compiler

On Friday, 26 February 2016 at 18:53:21 UTC, Andrei Alexandrescu wrote: My understanding is the main problem is the _same_ templates are repeatedly instantiated with the same exact parameters - the epitome of redundant work. -- Andrei Within one compiler execution, there might be some

Re: Normal distribution

On Friday, 26 February 2016 at 18:23:41 UTC, Andrei Alexandrescu wrote: On 02/20/2016 09:06 AM, Edwin van Leeuwen wrote: On Saturday, 20 February 2016 at 14:01:22 UTC, Andrei Alexandrescu wrote: Do we have a good quality converter of uniform numbers to Gaussian-distributed numbers around? --

Re: Official compiler

On 02/26/2016 09:50 AM, David Nadlinger wrote: Can we please keep this out of here? Thank you!! -- Andrei

Re: Official compiler

On 02/26/2016 10:38 AM, David Nadlinger wrote: On Thursday, 25 February 2016 at 23:06:43 UTC, H. S. Teoh wrote: Are there any low-hanging fruit left that could make dmd faster? A big one would be overhauling the template mangling scheme so it does not generate mangled names a few hundred kilo

Re: Official compiler

On Friday, 26 February 2016 at 18:19:57 UTC, Steven Schveighoffer wrote: The idea is that ldc and gdc will get plenty of warning if something breaks. As stated, this in itself would be utterly useless. Right now, you can be absolutely certain that the AST semantics will change in between

Re: no size yet for forward reference error

The struct->class workaround is unworkable in this case because underlying C database clients are often pretty sensitive to out of order resource cleanup and generate errors or crash as a result. The structs are essential but I will limit the design to avoid the issue for now.

Re: Official compiler

On 26 Feb 2016 9:45 am, "Walter Bright via Digitalmars-d" < digitalmars-d@puremagic.com> wrote: > > On 2/26/2016 12:20 AM, Iain Buclaw via Digitalmars-d wrote: >> >> I thought that mulithreaded I/O did not change anything, or slowed compilation >> down in some cases? >> >> Or I recall seeing a

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

On Friday, 26 February 2016 at 16:45:53 UTC, Andrei Alexandrescu wrote: On 02/26/2016 10:19 AM, Alex Parrill wrote: On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you

Re: Normal distribution

On 02/20/2016 09:06 AM, Edwin van Leeuwen wrote: On Saturday, 20 February 2016 at 14:01:22 UTC, Andrei Alexandrescu wrote: Do we have a good quality converter of uniform numbers to Gaussian-distributed numbers around? -- Andrei There is one in dstats:

Re: Official compiler

On 2/26/16 9:26 AM, Radu wrote: On Friday, 26 February 2016 at 13:11:11 UTC, Steven Schveighoffer wrote: On 2/26/16 7:02 AM, Radu wrote: On Friday, 26 February 2016 at 11:01:46 UTC, Walter Bright wrote: I don't see anything unfair. gdc, ldc, and dmd are each as good as their respective teams

[Issue 15723] GC memory leakage depending on source code size

https://issues.dlang.org/show_bug.cgi?id=15723 Denis Shelomovskij changed: What|Removed |Added Summary|GC memory leakade depending |GC memory

Re: GStreamer and D

On Fri, 2016-02-26 at 14:40 +, Kagamin via Digitalmars-d-learn wrote: > https://gstreamer.freedesktop.org/data/doc/gstreamer/head/manual/html > /chapter-helloworld.html#section-helloworld - Hello world. > https://gstreamer.freedesktop.org/data/doc/gstreamer/head/manual/html > /index.html -

Re: Calling python code from D

On Friday, 26 February 2016 at 17:15:02 UTC, Wyatt wrote: On Thursday, 25 February 2016 at 22:28:52 UTC, jmh530 wrote: I think PyD is really your best option. That's what I figured, but I wanted to be sure because, well... http://pyd.readthedocs.org/en/latest/embed.html ...these are some

Re: Calling python code from D

On Thursday, 25 February 2016 at 22:28:52 UTC, jmh530 wrote: I think PyD is really your best option. That's what I figured, but I wanted to be sure because, well... http://pyd.readthedocs.org/en/latest/embed.html ...these are some sparse docs. I did stumble into them, but it feels like a

Re: Syntax highlighting of backticks now supported in Notepad++

On Friday, 26 February 2016 at 15:31:33 UTC, Remo wrote: Unfortunately syntax highlighting for D still do not work even with v6.9. Huh? I use Notepad++ on Windows and it highlights syntax. Maybe not as much as Sublime nor as pretty...

[Issue 12994] Function-local imported name shadowing error

https://issues.dlang.org/show_bug.cgi?id=12994 Wyatt changed: What|Removed |Added CC||wyatt@gmail.com ---

Re: D in Ubuntu apps ecosystem

On Friday, 26 February 2016 at 09:25:19 UTC, Joseph Rushton Wakeling wrote: On Thursday, 25 February 2016 at 19:21:48 UTC, Joakim wrote: Well, if I understand right, the hardest part of the work (making sure things run OK on ARM) has substantially been done by you and others. Assuming

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

On 02/26/2016 10:19 AM, Alex Parrill wrote: On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you describe is k-Dimensional Equidistribution (in this case k=1). I would

Re: Shared static constructors from C# EXE

On Friday, 26 February 2016 at 08:37:35 UTC, Benjamin Thaut wrote: On Thursday, 25 February 2016 at 17:46:18 UTC, Thalamus wrote: On Thursday, 25 February 2016 at 16:05:37 UTC, Benjamin Thaut wrote: [...] Thanks Benjamin. When I went to whittle this down to its barest essentials, though,

Re: dub: how to reference a compiled package

On Fri, 26 Feb 2016 03:19:26 +, mahdi wrote: > Great! Thanks. > > I was looking for a feature like `jar` files in Java or `assemblies` in > C# where all compiled code and metadata/symbols are stored together > inside a single binary file. C# and Java provide their own linkers and specify

Re: Minimise and collect by GC when OutOfMemory

On Fri, 26 Feb 2016 05:47:08 +, tcak wrote: > Would it be a good idea to call "collect" and "minimize" methods of > core.memory.GC when OutOfMemory error is received FOR A LONG RUNNING > PROGRAM? or there won't be any benefit of that? > > Example program: A web server that allocates and

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

On Friday, 26 February 2016 at 15:21:08 UTC, Nicholas Wilson wrote: On Friday, 26 February 2016 at 15:17:16 UTC, Craig Dillabaugh wrote: On Friday, 26 February 2016 at 15:15:11 UTC, Nicholas Wilson wrote: On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016

Re: D in Ubuntu apps ecosystem

On Friday, 26 February 2016 at 09:25:19 UTC, Joseph Rushton Wakeling wrote: On Thursday, 25 February 2016 at 19:21:48 UTC, Joakim wrote: But can such a powerful phone handle Ubuntu Touch? ;) The preliminary reviews for the Meizu Pro 5 Ubuntu Edition, which you're presumably referencing, are

Re: Official compiler

On Thursday, 25 February 2016 at 23:06:43 UTC, H. S. Teoh wrote: Are there any low-hanging fruit left that could make dmd faster? A big one would be overhauling the template mangling scheme so it does not generate mangled names a few hundred kilo (!) bytes in size anymore for code that uses

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

On Friday, 26 February 2016 at 15:17:16 UTC, Craig Dillabaugh wrote: On Friday, 26 February 2016 at 15:15:11 UTC, Nicholas Wilson wrote: On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of

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

On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you describe is k-Dimensional Equidistribution (in this case k=1). I would suggest taking a look at

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

On Friday, 26 February 2016 at 15:15:11 UTC, Nicholas Wilson wrote: On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you describe is k-Dimensional Equidistribution (in

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

On Friday, 26 February 2016 at 14:59:43 UTC, Andrei Alexandrescu wrote: On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you describe is k-Dimensional Equidistribution (in this case k=1). I would suggest taking a look at

Re: Why is mangling different for separate compilation?

On Friday, 26 February 2016 at 14:56:04 UTC, Jacob Carlborg wrote: On 2016-02-26 13:45, Atila Neves wrote: foo.d: - void main() { import bar; foreach(ut; __traits(getUnitTests, bar)) ut(); } - bar.d: - unittest { assert(1 == 2); } - # compile all at once dmd

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

On 02/25/2016 06:46 PM, Nicholas Wilson wrote: The technical name for the property of distribution you describe is k-Dimensional Equidistribution (in this case k=1). I would suggest taking a look at http://www.pcg-random.org. They claim to have both arbitrary period and k-Dimensional

Re: Why is mangling different for separate compilation?

On 2016-02-26 13:45, Atila Neves wrote: foo.d: - void main() { import bar; foreach(ut; __traits(getUnitTests, bar)) ut(); } - bar.d: - unittest { assert(1 == 2); } - # compile all at once dmd -unittest foo.d bar.d # fine # compile separately dmd -c -unittest foo.d

Re: Official compiler

On Friday, 26 February 2016 at 11:50:27 UTC, Russel Winder wrote: On Fri, 2016-02-26 at 11:12 +, BBasile via Digitalmars-d wrote: […] BTW Malicious people can cheat and commit in the past, according to https://github.com/gelstudios/gitfiti commitment date is not reliable. Indeed,

Re: GStreamer and D

https://gstreamer.freedesktop.org/data/doc/gstreamer/head/manual/html/chapter-helloworld.html#section-helloworld - Hello world. https://gstreamer.freedesktop.org/data/doc/gstreamer/head/manual/html/index.html - GStreamer Application Development Manual

Re: Official compiler

On Friday, 26 February 2016 at 13:11:11 UTC, Steven Schveighoffer wrote: On 2/26/16 7:02 AM, Radu wrote: On Friday, 26 February 2016 at 11:01:46 UTC, Walter Bright wrote: I don't see anything unfair. gdc, ldc, and dmd are each as good as their respective teams make them. The lack of

Re: Beta D 2.070.1-b1

On 2/26/16 8:21 AM, Temtaime wrote: On Thursday, 25 February 2016 at 11:39:28 UTC, Martin Nowak wrote: On Thursday, 25 February 2016 at 08:52:14 UTC, nkgu wrote: That's nothing but the DL link in http://dlang.org/changelog/2.070.1.html is broken. Thanks, fixed. I got a tons of «

Re: Dynamic pitch shift

On Friday, 26 February 2016 at 13:21:12 UTC, Guillaume Piolat wrote: We are not talking of the same thing. I was thinking about the table frequency cutoff which is 2x lower every level of mipmap Ok. I think is most common to use high levels of oversampling for tables so one can get better SNR

Re: how to initialise const variables

On Friday, 26 February 2016 at 03:18:02 UTC, Nicholas Wilson wrote: On Friday, 26 February 2016 at 02:48:35 UTC, cym13 wrote: On Friday, 26 February 2016 at 02:32:44 UTC, Nicholas Wilson wrote: struct A { const (void *) p; } struct B { Aa; this(void * _p) { a.p =

Re: Template this parameter in constructor

On Sunday, 21 February 2016 at 21:48:21 UTC, Steven Schveighoffer wrote: This isn't a bug. Here is what happens. 1. template this is assigned the compile-time type of the object *when the function is called*. 2. A base class constructor is called from the next derived constructor. So C2's

Re: Dynamic pitch shift

On Thursday, 25 February 2016 at 07:02:24 UTC, Ola Fosheim Grøstad wrote: On Wednesday, 24 February 2016 at 17:52:39 UTC, Guillaume Piolat wrote: Though it isn't fantastic aliasing-wise on the last octave, I should try something than power-of-2s next time I need it. Why would it help to not

Re: Beta D 2.070.1-b1

On Thursday, 25 February 2016 at 11:39:28 UTC, Martin Nowak wrote: On Thursday, 25 February 2016 at 08:52:14 UTC, nkgu wrote: That's nothing but the DL link in http://dlang.org/changelog/2.070.1.html is broken. Thanks, fixed. I got a tons of « Deprecation: module std.array is not accessible

Re: Official compiler

On 2/26/16 6:04 AM, Russel Winder via Digitalmars-d wrote: On Fri, 2016-02-26 at 02:52 -0800, Walter Bright via Digitalmars-d wrote: […] I'm not aware of any, either, that is specific to github. But given how digital records in general (such as email, social media posts, etc.) are routinely

Re: Official compiler

On 2/26/16 7:02 AM, Radu wrote: On Friday, 26 February 2016 at 11:01:46 UTC, Walter Bright wrote: I don't see anything unfair. gdc, ldc, and dmd are each as good as their respective teams make them. The lack of fairness comes from the way the ecosystem is setup, you have the reference

Why is mangling different for separate compilation?

foo.d: - void main() { import bar; foreach(ut; __traits(getUnitTests, bar)) ut(); } - bar.d: - unittest { assert(1 == 2); } - # compile all at once dmd -unittest foo.d bar.d # fine # compile separately dmd -c -unittest foo.d dmd -c -unittest bar.d dmd foo.o bar.o

Re: Dynamic pitch shift

On Thursday, 25 February 2016 at 15:15:20 UTC, Luis wrote: - Wavetables - band-limited resampling algorithm aka BLIP or BLEP algorithms (See http://www.cs.cmu.edu/~eli/L/icmc01/hardsync.html and http://slack.net/~ant/libs/audio.html#Blip_Buffer ) I suggest just porting STK from C++ to D. It

Re: Again about benchmarks: vibe.d and other web frameworks

Am 26.02.2016 um 13:14 schrieb Ozan: Hi I found a benchmark page for web frameworks. http://www.techempower.com/benchmarks/#section=data-r12=peak=query Here, vibe.d was lost somewhere in bottom of slowest frameworks, what surprise me. I tried some test out, compared jetty, servlets, grails, php

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

On 02/26/2016 03:34 AM, Joseph Rushton Wakeling wrote: http://apfelmus.nfshost.com/articles/random-permutations.html This touches the input, we just want to cover it. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.150.9347=rep1=pdf This seems like a nice article but I don't find

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

On 02/26/2016 03:05 AM, Joseph Rushton Wakeling wrote: I can probably find the PRs if you want to see the context. I understand the motivation behind that statement, and am not worried about pointing fingers etc. Would be great if a new PR removed the text. -- Andrei

  1   2   >