On Friday, 8 August 2014 at 22:00:03 UTC, Kiith-Sa wrote:
Should be fixed now with 0.4.6:
http://code.dlang.org/packages/dyaml/0.4.6
Awesome! ta.
On 8/7/2014 11:34 AM, Manu via Digitalmars-d-announce wrote:
It's not because it's hard, it's because it's perceived as totally
backwards, and it undermines the trust in the ecosystem. It's all about
perception.
The Windows/Visual Studio development culture is pretty immature, and
expects
On Saturday, 9 August 2014 at 14:24:41 UTC, Nick Sabalausky wrote:
While I (unfortunately) agree with everything you've said here,
I can't help chiming in with one thing: Speaking as a
programmer who's primarily used Windows ever since 3.1, anyone
who earns a paycheck writing code *and*
On Thursday, 31 July 2014 at 12:51:53 UTC, Andrew Edwards wrote:
DMD v2.066.0-rc1 binaries are available for testing:
http://wiki.dlang.org/Beta_Testing
What about changelog?
http://dlang.org/changelog.html
In past it was pretty nicely made, but now it lists only 2
changes (unlike
On Tuesday, 5 August 2014 at 17:02:28 UTC, Dicebot wrote:
On Tuesday, 5 August 2014 at 16:54:47 UTC, Stefan Koch wrote:
I'm not sure what you mean. Are you referring to things
like pragma msg?
to things like mixin(mixin(`writeln (Hello World);`);
```
bool foo() { ... }
template bar(bool
On Saturday, 9 August 2014 at 15:35:08 UTC, Maxim Fomin wrote:
On Thursday, 31 July 2014 at 12:51:53 UTC, Andrew Edwards wrote:
DMD v2.066.0-rc1 binaries are available for testing:
http://wiki.dlang.org/Beta_Testing
What about changelog?
http://dlang.org/changelog.html
In past it was
Greetings to all Mago Debugger, Visual D, and interested D users.
After 5 years, I can no longer continue development of Mago
Debugger. The project requires too much attention for me to keep
working on it while keeping my family happy.
I learned a ton, and feel satisfied to have contributed
On 8/9/2014 8:33 PM, Aldo Nunez wrote:
Greetings to all Mago Debugger, Visual D, and interested D users.
After 5 years, I can no longer continue development of Mago Debugger. The
project requires too much attention for me to keep working on it while keeping
my family happy.
I learned a ton,
On Saturday, 9 August 2014 at 05:38:33 UTC, H. S. Teoh via
Digitalmars-d wrote:
On Sat, Aug 09, 2014 at 05:08:09AM +, Mike via
Digitalmars-d wrote:
The idea is to have the same module declaration in multiple
files, but
guarded by `version`.
// port_linux.d
version (linux):
module port;
On Saturday, 9 August 2014 at 02:53:34 UTC, Era Scarecrow wrote:
But naturally before i can do anything i need to
re-familiarize myself with Git and GitHub... and immediately
remember why i pretty much rage-quit 18 months ago...
Is there anyone who i can refer to via IM/PM or some quick
On Saturday, 9 August 2014 at 07:12:45 UTC, eles wrote:
On Saturday, 9 August 2014 at 02:53:34 UTC, Era Scarecrow wrote:
so I can change the version of the code that I work on without
having to change my folder, paths, put in plae symbolic links
for my IDE and stuff? It takes just a 'git
On Saturday, 9 August 2014 at 07:12:45 UTC, eles wrote:
I am not a heavy github user and I use git basically only for
myself and collaboration outside my workplace (there, we use
the professional ClearCase...), but for git, I could
recommend you these resources:
I'm watching a few tutorials
On Saturday, 9 August 2014 at 07:21:28 UTC, Era Scarecrow wrote:
On Saturday, 9 August 2014 at 07:12:45 UTC, eles wrote:
Things will be easier when it clicks for me i'm sure.
Re-reading part of the book, a portion of it, the designs
behind Git makes sense, but there's no 'ah ha!' moment,
On Saturday, 9 August 2014 at 07:48:28 UTC, eles wrote:
On Saturday, 9 August 2014 at 07:21:28 UTC, Era Scarecrow wrote:
On Saturday, 9 August 2014 at 07:12:45 UTC, eles wrote:
will give you a nice view of the differences...
Oh, yes, and your subprojects master, test_idea01 and
Hi all,
This is barely relevant to D, but I thought I'd try posting it
here because I thought the audience might be interested. Let me
know if I should post it somewhere else.
Long story short, I wrote my own C++ heap memory manager a while
ago from scratch. First, here's a description:
On Saturday, 9 August 2014 at 08:48:37 UTC, Mehrdad wrote:
(snip)
One other feature I forgot to mention:
It allows you to deallocate sub-blocks of any sizes that you wish
-- this can be completely independent of the sizes they were
originally allocated in, and I'm fairly certain I designed
On Saturday, 9 August 2014 at 06:00:05 UTC, Mike wrote:
On Saturday, 9 August 2014 at 05:38:33 UTC, H. S. Teoh via
What about this:
// port.d
module port;
version(linux)
public import port_linux;
version(Windows)
public import
On Saturday, 9 August 2014 at 09:15:10 UTC, Era Scarecrow wrote:
and run as a LiceCD on a VM that contains all the tools and
LiveCD LIVE!!! Wish i had an edit button for quick edits...
On Saturday, 9 August 2014 at 07:48:28 UTC, eles wrote:
That's because many git tutorial start with praising its
distributed repository model and bragging about why that
feature is cool (which is very true, but it is confusing for
beginners). Ignore that part for the time being, it will click
On Friday, 8 August 2014 at 22:43:38 UTC, Andrei Alexandrescu
wrote:
On 8/7/14, 12:40 PM, Era Scarecrow wrote:
As for being able to find x number of bits that are 0 or 1 in
a row, that both sounds easy and hard at the same time (easy
if you don't mind it being slow). In my rewrite there was a
On Saturday, 9 August 2014 at 09:34:38 UTC, Mehrdad wrote:
On Friday, 8 August 2014 at 22:43:38 UTC, Andrei Alexandrescu
wrote:
Alignment is often not an issue - you handle the
setup/teardown misalignments separately and to the bulk 64
bits at a time.
What kind of performance are you looking
On Saturday, 9 August 2014 at 09:34:38 UTC, Mehrdad wrote:
(snip)
Sorry, just to clarify, that was just one example of what I had,
not the only one. I also have another (monstrous) function
long long GetRunLength(
void const *bitmap, unsigned long long bitmap_bits,
long long
On Saturday, 9 August 2014 at 09:44:17 UTC, Era Scarecrow wrote:
On Saturday, 9 August 2014 at 09:34:38 UTC, Mehrdad wrote:
On Friday, 8 August 2014 at 22:43:38 UTC, Andrei Alexandrescu
wrote:
Alignment is often not an issue - you handle the
setup/teardown misalignments separately and to the
On Saturday, 9 August 2014 at 09:54:09 UTC, Mehrdad wrote:
Oh in that case, I'll just send you the code I have right now.
I'd double-check it to see if it works though -- it may have
bugs, especially in the SIMD.
I probably won't be touching this for a while... makes me wonder
if the 30 day
On Saturday, 9 August 2014 at 10:02:24 UTC, Era Scarecrow wrote:
On Saturday, 9 August 2014 at 09:54:09 UTC, Mehrdad wrote:
Oh in that case, I'll just send you the code I have right now.
I'd double-check it to see if it works though -- it may have
bugs, especially in the SIMD.
I probably
On Saturday, 9 August 2014 at 00:17:07 UTC, Jonathan M Davis
wrote:
On Friday, 8 August 2014 at 12:22:49 UTC, Idan Arye wrote:
On Friday, 8 August 2014 at 08:37:37 UTC, Messenger wrote:
On Friday, 8 August 2014 at 00:27:21 UTC, Jonathan M Davis
wrote:
On Thursday, 7 August 2014 at 20:59:45
On Saturday, 9 August 2014 at 11:51:06 UTC, Idan Arye wrote:
If that was the case, the error would have said it's illegal to
throw from finally or scope bodies. The fact that it
specifically specifies `scope(exit)` and `scope(success)` and
leave out `scope(failure)` means that whoever wrote
On Saturday, 9 August 2014 at 08:48:37 UTC, Mehrdad wrote:
Hi all,
This is barely relevant to D, but I thought I'd try posting it
here because I thought the audience might be interested. Let me
know if I should post it somewhere else.
Long story short, I wrote my own C++ heap memory manager
On 8/9/14, 2:16 AM, Era Scarecrow wrote:
On Saturday, 9 August 2014 at 09:15:10 UTC, Era Scarecrow wrote:
and run as a LiceCD on a VM that contains all the tools and
LiveCD LIVE!!! Wish i had an edit button for quick edits...
Yeah, NNTP is lousy for editing.
On Saturday, 9 August 2014 at 13:29:47 UTC, Anonymouse wrote:
There is no realloc, move, cpy ?
Not sure what you mean by move or copy (can't you just use
regular memmove/memcpy?) but no, there is no realloc -- C++
doesn't use realloc and this was meant to be used in C++.
On Saturday, 9 August 2014 at 11:51:06 UTC, Idan Arye wrote:
On Saturday, 9 August 2014 at 00:17:07 UTC, Jonathan M Davis
wrote:
I suspect that it says that because someone complained about
the error talking about finally when they had used scope(exit)
and not finally. The fact that scope
Currently I am building dmd on win64. For some reason some phobos
code references getErrno() function in errno_c.obj and that
object file is not included into final binary (linker issues
symbol absence error - by the way I don't remember it was needed
on linux). It can be avoided by adding
Here's a lovely Saturday morning exercise for you D aficionados out
there:
struct S(alias fun)
{
auto g() { return fun(0); }
}
auto f(int arr)
{
return S!(a = arr)();
}
auto r = f(2);
void main() {
On Monday, 4 August 2014 at 04:09:07 UTC, Manu via Digitalmars-d
wrote:
Almost all exceptions I throw are in relation to bad input
data, and they are to be caught at a slightly higher level
of input processing.
I do not know the design that you are using, but it seems to me
that instead of
On 08/09/2014 07:11 PM, H. S. Teoh via Digitalmars-d wrote:
This causes a segfault at runtime. Moving the declaration of r inside
main() fixes the problem. Why?
My guess is it is just a missing diagnostic for the missing support for
closures in CTFE.
You are effectively trying to do
On Saturday, 9 August 2014 at 17:06:00 UTC, Maxim Fomin wrote:
Currently I am building dmd on win64. For some reason some
phobos code references getErrno() function in errno_c.obj and
that object file is not included into final binary (linker
issues symbol absence error - by the way I don't
On Thursday, 7 August 2014 at 23:13:15 UTC, David Bregman wrote:
and use unreachable() if you know 100% it holds.
This is just another name for the same thing, it isn't any more
or less dangerous.
Of course it is. unreachable() could lead to this:
f(){ @unreachable}
g(){...}
f:
g:
See email: 'with(Foo):' not allowed, why? in '
digitalmars-d-le...@puremagic.com' forum
There's already an implementation proposed.
On 08/09/2014 09:26 PM, Ola Fosheim =?UTF-8?B?R3LDuHN0YWQi?=
ola.fosheim.grostad+dl...@gmail.com wrote:
On Thursday, 7 August 2014 at 23:13:15 UTC, David Bregman wrote:
and use unreachable() if you know 100% it holds.
This is just another name for the same thing, it isn't any more or
less
On Sat, Aug 09, 2014 at 07:39:51PM +0200, Timon Gehr via Digitalmars-d wrote:
On 08/09/2014 07:11 PM, H. S. Teoh via Digitalmars-d wrote:
This causes a segfault at runtime. Moving the declaration of r inside
main() fixes the problem. Why?
My guess is it is just a missing diagnostic for the
On 8/7/2014 10:44 AM, Daniel Murphy wrote:
I meant asserts in pre-conditions when used with inheritance. It's a pass if
any of the preconditions pass, so the compiler runs them in turn and catches all
but the last.
That's right, they are OR'd together.
On 8/7/2014 2:29 AM, Daniel Murphy wrote:
And we've also got asserts in pre-conditions, which are recoverable by
definition.
Pre-condition asserts are not recoverable.
On Sat, Aug 09, 2014 at 05:54:21PM -0700, Walter Bright via Digitalmars-d wrote:
On 8/7/2014 10:44 AM, Daniel Murphy wrote:
I meant asserts in pre-conditions when used with inheritance. It's a
pass if any of the preconditions pass, so the compiler runs them in
turn and catches all but the
On Saturday, 9 August 2014 at 20:22:36 UTC, Timon Gehr wrote:
Formally, that's what it assumes to be the case. If you can
prove 'false', this means that the code is unreachable.
No, if you prove false that means either that it is
nonterminating or that it cannot be proved by the the
On 8/9/2014 5:52 PM, Walter Bright wrote:
On 8/7/2014 2:29 AM, Daniel Murphy wrote:
And we've also got asserts in pre-conditions, which are recoverable by
definition.
Pre-condition asserts are not recoverable.
Eh, ignore that.
When I try to compile these two functions, the second function is
flagged with an already defined error:
bool testRoundTrip(T, U)(T first, U second) if (isIntegral!T
isFloatingPoint!U)
{
return false;
}
bool testRoundTrip(U, T)(U first, T second) if (isIntegral!T
isFloatingPoint!U)
{
On 9/08/2014 6:19 p.m., Paul D Anderson wrote:
When I try to compile these two functions, the second function is
flagged with an already defined error:
bool testRoundTrip(T, U)(T first, U second) if (isIntegral!T
isFloatingPoint!U)
{
return false;
}
bool testRoundTrip(U, T)(U first, T
On Friday, 8 August 2014 at 18:20:41 UTC, ketmar wrote:
yeah, chars (and bytes, and so on) are not aligned. i.e.
align(1) struct B {
int qtim;
int bid;
int ofr;
int bidsiz;
int ofrsiz;
short mode;
char ex;
byte mmid;
char z;
}
has sizeof == 25. not sure if specs mentions
On Friday, 8 August 2014 at 18:51:49 UTC, ketmar wrote:
Why are void pointers better than ulong, if I may ask
there is at least one reason: GC. yes, it is conservative, but
there's no reason to scan ulong[] for any pointers, so you may
lost your objects if there is no other references to 'em.
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we have
to
use with(Foo){...} ?
It would be more in line with how other scope
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we
have to
use
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a reason why 'with(Foo):' is not allowed, and we
have to
use
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
The source is here:
On Saturday, 9 August 2014 at 09:33:12 UTC, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative arrays? Where in the D source does the AA code live?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/aaA.d
I think it uses the
On 08/09/14 03:20, Vlad Levenfeld via Digitalmars-d-learn wrote:
More opDispatch woes. This feature keeps biting me, yet I keep trying to use
it.
This time I'm trying to access elements of a vector GLSL-style (without
swizzling... for now).
Here's the relevant code:
struct Vector
On 08/09/2014 01:43 PM, Gary Willoughby wrote:
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
Paul Hsieh's SuperFastHash:
http://www.azillionmonkeys.com/qed/hash.html
Where is this implemented?
https://github.com/D-Programming-Language/druntime/blob/master/src/rt/util/hash.d
On Saturday, 9 August 2014 at 10:28:02 UTC, Mike Wey wrote:
On 08/09/2014 11:33 AM, Gary Willoughby wrote:
What hashing algorithm is used for the D implementation of
associative
arrays? Where in the D source does the AA code live?
Paul Hsieh's SuperFastHash:
https://bitbucket.org/nriddick/phaser
So I made this thing for cross-thread data sharing/passing. It
has the functionality I wanted out of it. Here's the gist of how
I use it:
auto phaser = new Phaser!(type,power2_number);
foreach(i;0..threads) {
spawn(pull_function,
On Sat, 09 Aug 2014 09:08:14 +
via Digitalmars-d-learn digitalmars-d-learn@puremagic.com wrote:
really must use an integral type instead of a pointer, use
`size_t`, which is defined to have the same size as a pointer.
ptr_t or uptr_t ;-) that is the reason why the std.string.indexOf()
On Saturday, 9 August 2014 at 10:36:55 UTC, Artur Skawina via
Digitalmars-d-learn wrote:
On 08/09/14 03:20, Vlad Levenfeld via Digitalmars-d-learn wrote:
More opDispatch woes. This feature keeps biting me, yet I keep
trying to use it.
This time I'm trying to access elements of a vector
On Sat, 09 Aug 2014 00:34:42 +
Puming via Digitalmars-d-learn digitalmars-d-learn@puremagic.com
wrote:
yes, there is. all of ours apps are done with D and GtkD now. alas,
it's in-house, but alot of people using them. ;-)
signature.asc
Description: PGP signature
On Saturday, 9 August 2014 at 05:42:09 UTC, H. S. Teoh via
Digitalmars-d-learn wrote:
Why would having opDispatch actually generate compile errors
cause
problems for __traits(compiles,...)? __traits(compiles...)
already works
fine with a whole bunch of other non-compiling stuff (by
gagging
On Saturday, 9 August 2014 at 07:07:42 UTC, Rikki Cattermole
wrote:
Cannot reproduce on either 2.065 or git head (according to
dpaste).
You are right. I had the functions in a unittest block that got
executed more than once so the second execution was a
redefinition. Thanks for taking
I may be misunderstanding the intended semantics of the []
operator but I've come to interpret x[] to mean give me x as a
range and this is the meaning I intend when I overload it in my
own structs.
But -
auto z = tuple (1,1,1);
pragma (msg, typeof(z)); // Tuple!(int, int, int)
pragma (msg,
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate applications
like browser!
Heh, Rust was initially created exactly to create a browser.
Servo project is its main driver and
Found this:
https://github.com/alvatar/snippets/blob/086f1714927df1338ac36b3633a3a91034a8347c/d/scrapple/bevutils/ServiceBase.d
Will be exploring it to see if I can make it work.
On Saturday, 9 August 2014 at 05:08:40 UTC, Tyler Jensen wrote:
I am very interested to find a good example for D2
On Saturday, 9 August 2014 at 17:14:39 UTC, thedeemon wrote:
We've got some.
Photo processing app:
http://www.infognition.com/blogsort/
Disk space visualizer and redundancy searcher:
http://www.infognition.com/undup/
A tool for watching some folders and processing video files
there:
On Saturday, 9 August 2014 at 16:39:34 UTC, Vlad Levenfeld wrote:
I may be misunderstanding the intended semantics of the []
operator but I've come to interpret x[] to mean give me x as a
range and this is the meaning I intend when I overload it in
my own structs.
But -
auto z = tuple
On Saturday, 9 August 2014 at 19:26:46 UTC, Meta wrote:
(which is why z[] gives you a type of (int, int, int) instead
of Tuple!(int, int, int)).
That makes sense, and on second thought it wouldn't make sense to
use a tuple as a range because it's not guaranteed to have only
one element type.
Hello D-community
Sorry to dig an old post, but I have the exact same need.
I have C++ background and I started to use D a few days ago only
(a pity I didn't start sooner!)
My needs are mostly around numerical calculations. I have a safe
and efficient matrix type in C++ that I am porting to D.
On Sat, Aug 09, 2014 at 08:43:32PM +, Remi Thebault via Digitalmars-d-learn
wrote:
Hello D-community
Sorry to dig an old post, but I have the exact same need.
I have C++ background and I started to use D a few days ago only
(a pity I didn't start sooner!)
My needs are mostly around
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate applications
like browser!
Rust was designed to build Servo. The people building Servo are
the people building Rust. With all
On Saturday, 9 August 2014 at 09:52:02 UTC, Messenger wrote:
On Saturday, 9 August 2014 at 09:11:53 UTC, Marc Schütz wrote:
On Saturday, 9 August 2014 at 03:46:05 UTC, timotheecour wrote:
On Wednesday, 6 August 2014 at 17:03:23 UTC, Timothee Cour via
Digitalmars-d-learn wrote:
Is there a
On Saturday, 9 August 2014 at 20:32:05 UTC, Vlad Levenfeld wrote:
Are there any specific cases where they're not?
Not that I know of, and it doesn't really make sense for them not
to be, but it could happen. If you want to be certain that
slicing a type will produce a valid range, you can do
On Saturday, 9 August 2014 at 21:46:45 UTC, Peter Alexander wrote:
On Saturday, 9 August 2014 at 00:34:43 UTC, Puming wrote:
Yes, rust is a more infantile language compared to D, but
people are already using them to create complicate
applications like browser!
Rust was designed to build
On Saturday, 9 August 2014 at 15:19:35 UTC, ketmar via
Digitalmars-d-learn wrote:
On Sat, 09 Aug 2014 00:34:42 +
Puming via Digitalmars-d-learn
digitalmars-d-learn@puremagic.com
wrote:
yes, there is. all of ours apps are done with D and GtkD now.
alas,
it's in-house, but alot of people
Interesting :-)
Unfortunately they are all windows only apps, I don't have a
windows machine.
Can I link them on my bookmarks about D projects?
https://github.com/zhaopuming/awesome-d
On Saturday, 9 August 2014 at 17:14:39 UTC, thedeemon wrote:
On Saturday, 9 August 2014 at 00:34:43 UTC,
Is the d compiler on the path?
Also, check the compiler settings for the d compiler and make sure that
the d compiler is the default compiler.
On 08/08/2014 11:15 AM, Borneq wrote:
I want use dmd compiler with COde:Blocks. IDE detect compiler but is
error can't find compiler executable. I
On Sunday, 10 August 2014 at 04:41:45 UTC, Puming wrote:
Photo processing app:
Disk space visualizer and redundancy searcher:
A tool for watching some folders and processing video files
there...
Interesting :-)
Unfortunately they are all windows only apps, I don't have a
windows machine.
https://issues.dlang.org/show_bug.cgi?id=8269
yebblies yebbl...@gmail.com changed:
What|Removed |Added
Keywords||pull
https://issues.dlang.org/show_bug.cgi?id=8269
Damian damian...@hotmail.co.uk changed:
What|Removed |Added
CC||damian...@hotmail.co.uk
---
https://issues.dlang.org/show_bug.cgi?id=13257
Dicebot pub...@dicebot.lv changed:
What|Removed |Added
CC||pub...@dicebot.lv
--- Comment
https://issues.dlang.org/show_bug.cgi?id=13257
--- Comment #12 from Dicebot pub...@dicebot.lv ---
Another option is to special case splitter in map and make this deprecation
cycle as short as possible
--
https://issues.dlang.org/show_bug.cgi?id=8269
--- Comment #14 from yebblies yebbl...@gmail.com ---
(In reply to Damian from comment #13)
Why would the with statement be creating a temporary in the first place? It
seems terribly inefficient, surely it can just alias the original object and
be
https://issues.dlang.org/show_bug.cgi?id=3780
Robert Schadek rburn...@gmail.com changed:
What|Removed |Added
Status|NEW |RESOLVED
https://issues.dlang.org/show_bug.cgi?id=9785
Dicebot pub...@dicebot.lv changed:
What|Removed |Added
CC||pub...@dicebot.lv
--- Comment #2
https://issues.dlang.org/show_bug.cgi?id=2954
hst...@quickfur.ath.cx changed:
What|Removed |Added
CC||hst...@quickfur.ath.cx
--
https://issues.dlang.org/show_bug.cgi?id=2954
--- Comment #11 from hst...@quickfur.ath.cx ---
Which of the following cases should/shouldn't be valid?
Case 1:
int[string] aa;
char[] key;
aa[key] = 1;
Case 2:
int[string] aa;
char[] key;
if (aa[key] == 1) { ... }
auto p = key in aa;
It seems
https://issues.dlang.org/show_bug.cgi?id=13272
Issue ID: 13272
Summary: [ddoc] Should merge docs for eponymous template with
single public member
Product: D
Version: D2
Hardware: x86_64
OS: Linux
https://issues.dlang.org/show_bug.cgi?id=13272
hst...@quickfur.ath.cx changed:
What|Removed |Added
Keywords||ddoc
--
https://issues.dlang.org/show_bug.cgi?id=4278
hst...@quickfur.ath.cx changed:
What|Removed |Added
CC||hst...@quickfur.ath.cx
--- Comment
https://issues.dlang.org/show_bug.cgi?id=4660
hst...@quickfur.ath.cx changed:
What|Removed |Added
CC||hst...@quickfur.ath.cx
--- Comment
https://issues.dlang.org/show_bug.cgi?id=6022
hst...@quickfur.ath.cx changed:
What|Removed |Added
CC||hst...@quickfur.ath.cx
--
https://issues.dlang.org/show_bug.cgi?id=6022
--- Comment #1 from hst...@quickfur.ath.cx ---
Still present in git HEAD.
--
https://issues.dlang.org/show_bug.cgi?id=6022
hst...@quickfur.ath.cx changed:
What|Removed |Added
OS|Windows |All
--
https://issues.dlang.org/show_bug.cgi?id=8483
hst...@quickfur.ath.cx changed:
What|Removed |Added
CC||hst...@quickfur.ath.cx
--
https://issues.dlang.org/show_bug.cgi?id=8483
--- Comment #2 from hst...@quickfur.ath.cx ---
In light of recent realizations that output ranges are really only useful with
specific operations at the end of UFCS chains, such as std.algorithm.copy or
std.format.formattedWrite (and arguably, the
https://issues.dlang.org/show_bug.cgi?id=11102
--- Comment #2 from hst...@quickfur.ath.cx ---
Unable to reproduce on git HEAD. Here's my test code:
--
/**
* This is some random code: $(D foreach (i; 1..a) { f(); }
* But I forgot to close the macro.
*/
void func() {
}
--
Compiler
https://issues.dlang.org/show_bug.cgi?id=13271
Vlad Levenfeld vlevenf...@gmail.com changed:
What|Removed |Added
Status|NEW |RESOLVED
1 - 100 of 123 matches
Mail list logo
