Hi there again D people!
I've ported the first six DirectX tutorials back in 2005 august to D,
and lost almost but the basic code for that...
Cannot find it on my machines or the internet...
One file was "dx_vertices.zip", but all of the C++
SDKSamples\C++\Direct3D\Tutorials\ been ported to D by m
On Friday, 31 August 2012 at 04:00:34 UTC, Charles Hixson wrote:
Perhaps I don't know enough to file a decent bug report...at
least when I can't reduce the test case that shows it
significantly.
Dustmite refers to this tool:
https://github.com/CyberShadow/DustMite
Basically it tries to comp
On 08/30/2012 09:17 AM, Dmitry Olshansky wrote:
On 30-Aug-12 09:40, Charles Hixson wrote:
On 08/29/2012 06:46 PM, Andrei Alexandrescu wrote:
On 8/29/12 4:52 PM, Charles Hixson wrote:
On 08/29/2012 04:15 PM, Andrei Alexandrescu wrote:
On 8/29/12 3:47 PM, Charles Hixson wrote:
Where should I l
On Thu, Aug 30, 2012 at 10:24 PM, Paul wrote:
>
> So one array like- aa[MyKey("abc","def","ghi")] = "my value";
>
> and another like- string[] da; da[99]="abc"~","~"def"~","~"ghi";
> or maybe- MyKey[] da; da[99]=MyKey("abc","def","ghi");
The latter, if you group your keys, I think. You
On Thursday, 30 August 2012 at 19:40:44 UTC, Philippe Sigaud
wrote:
On Thu, Aug 30, 2012 at 9:30 PM, Jonathan M Davis
wrote:
Yes, that's what I wanted to propose. Group an AA and a
standard,
dynamic, array. The array is just filled with the key, when you
assign
a new key/value pair. To query
On Thursday, August 30, 2012 21:40:34 Philippe Sigaud wrote:
> On Thu, Aug 30, 2012 at 9:30 PM, Jonathan M Davis
wrote:
> > I believe that if you want a map (be it ordered or unordered) to give you
> > items back in the order that you inserted them, then a separate list is
> > required (be it int
On Thursday, 30 August 2012 at 19:59:45 UTC, Jordi Sayol wrote:
Al 30/08/12 21:32, En/na Paul ha escrit:
What would be the best way to learn this language? I live in
Atlanta. I program and script as needed. Okay, at this point
I would classify myself as a hack. But I love writing my own
exe
Al 30/08/12 21:32, En/na Paul ha escrit:
> What would be the best way to learn this language? I live in Atlanta. I
> program and script as needed. Okay, at this point I would classify myself as
> a hack. But I love writing my own exe utilities. It's just cool, fun, and
> powerful. But I hav
On Thu, Aug 30, 2012 at 9:30 PM, Jonathan M Davis wrote:
> I believe that if you want a map (be it ordered or unordered) to give you
> items back in the order that you inserted them, then a separate list is
> required (be it integrated into the container or something you do alongside
> it) where
What would be the best way to learn this language? I live in
Atlanta. I program and script as needed. Okay, at this point I
would classify myself as a hack. But I love writing my own exe
utilities. It's just cool, fun, and powerful. But I have to do
so much struggling to get one little scr
On Thu, Aug 30, 2012 at 8:57 PM, Paul wrote:
> Maybe I'm not going about my project from the best angle? Another problem I
> have is when I go to printout my array, being associative, it is not in the
> order I built it. It would help greatly if I could print it in order.
Associative arrays re
On Thursday, August 30, 2012 20:57:44 Paul wrote:
> Maybe I'm not going about my project from the best angle?
> Another problem I have is when I go to printout my array, being
> associative, it is not in the order I built it. It would help
> greatly if I could print it in order.
Hash tables (and a
On Thursday, 30 August 2012 at 18:29:28 UTC, Paul wrote:
On Thursday, 30 August 2012 at 18:20:02 UTC, Philippe Sigaud
wrote:
On Thu, Aug 30, 2012 at 7:18 PM, Paul
wrote:
From the book a way to respond to a non-existent key in an
assoc. array:
assert(aa["hello"] == "ciao");
// Key "hello" exi
On Thursday, 30 August 2012 at 18:20:02 UTC, Philippe Sigaud
wrote:
On Thu, Aug 30, 2012 at 7:18 PM, Paul
wrote:
From the book a way to respond to a non-existent key in an
assoc. array:
assert(aa["hello"] == "ciao");
// Key "hello" exists, therefore ignore the second argume
assert(aa.get("hel
On Thu, Aug 30, 2012 at 7:18 PM, Paul wrote:
> From the book a way to respond to a non-existent key in an assoc. array:
>
> assert(aa["hello"] == "ciao");
> // Key "hello" exists, therefore ignore the second argume
> assert(aa.get("hello", "salute") == "ciao");
> // Key "yo" doesn’t exist, return
On Thursday, 30 August 2012 at 17:38:48 UTC, cal wrote:
On Thursday, 30 August 2012 at 06:30:50 UTC, Jacob Carlborg
wrote:
Replacing string[] with dstring[] for EnumMembers triggers a DMD
bug, so I guess the CTFE interpreter is buggy even in the
string[] case.
Filed http://d.puremagic.com/i
On Thursday, 30 August 2012 at 06:30:50 UTC, Jacob Carlborg wrote:
On 2012-08-30 08:28, Jacob Carlborg wrote:
It works for me. DMD 2.060 Mac OS X.
Oh, it does not. If I replace:
enum string[] fields = [EnumMembers!E].to!(string[]);
With:
enum string[] fields = ["one", "two"];
It works.
From the book a way to respond to a non-existent key in an assoc.
array:
assert(aa["hello"] == "ciao");
// Key "hello" exists, therefore ignore the second argume
assert(aa.get("hello", "salute") == "ciao");
// Key "yo" doesn’t exist, return the second argument
assert(aa.get("yo", "buongiorno") =
On 30-Aug-12 09:40, Charles Hixson wrote:
On 08/29/2012 06:46 PM, Andrei Alexandrescu wrote:
On 8/29/12 4:52 PM, Charles Hixson wrote:
On 08/29/2012 04:15 PM, Andrei Alexandrescu wrote:
On 8/29/12 3:47 PM, Charles Hixson wrote:
Where should I look to better understand
rdmd? I expected to need
On Thursday, 30 August 2012 at 13:39:30 UTC, Regan Heath wrote:
Where did you find that.. I still can't find the blasted thing
:p
void dmd_51d770(char* msg, char* title) {
at address 0x51d770 in the _TEXT section (in a slightly less
disassembled form)
apparently I'm not the first person
On Wed, 29 Aug 2012 18:43:27 +0100, Ellery Newcomer
wrote:
On 08/28/2012 01:03 PM, Ellery Newcomer wrote:
On 08/28/2012 09:55 AM, Regan Heath wrote:
> I searched the DMD sources, just in case the message "abnormal
> program termination" was DMD specific, and I found nothing. Then I
> sea
21 matches
Mail list logo
