[Issue 14367] Print warnings by default

https://issues.dlang.org/show_bug.cgi?id=14367 --- Comment #5 from Don --- I think this bug should be closed as invalid. As stated in comment 3, warnings and deprecations are two very different things. The bug report is based on the misconception that they are the same.

[Issue 12987] topN should return the top portion of the range

https://issues.dlang.org/show_bug.cgi?id=12987 Infiltrator changed: What|Removed |Added CC|

Re: https everywhere update - dlang.org gets an "A" now!

Now also certified (Let's Encrypt made this really straight forward): https://code.dlang.org/ https://forum.rejectedsoftware.com/ https://vibed.org/ All pass with an A for the ssllabs.com test. I'll also setup default HTTP->HTTPS redirects.

Re: Release D 2.069.0

On Monday, 7 December 2015 at 17:32:05 UTC, Márcio Martins wrote: On Monday, 7 December 2015 at 17:06:48 UTC, Jean-Yves Vion-Dury wrote: On Wednesday, 4 November 2015 at 15:25:04 UTC, Márcio Martins wrote: [...] FYI, I just installed the 2.069 version, and now I'm unable to compile some

Re: DConf 2016 news: 20% sold out, book signing

On Monday, 7 December 2015 at 20:42:21 UTC, Adam D. Ruppe wrote: On Monday, 7 December 2015 at 19:37:11 UTC, deadalnix wrote: Adam won't be coming ? I haven't decided for sure yet, but probably not. I don't like travel at all and the thought of a trans-atlantic flight strikes me as the

Re: OT: Swift is now open source

On Friday, 4 December 2015 at 03:18:02 UTC, Steven Schveighoffer wrote: The type system is static, and everything is done via inference, which is very nice. According to a swift dev I talked to, part of the algorithm is exponential and they have compile time problem because of this. Speed

[Issue 9323] Document the deltas between tdpl (rox) and dlang.org

https://issues.dlang.org/show_bug.cgi?id=9323 Infiltrator changed: What|Removed |Added Status|NEW |RESOLVED

[Issue 14367] Print warnings by default

https://issues.dlang.org/show_bug.cgi?id=14367 --- Comment #6 from Sobirari Muhomori --- Warnings can work as out of line code style checkers. Breaking compilation on enabled warnings doesn't work well for this. --

[Issue 12141] std.algorithm: implement deterministic topN

https://issues.dlang.org/show_bug.cgi?id=12141 Infiltrator changed: What|Removed |Added CC|

Re: Release D 2.069.0

On Tuesday, 8 December 2015 at 08:39:26 UTC, Jean-Yves Vion-Dury wrote: On Monday, 7 December 2015 at 17:32:05 UTC, Márcio Martins wrote: On Monday, 7 December 2015 at 17:06:48 UTC, Jean-Yves Vion-Dury wrote: On Wednesday, 4 November 2015 at 15:25:04 UTC, Márcio Martins wrote: [...] FYI, I

[Issue 15417] Wrong parameter passing for variadic nested functions within aggregate

https://issues.dlang.org/show_bug.cgi?id=15417 Iain Buclaw changed: What|Removed |Added CC||ibuc...@gdcproject.org

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 11:45:25 UTC, Random D user wrote: Ok. This is minimal app that crashes for me. If someone could try this: At the very least, there is no crash when changing `struct Foo` to `static struct Foo`, so it is perhaps related to `Foo` being an inner struct with a

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 11:45:25 UTC, Random D user wrote: Ok. This is minimal app that crashes for me. If someone could try this: OK, this at least reproducibly crashes here, too (-m32 and -m64 on Windows, tried dmd 2.069.0 and 2.067.1).

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 11:04:49 UTC, Random D user wrote: I need to look into this more. Ok. This is minimal app that crashes for me. If someone could try this: class App { this() { } void crash( int val ) in { assert( val == 1 ); } body

[Issue 15401] partialSort should accept two ranges

https://issues.dlang.org/show_bug.cgi?id=15401 Infiltrator changed: What|Removed |Added Depends on||15421 --

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 11:45:25 UTC, Random D user wrote: Ok. This is minimal app that crashes for me. If someone could try this: Interesting. With dmd 2.064.2, your example compiles and runs fine. With dmd 2.065.0, it does not compile, complaining that there is no opCmp for `Foo`s.

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 01:23:40 UTC, Ivan Kazmenko wrote: On Monday, 7 December 2015 at 22:03:42 UTC, Alex Parrill wrote: On Monday, 7 December 2015 at 18:48:18 UTC, Random D user Tested the same code with -m32 and -m64 on Windows. Works for me, too. I tried this again. And it seems

[Issue 15417] Wrong parameter passing for variadic nested functions within aggregate

https://issues.dlang.org/show_bug.cgi?id=15417 --- Comment #2 from Mathias Lang --- Oops :P Well, using `c1` doesn't change a thing here (and va_start is not needed here according to the docs). Test case closer to the original bug: ``` import std.stdio,

Re: AA struct hashing bug?

On Tuesday, 8 December 2015 at 11:04:49 UTC, Random D user wrote: On Tuesday, 8 December 2015 at 01:23:40 UTC, Ivan Kazmenko wrote: On Monday, 7 December 2015 at 22:03:42 UTC, Alex Parrill wrote: On Monday, 7 December 2015 at 18:48:18 UTC, Random D user Tested the same code with -m32 and -m64

[Issue 15421] New: The behaviours of the topNs differ with the bottom

https://issues.dlang.org/show_bug.cgi?id=15421 Issue ID: 15421 Summary: The behaviours of the topNs differ with the bottom Product: D Version: D2 Hardware: All OS: All Status: NEW Severity: normal

Re: benchmark on binary trees

using Apache Portable Runtime(APR) like in the C version : http://dpaste.dzfl.pl/6ca8b5ffd6dc works like a charm, 2.061s on my machine ! if file name is binarytrees.d dmd -w -inline -O -release -I/usr/include/apr-1.0 -L/usr/lib/x86_64-linux-gnu/libapr-1.so -of"binarytrees" "binarytrees.d"

Re: How to make a transparent wrapper type?

On Monday, 7 December 2015 at 20:03:07 UTC, Namespace wrote: This seems to work: struct RefVal(T) { private T* ptr; this(T* val) { ptr = val; } ref auto opAssign(U)(auto ref U value) { *ptr = value;

Re: How to make a transparent wrapper type?

On Tuesday, 8 December 2015 at 10:26:18 UTC, Random D user wrote: On Monday, 7 December 2015 at 20:03:07 UTC, Namespace wrote: This seems to work: struct RefVal(T) { private T* ptr; this(T* val) { ptr = val; } ref auto

Re: Reset all Members of a Aggregate Instance

On Tuesday, 8 December 2015 at 05:13:51 UTC, Chris Wright wrote: On Tue, 08 Dec 2015 14:12:02 +1100, Daniel Murphy wrote: On 4/12/2015 8:38 AM, Chris Wright wrote: An object reference is just a pointer, but we can't directly cast it. So we make a pointer to it and cast that; the type system

Re: Release D 2.069.0

On Tuesday, 8 December 2015 at 08:39:26 UTC, Jean-Yves Vion-Dury wrote: On Monday, 7 December 2015 at 17:32:05 UTC, Márcio Martins wrote: On Monday, 7 December 2015 at 17:06:48 UTC, Jean-Yves Vion-Dury wrote: On Wednesday, 4 November 2015 at 15:25:04 UTC, Márcio Martins wrote: [...] FYI, I

Re: Complexity nomenclature

On Monday, 7 December 2015 at 16:15:46 UTC, Andrei Alexandrescu wrote: These are still expressible without a DSL: BigO(Atom("array[].walkLength") + Atom("r.walkLength")) etc. We can remove the use of strings if we tag walkLength with BigO: // this: BigO(Atom("array[].walkLength") +

[Issue 15421] The behaviours of the topNs differ with the bottom

https://issues.dlang.org/show_bug.cgi?id=15421 Infiltrator changed: What|Removed |Added Blocks||15401 --

[Issue 15421] The behaviours of the topNs differ with the bottom

https://issues.dlang.org/show_bug.cgi?id=15421 --- Comment #1 from Infiltrator --- https://github.com/D-Programming-Language/phobos/pull/3865 --

[Issue 15401] partialSort should accept two ranges

https://issues.dlang.org/show_bug.cgi?id=15401 Infiltrator changed: What|Removed |Added CC|

C++ std::string, std::vector and name mangling

A while ago I proposed this PR [1] to add support for C++ std::string, std::vector to D. It's blocked on invalid name mangling for C++ templates [2]. I started fixing src/cppmangle.d [3] but it needs a complete rewrite. Because mangling rules are complex, I took some time to gather my

Re: benchmark on binary trees

C++ version : real0m3.587s user0m9.211s sys 0m7.341s

Re: Question about mysql-d Object

On Monday, 7 December 2015 at 16:11:19 UTC, Daniel Kozak wrote: On Monday, 7 December 2015 at 14:40:12 UTC, Martin Tschierschke wrote: When I do the following: auto mysql = new Mysql("localhost", 3306, "mt", "", "verwaltung"); auto rows = mysql.query("select field from my_table limit 50");

[Issue 15422] New: Crash on nested struct

https://issues.dlang.org/show_bug.cgi?id=15422 Issue ID: 15422 Summary: Crash on nested struct Product: D Version: D2 Hardware: All URL: http://forum.dlang.org/post/mufvqrqgkcmkorwumgjm@forum .dlang.org

What complexity have a log(sum) shape?

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 these occur in some important algorithms? I couldn't think of any nor find

[Issue 15401] partialSort should accept two ranges

https://issues.dlang.org/show_bug.cgi?id=15401 --- Comment #2 from Andrei Alexandrescu --- (In reply to Infiltrator from comment #1) > Once issue 15421 is fixed, this is a simple matter of > topN(l, r); > sort(l); > > Which brings us to the question of: should

Re: Question about mysql-d Object

V Tue, 08 Dec 2015 14:34:53 + Martin Tschierschke via Digitalmars-d-learn napsáno: > On Monday, 7 December 2015 at 16:11:19 UTC, Daniel Kozak wrote: > > On Monday, 7 December 2015 at 14:40:12 UTC, Martin Tschierschke > > wrote: > >> When I do the

[Issue 15421] The behaviours of the topNs differ with the bottom

https://issues.dlang.org/show_bug.cgi?id=15421 Andrei Alexandrescu changed: What|Removed |Added CC||and...@erdani.com

Re: Question about mysql-d Object

V Tue, 08 Dec 2015 14:34:53 + Martin Tschierschke via Digitalmars-d-learn napsáno: > On Monday, 7 December 2015 at 16:11:19 UTC, Daniel Kozak wrote: > > On Monday, 7 December 2015 at 14:40:12 UTC, Martin Tschierschke > > wrote: > >> When I do the

[Issue 12987] topN should return the top portion of the range

https://issues.dlang.org/show_bug.cgi?id=12987 --- Comment #2 from github-bugzi...@puremagic.com --- Commit pushed to master at https://github.com/D-Programming-Language/phobos https://github.com/D-Programming-Language/phobos/commit/3f9a33f91d6502947d880448ab8049236a1efa4e Merge pull request

Re: OT: Swift is now open source

On 12/8/15 4:14 AM, deadalnix wrote: On Friday, 4 December 2015 at 03:18:02 UTC, Steven Schveighoffer wrote: The type system is static, and everything is done via inference, which is very nice. According to a swift dev I talked to, part of the algorithm is exponential and they have compile

[Issue 12987] topN should return the top portion of the range

https://issues.dlang.org/show_bug.cgi?id=12987 github-bugzi...@puremagic.com changed: What|Removed |Added Status|NEW |RESOLVED

Re: Real Time-ing

prev=now; call(); wait(prev+dur-now); call();

Re: Real Time-ing

On Tuesday, 8 December 2015 at 15:50:35 UTC, Kagamin wrote: Oops, no. next+=dur; wait(next-now); call(); what calls does this use from the std library? to get the current time? Wait a amount of time?

DlangIDE update

Hello, DlangIDE is getting close to usable. DlangIDE is and IDE for D programming language written in D using DlangUI library. Project page: https://github.com/buggins/dlangide To try, use `dub fetch dlangide && dub run dlangide` try to create and run DlangUI Helloworld project, or open

Re: Question about mysql-d Object

On Tuesday, 8 December 2015 at 15:14:06 UTC, Daniel Kozak wrote: [...] >> A nested loop, did not worked either: >> >> foreach(row;rows){ >> foreach(field;row){ >> writeln(field);} >> } [...] Now I took a work around, getting the field names in a separate mysql-request, but they should be

Real Time-ing

So, I mostly do programming that is of run to completion verity. But I have a dream of calling functions periodically. So my question is: What is the best (most time accurate) way to call a function every n time units? What is the best way to measure the jitter of these calls? I'm also

Re: Real Time-ing

Oops, no. next+=dur; wait(next-now); call();

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

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?

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: Real Time-ing

On Tuesday, 8 December 2015 at 15:35:18 UTC, Taylor Hillegeist wrote: So, I mostly do programming that is of run to completion I took a stab at the problem: http://dpaste.dzfl.pl/2eef530d00fc 0 nsecs with jitter of :5 nsecs 498937256 nsecs with jitter of :1062744 nsecs 499036173

Re: OT: Swift is now open source

On Tue, 08 Dec 2015 08:38:23 -0500, Steven Schveighoffer wrote: > On 12/8/15 4:14 AM, deadalnix wrote: >> On Friday, 4 December 2015 at 03:18:02 UTC, Steven Schveighoffer wrote: >>> The type system is static, and everything is done via inference, which >>> is very nice. >>> >>> >> According to a

Re: Real Time-ing

On Tue, 08 Dec 2015 15:35:18 +, Taylor Hillegeist wrote: > So, I mostly do programming that is of run to completion verity. > But I have a dream of calling functions periodically. So my question is: > > What is the best (most time accurate) way to call a function every n > time units?

Re: DLang users telegram group

On Monday, 30 November 2015 at 10:58:34 UTC, Quentin Ladeveze wrote: Hi everybody, I just created a Telegram group for dlang users : https://telegram.me/joinchat/BeLaugMz35ZxQUq2fks4YQ Feel free to join ! says the link has expired

Re: Regression?

On Wednesday, 9 September 2015 at 01:35:26 UTC, Sebastiaan Koppe wrote: Thanks for your advice. But that is not what I asked for. The question was, why doesn't this work anymore with the latest (2.068.0 and 2.068.1) compiler: ``` auto ls =

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

On 12/08/2015 04:25 PM, 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 these occur in some

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

On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei

Re: DlangIDE update

On Tuesday, 8 December 2015 at 15:58:43 UTC, Vadim Lopatin wrote: Hello, DlangIDE is getting close to usable. DlangIDE is and IDE for D programming language written in D using DlangUI library. Sweet! Glad you're back and working on this! Was wanting to give it a shot, but typing } on my

Re: OT: Swift is now open source

On Tuesday, 8 December 2015 at 17:16:50 UTC, Chris Wright wrote: On Tue, 08 Dec 2015 08:38:23 -0500, Steven Schveighoffer wrote: On 12/8/15 4:14 AM, deadalnix wrote: On Friday, 4 December 2015 at 03:18:02 UTC, Steven Schveighoffer wrote: The type system is static, and everything is done via

Re: DlangIDE update

On Tuesday, 8 December 2015 at 15:58:43 UTC, Vadim Lopatin wrote: Hello, DlangIDE is getting close to usable. DlangIDE is and IDE for D programming language written in D using DlangUI library. [...] Congrats! Glad to see that project is not abandoned.

Re: The @@@BUG@@@ the size of China - std.conv.d - Target parse(Target, Source)(ref Source s, uint radix)

On Tuesday, 8 December 2015 at 00:40:29 UTC, tsbockman wrote: Someone still needs to review the PR, though. Thanks! Looks like it's been merged already. It was a double problem... I failed to read the bit about advancing the ref and then the old big @@@BUG@@@ comment in the unit test made

[Issue 15423] New: [REG v2.067.1] File.byLineCopy.joiner.parseJSON

https://issues.dlang.org/show_bug.cgi?id=15423 Issue ID: 15423 Summary: [REG v2.067.1] File.byLineCopy.joiner.parseJSON Product: D Version: D2 Hardware: All OS: All Status: NEW Severity: regression

[Issue 15424] New: openSUSE warns on gethostbyname uses

https://issues.dlang.org/show_bug.cgi?id=15424 Issue ID: 15424 Summary: openSUSE warns on gethostbyname uses Product: D Version: D2 Hardware: All OS: Linux Status: NEW Severity: normal Priority:

Re: Regression?

On Wednesday, 9 September 2015 at 01:35:26 UTC, Sebastiaan Koppe wrote: Thanks for your advice. But that is not what I asked for. The question was, why doesn't this work anymore with the latest (2.068.0 and 2.068.1) compiler: ``` auto ls =

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

On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei Surely I'm missing something obvious but why is it true exactly?

Re: C++ std::string, std::vector and name mangling

Thank you for your work on this. Hopefully someone else knows enough about name mangling and is willing to do some work on it.

[Issue 15423] [REG v2.067.1] File.byLineCopy.joiner.parseJSON

https://issues.dlang.org/show_bug.cgi?id=15423 Vladimir Panteleev changed: What|Removed |Added CC|

Using gdb by some process to let this process monitor its state by itself

Is it possible to invoke gdb by some process that using data from gdb this process can inspect itself? For example I'd like to generate breakpoints for gdb with conditions and if this conditions meet get for example pointer to some data structure from gdb and process it by means of D, not gdb,

Re: Moving forward with work on the D language and foundation

On Wed, Dec 9, 2015 at 9:12 AM, Tony via Digitalmars-d-announce < digitalmars-d-announce@puremagic.com> wrote: > [snip] > One thing that comes to mind to refute the contention that senescence > would be insignificant at the age of 50 is notable technical achievement. > > If we were to list the

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

On 12/08/2015 04:55 PM, Timon Gehr wrote: The context is asymptotic runtime bounds. The special cases for small values of continuous logarithms can just be defined away. They have no relevance for asymptotic runtime analysis (even though defining big-O adequately for multiple variables is more

Re: DConf 2016 news: 20% sold out, book signing

On 12/8/2015 12:47 AM, wobbles wrote: On Monday, 7 December 2015 at 20:42:21 UTC, Adam D. Ruppe wrote: On Monday, 7 December 2015 at 19:37:11 UTC, deadalnix wrote: Adam won't be coming ? I haven't decided for sure yet, but probably not. I don't like travel at all and the thought of a

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

On 12/08/2015 11:31 PM, Andrei Alexandrescu wrote: On 12/08/2015 04:55 PM, Timon Gehr wrote: The context is asymptotic runtime bounds. The special cases for small values of continuous logarithms can just be defined away. They have no relevance for asymptotic runtime analysis (even though

Re: And here's another interesting algorithm/structure: Randomized Slide to Front

On Monday, 30 November 2015 at 21:33:31 UTC, Andrei Alexandrescu wrote: Now that we got talking about searching in arrays, allow me to also share an idea I've had a short while ago. I wrote a range-based implementation to see how it would look like.

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

On Wednesday, 9 December 2015 at 01:40:12 UTC, Timon Gehr wrote: On 12/09/2015 02:02 AM, H. S. Teoh via Digitalmars-d wrote: Big-O notation deals with asymptotic behaviour as the variables approach infinity, so behaviour at 'small' values of m and n are irrelevant. The problem is, however,

[Issue 15426] [Home] link to TWID broken from the home page

https://issues.dlang.org/show_bug.cgi?id=15426 Adam D. Ruppe changed: What|Removed |Added Status|NEW |RESOLVED

Re: Release D 2.069.0

On Tue, 08 Dec 2015 22:07:15 +, deadalnix wrote: > That's fucking ridiculous. > > I'm sorry, but strong word are warranted on that one. Memory consumption > have been an issue for a while now. Never freeing and assuming > everything will be already to win few ms out of a build is the most >

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

On Tue, Dec 08, 2015 at 09:30:09PM +, Charles via Digitalmars-d wrote: > On Tuesday, 8 December 2015 at 20:56:28 UTC, cym13 wrote: > >On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: > >>On 12/08/2015 12:12 PM, Timon Gehr wrote: > >>>O(log(n+m)) = O(log(n)+log(m)). > >>

[Issue 15426] New: [Home] link to TWID broken from the home page

https://issues.dlang.org/show_bug.cgi?id=15426 Issue ID: 15426 Summary: [Home] link to TWID broken from the home page Product: D Version: D2 Hardware: All URL: http://dlang.org/ OS: All Status: NEW

Re: DlangIDE update

Awesome! Is there any chance of bundling DCD? It would be a lot more convenient if I didn't even have to think about getting another completion program and running it on my project.

Re: Real Time-ing

On Tuesday, 8 December 2015 at 16:40:04 UTC, Taylor Hillegeist wrote: On Tuesday, 8 December 2015 at 15:35:18 UTC, Taylor Hillegeist wrote: So, I mostly do programming that is of run to completion I took a stab at the problem: http://dpaste.dzfl.pl/2eef530d00fc 0 nsecs with jitter of

Re: Advent of Code

Thanks for suggesting this. This is fun! Although, I've taken on quite a different challenge myself. I'm computing all of the answers only by using my console in Firefox. I'm actually getting through these pretty quickly. (It helps to know some ES5 and ES6.) I can imagine the D code already,

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

On 12/09/2015 02:02 AM, H. S. Teoh via Digitalmars-d wrote: Big-O notation deals with asymptotic behaviour as the variables approach infinity, so behaviour at 'small' values of m and n are irrelevant. The problem is, however, that only m /or/ n could be small. Therefore, formalizing this

Re: Complexity nomenclature

On Friday, 4 December 2015 at 01:27:42 UTC, Andrei Alexandrescu wrote: Consider the collections universe. So we have an imperative primitive like: c.insertAfter(r, x) where c is a collection, r is a range previously extracted from c, and x is a value convertible to collection's element type.

Re: Moving forward with work on the D language and foundation

On Friday, 28 August 2015 at 20:34:16 UTC, Luís Marques wrote: On Monday, 24 August 2015 at 18:43:01 UTC, Andrei Alexandrescu wrote: Following an increasing desire to focus on working on the D language and foundation, I have recently made the difficult decision to part ways with Facebook, my

[Issue 15427] New: dynamic casting functions should be available in TypeInfo_Class

https://issues.dlang.org/show_bug.cgi?id=15427 Issue ID: 15427 Summary: dynamic casting functions should be available in TypeInfo_Class Product: D Version: D2 Hardware: All OS: All Status: NEW

[Issue 15427] dynamic casting functions should be available in TypeInfo_Class

https://issues.dlang.org/show_bug.cgi?id=15427 Ketmar Dark changed: What|Removed |Added CC|

Re: Advent of Code

On Wednesday, 2 December 2015 at 08:45:11 UTC, Adrian Matoga wrote: On Wednesday, 2 December 2015 at 03:50:20 UTC, Charles wrote: (..) auto input = "arbitrarily long string of '(' and ')'"; int floor; foreach(movement; input) floor += (movement == '(' ? 1 : -1);

Re: Moving forward with work on the D language and foundation

On Friday, 28 August 2015 at 13:08:36 UTC, Chris wrote: On Friday, 28 August 2015 at 12:28:43 UTC, Russel Winder wrote: On Thu, 2015-08-27 at 16:01 +, BBasile via Digitalmars-d-announce wrote: […] That's courageous, particularly past 50 yo. It's a different culture, past 50 yo in Europe

[Issue 15427] dynamic casting functions should be available in TypeInfo_Class

https://issues.dlang.org/show_bug.cgi?id=15427 --- Comment #1 from Ketmar Dark --- p.s. `ti.dynamicCast(O)` should still return `void*`. not a big deal, it's very internal API anyway. --

Re: Nullable condition operator

On Monday, 7 December 2015 at 13:28:21 UTC, rumbu wrote: On Monday, 7 December 2015 at 11:40:45 UTC, Martin6265 wrote: Hello, I think nullable condition operator and null coalescending operator should be a nice new features in D. Happy reading:

Re: DlangIDE update

On Tuesday, 8 December 2015 at 18:18:29 UTC, default0 wrote: Sweet! Glad you're back and working on this! Was wanting to give it a shot, but typing } on my keyboard (german layout, right-alt + 0) did not actually insert the character into the opened document, so I gave up. What is a platform?

Re: DlangIDE update

On Tuesday, 8 December 2015 at 23:45:47 UTC, Chris Wright wrote: Awesome! Is there any chance of bundling DCD? It would be a lot more convenient if I didn't even have to think about getting another completion program and running it on my project. For win32, it's bundled with dcd-client and

Re: Moving forward with work on the D language and foundation

On Wed, 09 Dec 2015 05:40:47 +, Tony wrote: > On Friday, 28 August 2015 at 13:08:36 UTC, Chris wrote: >> On Friday, 28 August 2015 at 12:28:43 UTC, Russel Winder wrote: >>> On Thu, 2015-08-27 at 16:01 +, BBasile via Digitalmars-d-announce >>> wrote: […] That's courageous,

Re: Moving forward with work on the D language and foundation

On Wednesday, 9 December 2015 at 06:08:01 UTC, Chris Wright wrote: On Wed, 09 Dec 2015 05:40:47 +, Tony wrote: On Friday, 28 August 2015 at 13:08:36 UTC, Chris wrote: On Friday, 28 August 2015 at 12:28:43 UTC, Russel Winder wrote: On Thu, 2015-08-27 at 16:01 +, BBasile via

Re: Release D 2.069.0

On Tuesday, 8 December 2015 at 13:14:58 UTC, Márcio Martins wrote: On Tuesday, 8 December 2015 at 08:39:26 UTC, Jean-Yves Vion-Dury wrote: On Monday, 7 December 2015 at 17:32:05 UTC, Márcio Martins wrote: On Monday, 7 December 2015 at 17:06:48 UTC, Jean-Yves Vion-Dury wrote: On Wednesday, 4

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

On Tuesday, 8 December 2015 at 20:56:28 UTC, cym13 wrote: On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei Surely I'm missing something obvious but why

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

On 12/08/2015 09:56 PM, cym13 wrote: On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei Surely I'm missing something obvious but why is it true exactly?

[Issue 15425] New: std.traits.hasIndirections fails to recognize nested structs

https://issues.dlang.org/show_bug.cgi?id=15425 Issue ID: 15425 Summary: std.traits.hasIndirections fails to recognize nested structs Product: D Version: D2 Hardware: All OS: Linux Status: NEW

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

On Tuesday, 8 December 2015 at 20:56:28 UTC, cym13 wrote: On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei Surely I'm missing something obvious but why

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

On Tuesday, 8 December 2015 at 21:30:09 UTC, Charles wrote: On Tuesday, 8 December 2015 at 20:56:28 UTC, cym13 wrote: On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it.

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

On Tuesday, 8 December 2015 at 21:18:01 UTC, Timon Gehr wrote: On 12/08/2015 09:56 PM, cym13 wrote: On Tuesday, 8 December 2015 at 17:33:49 UTC, Andrei Alexandrescu wrote: On 12/08/2015 12:12 PM, Timon Gehr wrote: O(log(n+m)) = O(log(n)+log(m)). Noice. Yes I did miss it. Thx!! -- Andrei

  1   2   >