• Gary Willoughby (7/7) Jan 11 2015 Could D compete in a competition like this?
• ponce (5/12) Jan 11 2015 Yes. You can do it with DUB, just provide a .def file in your
• "Ola Fosheim =?UTF-8?B?R3LDuHN0YWQi?= (2/3) Jan 11 2015 The guts will have to be done in assembly or Intel intrinsics...
• Craig Dillabaugh (6/10) Jan 11 2015 Why do you say that. Seems like picking the correct data
• "Ola Fosheim =?UTF-8?B?R3LDuHN0YWQi?= (11/23) Jan 11 2015 1. It is a basic spatial indexing problem. This is a heavily
• CraigDillabaugh (3/28) Jan 12 2015 OK, if they gave the hardware list then that makes sense.
• Rikki Cattermole (3/9) Jan 11 2015 I managed to get it working fine with dmd 2.066.1. Ldc on the other

"Gary Willoughby" <dev nomad.so> writes:

Could D compete in a competition like this?

"In a nutshell: We give you a bunch of ranked 2D points, then ask 
you to find the most important ones inside some randomly 
generated rectangles. Easy, right? Now make it fast, and you 
could get $5K!"

http://churchillnavigation.com/challenge/

Can D produce Windows DLL's?

"ponce" <contact gam3sfrommars.fr> writes:

On Sunday, 11 January 2015 at 13:01:36 UTC, Gary Willoughby wrote:
 Could D compete in a competition like this?

 "In a nutshell: We give you a bunch of ranked 2D points, then 
 ask you to find the most important ones inside some randomly 
 generated rectangles. Easy, right? Now make it fast, and you 
 could get $5K!"

 http://churchillnavigation.com/challenge/

 Can D produce Windows DLL's?

Yes. You can do it with DUB, just provide a .def file in your 
sourceFiles and use "targetType": "dynamicLibrary".

Example:
https://github.com/p0nce/dplug/blob/master/examples/distort/dub.json

"Ola Fosheim =?UTF-8?B?R3LDuHN0YWQi?= writes:

On Sunday, 11 January 2015 at 13:01:36 UTC, Gary Willoughby wrote:
 Could D compete in a competition like this?

The guts will have to be done in assembly or Intel intrinsics...

"Craig Dillabaugh" <craig.dillabaugh gmail.com> writes:

On Sunday, 11 January 2015 at 13:10:12 UTC, Ola Fosheim Grøstad 
wrote:
 On Sunday, 11 January 2015 at 13:01:36 UTC, Gary Willoughby 
 wrote:
 Could D compete in a competition like this?

 The guts will have to be done in assembly or Intel intrinsics...

Why do you say that.  Seems like picking the correct data 
structure/algorithms would be of more importance than the 
programming language.  I don't see why this couldn't be made 
'fast' with just about any programming language.

"Ola Fosheim =?UTF-8?B?R3LDuHN0YWQi?= writes:

On Monday, 12 January 2015 at 03:35:32 UTC, Craig Dillabaugh 
wrote:
 On Sunday, 11 January 2015 at 13:10:12 UTC, Ola Fosheim Grøstad 
 wrote:
 On Sunday, 11 January 2015 at 13:01:36 UTC, Gary Willoughby 
 wrote:
 Could D compete in a competition like this?

 The guts will have to be done in assembly or Intel 
 intrinsics...

 Why do you say that.  Seems like picking the correct data 
 structure/algorithms would be of more importance than the 
 programming language.  I don't see why this couldn't be made 
 'fast' with just about any programming language.

1. It is a basic spatial indexing problem. This is a heavily 
researched GIS area.

2. They list the hardware.

But, they are cheating you: «All submissions will become 
public-domain DLLs.» + «prize money will be awarded to the three 
fastest solutions that are quicker than our fast solution.»

They are basically trying to get "master-level students" to do 
highly valuable work for "peanuts" in order to improve their own 
commercial systems... :-/

"CraigDillabaugh" <craig.dillabaugh gmail.com> writes:

On Monday, 12 January 2015 at 07:19:16 UTC, Ola Fosheim Grøstad 
wrote:
 On Monday, 12 January 2015 at 03:35:32 UTC, Craig Dillabaugh 
 wrote:
 On Sunday, 11 January 2015 at 13:10:12 UTC, Ola Fosheim 
 Grøstad wrote:
 On Sunday, 11 January 2015 at 13:01:36 UTC, Gary Willoughby 
 wrote:
 Could D compete in a competition like this?

 The guts will have to be done in assembly or Intel 
 intrinsics...

 Why do you say that.  Seems like picking the correct data 
 structure/algorithms would be of more importance than the 
 programming language.  I don't see why this couldn't be made 
 'fast' with just about any programming language.

 1. It is a basic spatial indexing problem. This is a heavily 
 researched GIS area.

 2. They list the hardware.

 But, they are cheating you: «All submissions will become 
 public-domain DLLs.» + «prize money will be awarded to the 
 three fastest solutions that are quicker than our fast 
 solution.»

 They are basically trying to get "master-level students" to do 
 highly valuable work for "peanuts" in order to improve their 
 own commercial systems... :-/

OK, if they gave the hardware list then that makes sense.

Rikki Cattermole <alphaglosined gmail.com> writes:

On 12/01/2015 2:01 a.m., Gary Willoughby wrote:
 Could D compete in a competition like this?

 "In a nutshell: We give you a bunch of ranked 2D points, then ask you to
 find the most important ones inside some randomly generated rectangles.
 Easy, right? Now make it fast, and you could get $5K!"

 http://churchillnavigation.com/challenge/

 Can D produce Windows DLL's?

I managed to get it working fine with dmd 2.066.1. Ldc on the other 
hand.. ehh bug reports needed.