On Monday, 8 April 2019 at 14:49:02 UTC, Radu wrote:
Hi there,
Compiling with 2.085.1 on Windows 10 works with `dub
--arch=x86_mscoff`
LDC 1.15.0 works for x86/x86_64. Tested also on a fresh VMWare
instance running Windows 7.
You can try running it with `dub --arch=x86_mscoff --verbose`
in
I used dmd 2.085.0 and 2.085.1 on Win 10
I followed sample at
https://vibed.org/blog/posts/a-scalable-chat-room-service-in-d
Just the beginning, where you you should compile hello word web
app.
command line: "dub"
compilation finishes ok. then it prints "Linking..." and I get
window
I'm thinking about ranges I can think of similar design of the
input range, but with different pros and cons. Obviously not
for/in D. Currently ranges has 3 primitive operations, and they
can be translated from foreach like:
for (auto __r = range; !__r.empty; __r.popFront())
{
auto e =
On Monday, 24 August 2015 at 15:16:12 UTC, Adam D. Ruppe wrote:
One advantage of the current design is you can statically
determine if something is an infinite range by seeing if empty
is a constant false.
That is important aspect! By having this information at compile
or runtime, you can
On Monday, 24 August 2015 at 15:23:09 UTC, H. S. Teoh wrote:
It's also useful in parsing algorithms to look at the current
item in the input without also consuming it.
I design I outlined the 'front' property could still be called
multiple times. It is the 'empty' property that would be
Looking at the random access range, if the indexing must be done
just by numeric value, or also by other type, like string
(typically used for dictionaries) or also custom object?
On Monday, 24 August 2015 at 17:17:16 UTC, Steven Schveighoffer
wrote:
3) it is not possible to ask a range if it's empty more
times per
iteration of one item
This isn't very composable. If I call a function that consumes
some number of items from a range, that function needs to
forward the
