On Friday, 11 November 2016 at 16:39:26 UTC, Heisenberg wrote:
What would it take to implement the Uniform Function Call
Syntax for a function's argument which is not the first?
Right now it is possible to do the following:
int someNumber(int a, int b)
{
return a + b;
}
void main()
{
On Saturday, November 12, 2016 03:30:58 Jerry via Digitalmars-d wrote:
> On Saturday, 12 November 2016 at 01:02:05 UTC, Jonathan M Davis
>
> wrote:
> > On Friday, November 11, 2016 23:32:11 Jerry via Digitalmars-d
> >
> > wrote:
> >> D doesn't have bitfields though? Phobos just has a template
> >>
On Saturday, 12 November 2016 at 01:02:05 UTC, Jonathan M Davis
wrote:
On Friday, November 11, 2016 23:32:11 Jerry via Digitalmars-d
wrote:
D doesn't have bitfields though? Phobos just has a template
that emulates them by mixing in functions that do the bit
shifting. Because it done through
https://issues.dlang.org/show_bug.cgi?id=16678
--- Comment #4 from github-bugzi...@puremagic.com ---
Commit pushed to stable at https://github.com/dlang/dmd
https://github.com/dlang/dmd/commit/8c00c7ea978dad3236148ea6fa57a1a9f8af3186
Merge pull request #6251 from Dicebot/revert-regressions
Fix
https://issues.dlang.org/show_bug.cgi?id=16193
--- Comment #13 from github-bugzi...@puremagic.com ---
Commit pushed to stable at https://github.com/dlang/dmd
https://github.com/dlang/dmd/commit/aac715ff2597d256b5ffe8ecb397316abf32fb2e
Revert "fix Issue 16193 - opApply() doesn't heap allocate
On Friday, November 11, 2016 23:32:11 Jerry via Digitalmars-d wrote:
> D doesn't have bitfields though? Phobos just has a template that
> emulates them by mixing in functions that do the bit shifting.
> Because it done through mixins it means you can't attach
> attributes to the fields. Which I am
On Friday, November 11, 2016 22:26:20 Ivan Kazmenko via Digitalmars-d-learn
wrote:
> On Friday, 11 November 2016 at 22:04:37 UTC, Jonathan M Davis
>
> wrote:
> > ...
> >
> > I expect that it never occurred to Walter to specify that the
> > order of the members mattered with tupleof and that
On Friday, November 11, 2016 14:36:59 Nick Sabalausky via Digitalmars-d-
announce wrote:
> On 11/11/2016 08:30 AM, Dicebot wrote:
> > On Friday, 11 November 2016 at 13:21:40 UTC, Nick Sabalausky wrote:
> >> Run the new dmd. If it fails, either fix your code or go temporarily
> >> go back to the
On Friday, 11 November 2016 at 15:36:18 UTC, Taylor Hillegeist
wrote:
In the past I have worked with D, C#, Java, Python and C and
some other less popular languages. Most recently working with
C# I suddenly realize the convenience and flexibility I had in
D. One case in particular is with
On Friday, November 11, 2016 22:48:24 Heisenberg via Digitalmars-d wrote:
> Isn't the whole point of UFCS implementation in providing better
> re-usability and scalability, helping the encapsulation, making
> the chaining of function calls easier?
The primary benefit of UFCS is so that generic
On Thursday, 10 November 2016 at 20:51:01 UTC, Stefan Koch wrote:
On Thursday, 10 November 2016 at 20:15:49 UTC, Jonathan M Davis
wrote:
On Thursday, November 10, 2016 18:40:03 Stefan Koch via
Digitalmars-d wrote:
On Thursday, 10 November 2016 at 01:17:48 UTC, Stefan Koch
wrote:
> After the
On Thursday, 10 November 2016 at 06:52:12 UTC, Olivier Pisano
wrote:
I cannot read your website on Firefox 45 (no text is
displayed). It works on chromium anyway.
FWIW it should work now
On Friday, 11 November 2016 at 21:51:29 UTC, John Colvin wrote:
On Friday, 11 November 2016 at 18:33:09 UTC, Heisenberg wrote:
On Friday, 11 November 2016 at 17:07:50 UTC, John Colvin wrote:
I'm sure there are loads of corner cases this doesn't cover,
but:
template inPos(uint n, alias f)
{
On Friday, 11 November 2016 at 22:04:37 UTC, Jonathan M Davis
wrote:
...
I expect that it never occurred to Walter to specify that the
order of the members mattered with tupleof and that that's why
the spec doesn't say.
So, use tupleof, and you can create an enhancement request in
bugzilla
On 11/11/16 3:02 PM, jmh530 wrote:
On Friday, 11 November 2016 at 19:36:59 UTC, Nick Sabalausky wrote:
I've gone through a lot of compiler upgrades on a lot of D projects,
and in my experience, this "investigate and fix for the new dmd" has
always been trivial (aside from one instance where
On Friday, November 11, 2016 21:26:10 Ivan Kazmenko via Digitalmars-d-learn
wrote:
> On Thursday, 10 November 2016 at 10:16:44 UTC, Ivan Kazmenko
>
> wrote:
> > I want to somehow list members of a class in the order of their
> > declaration.
>
> Bump. Anyone? I've met my immediate goal by other
On 11/11/2016 01:34 PM, John C via Digitalmars-d-learn wrote:
On Friday, 11 November 2016 at 20:55:52 UTC, Charles Hixson wrote:
Thank you. Unfortunately:
importstd.math;
...
assert(isNan (c.curActivation), "cell has unexpected
curActivation:
On Friday, 11 November 2016 at 18:33:09 UTC, Heisenberg wrote:
On Friday, 11 November 2016 at 17:07:50 UTC, John Colvin wrote:
I'm sure there are loads of corner cases this doesn't cover,
but:
template inPos(uint n, alias f)
{
auto inPos(Args...)(auto ref Args args)
{
return
On Friday, 11 November 2016 at 20:55:52 UTC, Charles Hixson wrote:
Thank you. Unfortunately:
importstd.math;
...
assert(isNan (c.curActivation), "cell has unexpected
curActivation: %s".format(c.curActivation));
yields:
cell.d(292): Error: undefined identifier 'isNan', did
On Thursday, 10 November 2016 at 10:16:44 UTC, Ivan Kazmenko
wrote:
I want to somehow list members of a class in the order of their
declaration.
Bump. Anyone? I've met my immediate goal by other means, but
the general question remains.
If classes are no-go, basically, any aggregate will
On 11/11/2016 10:31 AM, pineapple via Digitalmars-d-learn wrote:
On Thursday, 10 November 2016 at 16:47:30 UTC, Adam D. Ruppe wrote:
On Thursday, 10 November 2016 at 16:41:56 UTC, Charles Hixson wrote:
It's *supposed* to be nan, and the assert message reports that it
is, but it should pass
https://issues.dlang.org/show_bug.cgi?id=10638
Kevin changed:
What|Removed |Added
Status|NEW |RESOLVED
CC|
Warm-up for mind. Visual Basic 6 is used as framework for DLL on
D. Calls of functions from VB to D and from D to VB are available
that allows to control the form on VB directly from DLL on D.
https://pp.vk.me/c638421/v638421885/9bee/0KJYM0QafWQ.jpg
On Friday, 11 November 2016 at 19:36:59 UTC, Nick Sabalausky
wrote:
I've gone through a lot of compiler upgrades on a lot of D
projects, and in my experience, this "investigate and fix for
the new dmd" has always been trivial (aside from one instance
where Phobos's standard function
On 11/11/2016 08:30 AM, Dicebot wrote:
On Friday, 11 November 2016 at 13:21:40 UTC, Nick Sabalausky wrote:
Run the new dmd. If it fails, either fix your code or go temporarily
go back to the old dmd until you can fix your code.
D will never be considered production ready as pong as this
On Friday, 11 November 2016 at 17:07:50 UTC, John Colvin wrote:
I'm sure there are loads of corner cases this doesn't cover,
but:
template inPos(uint n, alias f)
{
auto inPos(Args...)(auto ref Args args)
{
return f(args[1 .. n+1], args[0], args[n+1 .. $]);
}
}
import
On Thursday, 10 November 2016 at 16:47:30 UTC, Adam D. Ruppe
wrote:
On Thursday, 10 November 2016 at 16:41:56 UTC, Charles Hixson
wrote:
It's *supposed* to be nan, and the assert message reports that
it is, but it should pass the assert test, not throw an
assertion. What am I doing wrong?
On Friday, 11 November 2016 at 16:39:26 UTC, Heisenberg wrote:
What would it take to implement the Uniform Function Call
Syntax for a function's argument which is not the first?
Right now it is possible to do the following:
int someNumber(int a, int b)
{
return a + b;
}
void main()
{
On Thursday, 10 November 2016 at 10:24:43 UTC, Rene Zwanenburg
wrote:
On Thursday, 10 November 2016 at 09:35:00 UTC, Mario Silva
wrote:
I haven't tried it yet, but I would want to avoid changing the
compiler at this point, since we already have all our tooling
build around DMD.
That is why
What would it take to implement the Uniform Function Call Syntax
for a function's argument which is not the first?
Right now it is possible to do the following:
int someNumber(int a, int b)
{
return a + b;
}
void main()
{
int n1 = 5;
int n2 = n1.someNumber(n1 + 1); // Here the
On Wednesday, 9 November 2016 at 16:00:45 UTC, Nick Sabalausky
wrote:
On 11/05/2016 02:00 AM, Joakim wrote:
Nothing is ever "completely replaced"- somebody somewhere is
still using
a mainframe or a UNIX workstation- but yes, PCs will basically
disappear, just as you never see those old
https://issues.dlang.org/show_bug.cgi?id=4851
Eduard Staniloiu changed:
What|Removed |Added
Keywords||pull
--- Comment #9
In the past I have worked with D, C#, Java, Python and C and some
other less popular languages. Most recently working with C# I
suddenly realize the convenience and flexibility I had in D. One
case in particular is with bit-fields in D they are a pleasure to
use and implement, but in C# they
On Friday, 11 November 2016 at 13:30:17 UTC, RazvanN wrote:
I am trying to concatenate 2 ranges of the same type
(SortedRange in my case). I have tried merge, join and chain,
but the problem is that the result is not an object of the type
of the initial ranges. For example:
1. If I use
On 11/11/16 9:02 AM, Dicebot wrote:
On 11/11/2016 03:46 PM, Steven Schveighoffer wrote:
... or one can spend one extra hour to implement deprecation path and
the issue disappears completely.
There is a misunderstanding that the new cycle detection is an "upgrade"
of some kind. It's a bug fix.
On 11/11/16 9:06 AM, Rainer Schuetze wrote:
On 11.11.2016 14:42, Steven Schveighoffer wrote:
The option to ignore the cycles is there, added to allow for people to
use the new DMD even if cycles exist. However, it is a runtime switch,
which means you have to run it that way.
You can also
https://issues.dlang.org/show_bug.cgi?id=3880
John Colvin changed:
What|Removed |Added
Status|RESOLVED|REOPENED
On 11.11.2016 14:42, Steven Schveighoffer wrote:
On 11/11/16 8:21 AM, Nick Sabalausky wrote:
On 11/11/2016 04:54 AM, Kagamin wrote:
On Thursday, 10 November 2016 at 13:58:56 UTC, Steven Schveighoffer
wrote:
Only possibility is just to ignore ALL cycles, and print them if any
are detected.
On 11/11/2016 03:46 PM, Steven Schveighoffer wrote:
>> ... or one can spend one extra hour to implement deprecation path and
>> the issue disappears completely.
>
> There is a misunderstanding that the new cycle detection is an "upgrade"
> of some kind. It's a bug fix.
There is no difference
On Friday, 11 November 2016 at 09:10:38 UTC, Edwin van Leeuwen
wrote:
On Thursday, 10 November 2016 at 22:30:34 UTC, Karabuta wrote:
Hello community, does anyone have on something for PDF
generation in D? I may need a PDF generation library in a
vibe.d project I'm working on. :)
Thanks
On 11/11/16 8:30 AM, Dicebot wrote:
On Friday, 11 November 2016 at 13:21:40 UTC, Nick Sabalausky wrote:
Run the new dmd. If it fails, either fix your code or go temporarily
go back to the old dmd until you can fix your code.
D will never be considered production ready as pong as this attiude
On Friday, 11 November 2016 at 13:39:32 UTC, RazvanN wrote:
It does work, the problem is that [1, 2, 3].sort() is of type
SortedRange(int[], "a < b") while r is of type
SortedRange(Result, "a < b"). This is a problem if you want to
return r in a function which has return type
On 11/11/16 8:21 AM, Nick Sabalausky wrote:
On 11/11/2016 04:54 AM, Kagamin wrote:
On Thursday, 10 November 2016 at 13:58:56 UTC, Steven Schveighoffer
wrote:
Only possibility is just to ignore ALL cycles, and print them if any
are detected.
Run the new detector and if it fails, run the old
On Friday, 11 November 2016 at 13:33:20 UTC, Vladimir Panteleev
wrote:
On Friday, 11 November 2016 at 13:30:17 UTC, RazvanN wrote:
I know that I can use the .array property, but I think that
this iterates through all of my elements. Using
assumeSorted(chain(r1, r2).array) will return a
On Friday, 11 November 2016 at 13:21:40 UTC, Nick Sabalausky
wrote:
Run the new dmd. If it fails, either fix your code or go
temporarily go back to the old dmd until you can fix your code.
D will never be considered production ready as pong as this
attiude remaind. Your described scenario in
On Friday, 11 November 2016 at 13:30:17 UTC, RazvanN wrote:
I know that I can use the .array property, but I think that
this iterates through all of my elements. Using
assumeSorted(chain(r1, r2).array) will return a SortedRange,
but I am not sure what the complexity for this operation is.
I am trying to concatenate 2 ranges of the same type (SortedRange
in my case). I have tried merge, join and chain, but the problem
is that the result is not an object of the type of the initial
ranges. For example:
1. If I use chain(r1, r2), the result will be an object of type
Result which
On 11/11/2016 04:54 AM, Kagamin wrote:
On Thursday, 10 November 2016 at 13:58:56 UTC, Steven Schveighoffer wrote:
Only possibility is just to ignore ALL cycles, and print them if any
are detected.
Run the new detector and if it fails, run the old one, if it succeeds,
print a message.
Or:
https://issues.dlang.org/show_bug.cgi?id=16681
--- Comment #1 from Илья Ярошенко ---
PR https://github.com/dlang/phobos/pull/4896
--
https://issues.dlang.org/show_bug.cgi?id=16681
Илья Ярошенко changed:
What|Removed |Added
Keywords||ice-on-valid-code
https://issues.dlang.org/show_bug.cgi?id=16681
Илья Ярошенко changed:
What|Removed |Added
Keywords||ice, SIMD
--
https://issues.dlang.org/show_bug.cgi?id=16681
Илья Ярошенко changed:
What|Removed |Added
Hardware|x86 |All
--
https://issues.dlang.org/show_bug.cgi?id=16681
Issue ID: 16681
Summary: ICE 1662
Product: D
Version: D2
Hardware: x86
OS: All
Status: NEW
Severity: major
Priority: P1
Component: dmd
On Friday, 11 November 2016 at 12:02:10 UTC, ketmar wrote:
On Friday, 11 November 2016 at 11:49:25 UTC, RazvanN wrote:
[...]
template isSortedRange(T) {
private import std.range : SortedRange;
static if (is(T : SortedRange!TT, TT)) {
enum isSortedRange = true;
} else {
enum
On Friday, 11 November 2016 at 11:49:25 UTC, RazvanN wrote:
I am a bit confused about how the is operator works. I have a
function which receives an InputRange and a predicate. Now I
need to be able to test if the InputRange is actually a
SortedRange. I don't care about how the datatypes
On Friday, November 11, 2016 11:49:25 RazvanN via Digitalmars-d-learn wrote:
> I am a bit confused about how the is operator works. I have a
> function which receives an InputRange and a predicate. Now I need
> to be able to test if the InputRange is actually a SortedRange. I
> don't care about
I am a bit confused about how the is operator works. I have a
function which receives an InputRange and a predicate. Now I need
to be able to test if the InputRange is actually a SortedRange. I
don't care about how the datatypes behind the SortedRange or the
predicate, I just need to see if
On Friday, 11 November 2016 at 10:05:14 UTC, Daniel Kozak wrote:
Dne 11.11.2016 v 10:43 Jacob Marek via Digitalmars-d napsal(a):
Hi! so I'm probably being dumb here however I'm having an
issue getting readf and readln to work properly. It seems to
be superseding the rest of my code. Allow me
On Friday, 11 November 2016 at 10:56:31 UTC, Chris wrote:
On Thursday, 10 November 2016 at 16:48:01 UTC, Nick Sabalausky
wrote:
I hope you're right, because I definitely need to use an
"old-fashioned" machine in order to get things done without
wasting enormous time & effort.
[...]
Sit
On Thursday, 10 November 2016 at 16:48:01 UTC, Nick Sabalausky
wrote:
I hope you're right, because I definitely need to use an
"old-fashioned" machine in order to get things done without
wasting enormous time & effort.
[...]
Sit on the bank of a river and wait: Your enemy's corpse will
https://issues.dlang.org/show_bug.cgi?id=16504
--- Comment #2 from github-bugzi...@puremagic.com ---
Commits pushed to master at https://github.com/dlang/druntime
https://github.com/dlang/druntime/commit/ce6aef38adbf7f652db67bc7287a97e45c173b8f
Revert "Merge pull request #1637 from
https://issues.dlang.org/show_bug.cgi?id=16651
--- Comment #4 from github-bugzi...@puremagic.com ---
Commits pushed to stable at https://github.com/dlang/druntime
https://github.com/dlang/druntime/commit/44f45280b7fe308731611801385f8c6226214682
fix issue 16651 - atomicOp!"-="(ulong, uint) =
https://issues.dlang.org/show_bug.cgi?id=16651
github-bugzi...@puremagic.com changed:
What|Removed |Added
Status|NEW |RESOLVED
Dne 11.11.2016 v 10:43 Jacob Marek via Digitalmars-d napsal(a):
Hi! so I'm probably being dumb here however I'm having an issue
getting readf and readln to work properly. It seems to be superseding
the rest of my code. Allow me to explain. No matter where I put the
readf/readln function it
On Friday, 11 November 2016 at 09:43:51 UTC, Jacob Marek wrote:
Hi! so I'm probably being dumb here however I'm having an issue
getting readf and readln to work properly. It seems to be
superseding the rest of my code. Allow me to explain. No matter
where I put the readf/readln function it
On Thursday, 10 November 2016 at 13:58:56 UTC, Steven
Schveighoffer wrote:
Only possibility is just to ignore ALL cycles, and print them
if any are detected.
Run the new detector and if it fails, run the old one, if it
succeeds, print a message.
https://issues.dlang.org/show_bug.cgi?id=16663
--- Comment #4 from anonymous4 ---
This probably falls under the same argument: this String is not supposed to be
a range. Maybe extension of range functions to collections (autorangification)
is in order.
--
I used text files and LaTeX in the past, it works with everything
textfile -> process -> LaTeX -> pdf
Hi! so I'm probably being dumb here however I'm having an issue
getting readf and readln to work properly. It seems to be
superseding the rest of my code. Allow me to explain. No matter
where I put the readf/readln function it will get hung up in the
console waiting for input. An example is
On Friday, 11 November 2016 at 08:50:02 UTC, Kagamin wrote:
On Friday, 11 November 2016 at 06:01:49 UTC, Vladimir Panteleev
wrote:
https://github.com/CyberShadow/ae/tree/master/utils/time
BTW what 'C' format specifier means?
On Thursday, 10 November 2016 at 22:30:34 UTC, Karabuta wrote:
Hello community, does anyone have on something for PDF
generation in D? I may need a PDF generation library in a
vibe.d project I'm working on. :)
Personally I would generate markdown and use a command line tool
(pandoc) to
On Thursday, 10 November 2016 at 23:45:01 UTC, Charles Hixson
wrote:
you might try using std.math.isNaN instead and see what it
does.
It was default initialized by the class instance:
classCell
...
floatcurActivation;
...
The this method doesn't have any mention of a few variables
On 11/10/2016 02:30 PM, Karabuta wrote:
Hello community, does anyone have on something for PDF generation in D?
I may need a PDF generation library in a vibe.d project I'm working on. :)
Last time I checked, there was nothing even close to the quality of
Prince XML when it comes to print
On Thursday, 10 November 2016 at 22:30:34 UTC, Karabuta wrote:
Hello community, does anyone have on something for PDF
generation in D? I may need a PDF generation library in a
vibe.d project I'm working on. :)
You can pull in Gtk with Cairo and Pango. Cairo can generate pdf.
Pango is
On Friday, 11 November 2016 at 06:01:49 UTC, Vladimir Panteleev
wrote:
https://github.com/CyberShadow/ae/tree/master/utils/time
BTW what 'C' format specifier means?
https://github.com/CyberShadow/ae/blob/master/utils/time/format.d#L65 I noticed dfeed uses it too and formatted time stings end
I found funny (from my point of view) challenge in Russian Stack
Overflow.
Any language accepted.
You need to make the loop
for (int x=0; x<3; ++x) {}
endless.
Rules:
- you can't modify the loop's code itself;
- you can't modify the loop's variable inside the body of loop;
- you can't wrap
76 matches
Mail list logo