On Tuesday, 13 September 2016 at 23:45:18 UTC, Intersteller wrote:
vibe.d does not have much lateral support as the most commons
web technologies do. Can vibe.d leverage pre-existing techs
such as php, ruby/rails, etc? Starting from scratch and having
to build a robust and secure framework is
in zip: why isn't requireSameLength the default?
This is the most common case and would fit with the goal of being safe by
default.
vibe.d does not have much lateral support as the most commons web
technologies do. Can vibe.d leverage pre-existing techs such as
php, ruby/rails, etc? Starting from scratch and having to build a
robust and secure framework is really not the way to go.
On 9/13/16 5:01 PM, Yuxuan Shui wrote:
For example, a common use case might be I want to capture everything by
value. In stead of adding all the fields by hand and passing them to the
constructor, I want the compiler to do it for me.
i.e. I wish I could (borrowing C++ syntax):
struct A[=] {
On Tuesday, 13 September 2016 at 20:36:22 UTC, Steven
Schveighoffer wrote:
On 9/13/16 4:11 PM, Yuxuan Shui wrote:
On Tuesday, 13 September 2016 at 20:00:40 UTC, Steven
Schveighoffer wrote:
Not familiar with C++ lambda. You can always "specify" how to
capture
the data by directly declaring it:
On Tuesday, September 13, 2016 20:08:22 Patrick Schluter via Digitalmars-d-
learn wrote:
> On Tuesday, 13 September 2016 at 06:59:10 UTC, Jonathan M Davis
>
> wrote:
> > On Tuesday, September 13, 2016 03:33:04 Ivy Encarnacion via
> >
> > Digitalmars-d- learn wrote:
> > A pure function cannot call
On 9/13/16 4:11 PM, Yuxuan Shui wrote:
On Tuesday, 13 September 2016 at 20:00:40 UTC, Steven Schveighoffer wrote:
Not familiar with C++ lambda. You can always "specify" how to capture
the data by directly declaring it:
auto foo()
{
int x;
static struct S
{
int x;
}
r
On 9/13/16 4:08 PM, Patrick Schluter wrote:
On Tuesday, 13 September 2016 at 06:59:10 UTC, Jonathan M Davis wrote:
On Tuesday, September 13, 2016 03:33:04 Ivy Encarnacion via
Digitalmars-d- learn wrote:
A pure function cannot call any function that is not pure [...]
I've read that a lot but
On Tuesday, 13 September 2016 at 18:15:56 UTC, Nordlöw wrote:
I have lots of unsent drafts I would like to discard all at
once. Is this possible somehow?
Delete the cookies.
On Tuesday, 13 September 2016 at 20:00:40 UTC, Steven
Schveighoffer wrote:
On 9/13/16 3:42 PM, Yuxuan Shui wrote:
[...]
There's nothing in the language to prevent this optimization.
[...]
Again, could be clearer. But the fact that both the function
and the struct affect the same data kind
On Tuesday, 13 September 2016 at 06:59:10 UTC, Jonathan M Davis
wrote:
On Tuesday, September 13, 2016 03:33:04 Ivy Encarnacion via
Digitalmars-d- learn wrote:
A pure function cannot call any function that is not pure [...]
I've read that a lot but it's not true. A pure function can call
imp
On Tuesday, 13 September 2016 at 01:32:19 UTC, Steven
Schveighoffer wrote:
On 9/12/16 4:11 PM, Ali Çehreli wrote:
On 09/10/2016 10:44 PM, Yuxuan Shui wrote:
I recently noticed nested struct capture its context by
reference
(which, BTW, is not mentioned at all here:
https://dlang.org/spec/struc
On 9/13/16 3:42 PM, Yuxuan Shui wrote:
On Tuesday, 13 September 2016 at 01:32:19 UTC, Steven Schveighoffer wrote:
On 9/12/16 4:11 PM, Ali Çehreli wrote:
On 09/10/2016 10:44 PM, Yuxuan Shui wrote:
I recently noticed nested struct capture its context by reference
(which, BTW, is not mentioned at
On Tuesday, 13 September 2016 at 01:32:19 UTC, Steven
Schveighoffer wrote:
On 9/12/16 4:11 PM, Ali Çehreli wrote:
On 09/10/2016 10:44 PM, Yuxuan Shui wrote:
I recently noticed nested struct capture its context by
reference
(which, BTW, is not mentioned at all here:
https://dlang.org/spec/struc
I have lots of unsent drafts I would like to discard all at once.
Is this possible somehow?
On Tuesday, September 13, 2016 17:59:09 Adam D. Ruppe via Digitalmars-d-learn
wrote:
> On Tuesday, 13 September 2016 at 17:52:48 UTC, Jonathan M Davis
>
> wrote:
> > It's really intended for disabling features that would normally
> > be there. I don't know why it would ever make sense to @disable
On Tuesday, 13 September 2016 at 17:52:48 UTC, Jonathan M Davis
wrote:
It's really intended for disabling features that would normally
be there. I don't know why it would ever make sense to @disable
a normal function.
Consider the case of `alias this` or a mixin template. You might
make a wra
On Tuesday, September 13, 2016 17:29:26 Uranuz via Digitalmars-d-learn wrote:
> OK. Seems that there is nothing that I could do more about my
> example code.. So the best way to be sure if something is
> assignable property is to try assign to it and test whether it
> compiles. The question was bec
On Tuesday, 13 September 2016 at 15:32:57 UTC, Jonathan M Davis
wrote:
On Tuesday, September 13, 2016 08:28:10 Jonathan M Davis via
Digitalmars-d- learn wrote:
On Tuesday, September 13, 2016 04:58:38 Uranuz via
Digitalmars-d-learn
wrote:
> In my code I iterate in CT over class methods marked as
On Tuesday, September 13, 2016 15:27:07 Neurone via Digitalmars-d-learn wrote:
> On Sunday, 11 September 2016 at 16:14:59 UTC, Mike Parker wrote:
> > On Sunday, 11 September 2016 at 16:10:04 UTC, Mike Parker wrote:
> >> And here, no memory is allocated. barSlice.ptr is the same as
> >> bar.ptr and
On Tuesday, September 13, 2016 08:28:10 Jonathan M Davis via Digitalmars-d-
learn wrote:
> On Tuesday, September 13, 2016 04:58:38 Uranuz via Digitalmars-d-learn
wrote:
> > In my code I iterate in CT over class methods marked as @property
> > and I have a probleme that one of methods is @disable.
On Sunday, 11 September 2016 at 16:14:59 UTC, Mike Parker wrote:
On Sunday, 11 September 2016 at 16:10:04 UTC, Mike Parker wrote:
And here, no memory is allocated. barSlice.ptr is the same as
bar.ptr and barSlice.length is the same as bar.length.
However, if you append a new element:
barSlic
On Tuesday, September 13, 2016 04:58:38 Uranuz via Digitalmars-d-learn wrote:
> In my code I iterate in CT over class methods marked as @property
> and I have a probleme that one of methods is @disable. So I just
> want to skip @disable members. I found possible solution, but
> it's interesting to
On Tuesday, 13 September 2016 at 10:02:28 UTC, Andrea Fontana
wrote:
Check this:
http://ddili.org/ders/d.en/fibers.html
Further, are we forced to use the GC for Fiber allocation or can
a sub-class of Fiber implement its own allocation strategy?
On Tuesday, 13 September 2016 at 10:02:28 UTC, Andrea Fontana
wrote:
Check this:
http://ddili.org/ders/d.en/fibers.html
Thanks!
I would like to make use of message passing between Fibers
aswell. Any code example for this? Specifically: Should the call
to `new Fiber()` take all the TId's of i
On Tuesday, 13 September 2016 at 10:02:28 UTC, Andrea Fontana
wrote:
On Tuesday, 13 September 2016 at 09:46:46 UTC, Nordlöw wrote:
I would like to experiment with Fibers/Coroutines in D/vibe.d.
I'm missing a code example in std.concurrency that highlights
an example of using Fibers for massive
On Tuesday, 13 September 2016 at 09:46:46 UTC, Nordlöw wrote:
I would like to experiment with Fibers/Coroutines in D/vibe.d.
I'm missing a code example in std.concurrency that highlights
an example of using Fibers for massive concurrency. Could
anybody show me such a code example or link to a
On Tuesday, 13 September 2016 at 09:46:46 UTC, Nordlöw wrote:
I would like to experiment with Fibers/Coroutines in D/vibe.d.
I'm missing a code example in std.concurrency that highlights
an example of using Fibers for massive concurrency. Could
anybody show me such a code example or link to a
I would like to experiment with Fibers/Coroutines in D/vibe.d.
I'm missing a code example in std.concurrency that highlights an
example of using Fibers for massive concurrency. Could anybody
show me such a code example or link to a more descriptive
tutorial?
On Tuesday, 13 September 2016 at 08:19:04 UTC, Johan Engelen
wrote:
In the binary heap documentation, I read that
`BinaryHeap.front()` "Returns a copy of the front of the heap".
[1]
Is there no function to access the front of the heap without a
copy? (micro-optimization)
Thanks,
Johan
[1]
In the binary heap documentation, I read that
`BinaryHeap.front()` "Returns a copy of the front of the heap".
[1]
Is there no function to access the front of the heap without a
copy? (micro-optimization)
Thanks,
Johan
[1]
https://dlang.org/phobos/std_container_binaryheap.html#.BinaryHeap.
On Tuesday, September 13, 2016 03:33:04 Ivy Encarnacion via Digitalmars-d-
learn wrote:
> Can pure functions throw exceptions on its arguments? Also, how
> can it perform impure operations?
Yes, as long as the exception's constructor is pure, a pure function can
throw an exception. However, whethe
32 matches
Mail list logo
