On 11/08/2013 03:24 PM, Dick Hollenbeck wrote:
On 10/16/2013 03:19 PM, Dick Hollenbeck wrote:
On 10/16/2013 09:32 AM, Maciej Sumiński wrote:
On 10/16/2013 02:59 PM, Dick Hollenbeck wrote:
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com
mailto:d...@softplc.com wrote:
Looks
On 10/16/2013 03:19 PM, Dick Hollenbeck wrote:
On 10/16/2013 09:32 AM, Maciej Sumiński wrote:
On 10/16/2013 02:59 PM, Dick Hollenbeck wrote:
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com
mailto:d...@softplc.com wrote:
Looks promising, and super job on the presentation.
Le 16/10/2013 16:32, Maciej Sumiński a écrit :
On 10/16/2013 02:59 PM, Dick Hollenbeck wrote:
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com
mailto:d...@softplc.com wrote:
Looks promising, and super job on the presentation.
Once you have it working, give some thought to
Hi all,
We need a ratsnest that works with the GAL, therefore I present to you
the blueprints for that part:
https://blueprints.launchpad.net/kicad/+spec/ratsnest-gal
I have seen many great ideas appearing on the mailing list, that's why
everyone is welcome to share thoughts. I believe it
Looks promising, and super job on the presentation.
Once you have it working, give some thought to using a special purpose
allocator for the elements of your container. A memory pool scheme,
anchored on the container, might pay dividends if it removes the size test
for element allocations. If
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com wrote:
Looks promising, and super job on the presentation.
Once you have it working, give some thought to using a special purpose
allocator for the elements of your container. A memory pool scheme,
anchored on the container, might pay
On 10/16/2013 04:09 AM, Maciej Sumiński wrote:
Hi all,
We need a ratsnest that works with the GAL, therefore I present to you
the blueprints for that part:
https://blueprints.launchpad.net/kicad/+spec/ratsnest-gal
I have seen many great ideas appearing on the mailing list, that's why
FYI, in step 4 of the algorithm, I believe you wanted to refer to step 3:
*4. Remove edges with zero weight.*
The last step is to remove zero weight edges (as they are already
connected). The remaining edges make the ratsnest. This step could be
integrated with the step 3, as 0-weight edges could
On 10/16/2013 03:54 PM, Carl Poirier wrote:
FYI, in step 4 of the algorithm, I believe you wanted to refer to step 3:
*4. Remove edges with zero weight.*
The last step is to remove zero weight edges (as they are already
connected). The remaining edges make the ratsnest. This step could be
On 10/16/2013 02:59 PM, Dick Hollenbeck wrote:
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com
mailto:d...@softplc.com wrote:
Looks promising, and super job on the presentation.
Once you have it working, give some thought to using a special
purpose allocator for the elements
On 10/16/2013 09:24 AM, Maciej Sumiński wrote:
On 10/16/2013 03:49 PM, Dick Hollenbeck wrote:
On 10/16/2013 04:09 AM, Maciej Sumiński wrote:
It requires hashing function to be prepared (eg. using boost::hash),
possibly not very
demanding on CPU cycles.
Sounds good. A hashtable is
On 10/16/2013 09:32 AM, Maciej Sumiński wrote:
On 10/16/2013 02:59 PM, Dick Hollenbeck wrote:
On Oct 16, 2013 7:53 AM, Dick Hollenbeck d...@softplc.com
mailto:d...@softplc.com wrote:
Looks promising, and super job on the presentation.
Once you have it working, give some thought to
12 matches
Mail list logo
