We can crack or emulate any protection type: Dongle,
Hardlock, Hasp, Serial, Password, Hasp4, Flexlm, Sentinel,
Wibu, Eutron Smartkey, Hasphl, Proteq, All the Protections!!
email = yshows...@gmail.com
email = yshowsoft at gmail.com
NEW UPDATES 2010
Artpro 9.5r4 with license (minimal of 2
http://d.puremagic.com/issues/show_bug.cgi?id=4717
Don clugd...@yahoo.com.au changed:
What|Removed |Added
CC||clugd...@yahoo.com.au
---
http://d.puremagic.com/issues/show_bug.cgi?id=4681
Don clugd...@yahoo.com.au changed:
What|Removed |Added
CC||clugd...@yahoo.com.au
---
http://d.puremagic.com/issues/show_bug.cgi?id=3463
nfx...@gmail.com changed:
What|Removed |Added
Attachment #701 is|0 |1
obsolete|
http://d.puremagic.com/issues/show_bug.cgi?id=3463
--- Comment #70 from nfx...@gmail.com 2010-08-24 01:40:52 PDT ---
Created an attachment (id=738)
experiment: use ClassInfo to get bitmask for object allocations
objbitmask.patch is a patch on top of tango_precise_gc.patch, which makes
storing
http://d.puremagic.com/issues/show_bug.cgi?id=4719
Summary: Clean up associative array runtime interface to enable
precise GC
Product: D
Version: D1 D2
Platform: Other
OS/Version: All
Status: NEW
http://d.puremagic.com/issues/show_bug.cgi?id=4681
nfx...@gmail.com changed:
What|Removed |Added
CC||nfx...@gmail.com
--- Comment #9
http://d.puremagic.com/issues/show_bug.cgi?id=4717
--- Comment #3 from bearophile_h...@eml.cc 2010-08-24 03:57:46 PDT ---
Answer to Comment 2:
The code in the bithacks site I have given URL of probably is what you were
talking about.
But then there are refined algorithms to use the basic code
http://d.puremagic.com/issues/show_bug.cgi?id=4720
Summary: contracts don't work on function definitions
Product: D
Version: D2
Platform: All
OS/Version: All
Status: NEW
Severity: normal
Priority: P2
http://d.puremagic.com/issues/show_bug.cgi?id=4717
--- Comment #4 from Don clugd...@yahoo.com.au 2010-08-24 05:55:05 PDT ---
(In reply to comment #3)
Answer to Comment 2:
The code in the bithacks site I have given URL of probably is what you were
talking about.
But then there are refined
http://d.puremagic.com/issues/show_bug.cgi?id=4720
Don clugd...@yahoo.com.au changed:
What|Removed |Added
CC||clugd...@yahoo.com.au
http://d.puremagic.com/issues/show_bug.cgi?id=3463
nfx...@gmail.com changed:
What|Removed |Added
Attachment #700 is|0 |1
obsolete|
http://d.puremagic.com/issues/show_bug.cgi?id=4717
--- Comment #5 from bearophile_h...@eml.cc 2010-08-24 06:31:52 PDT ---
I see, I think you are talking about using a SWAR approach then. I have never
used it for this job, but it sounds intersting. I'd like to do some benchmarks
to see what the
http://d.puremagic.com/issues/show_bug.cgi?id=4721
Summary: compilation slow when compiling unittests on
dcollections
Product: D
Version: D2
Platform: Other
OS/Version: Linux
Status: NEW
Severity: normal
http://d.puremagic.com/issues/show_bug.cgi?id=4721
Andrej Mitrovic andrej.mitrov...@gmail.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=4721
--- Comment #2 from Steven Schveighoffer schvei...@yahoo.com 2010-08-24
07:49:15 PDT ---
It might be a linux-only problem, I'm not sure. I also have an older machine,
maybe yours is twice as fast?
27 seconds still seems quite long for a
Hi, all!
Try this:
--- snip ---
void remove(T)(out T[] array,T element) {
int r=0,w=0;
while (rarray.length) {
if (array[r]!=element)
array[w++]=array[r];
++r;
}
array.length=w;
}
void test() {
int[] array;
int element=2;
//
array=[1,3,2,2,1,3,1,1,2];
On Tue, 24 Aug 2010 11:18:35 -0400, 0ffh
fr...@youknow.what.todo.internetz wrote:
Hi, all!
Try this:
--- snip ---
void remove(T)(out T[] array,T element) {
int r=0,w=0;
while (rarray.length) {
if (array[r]!=element)
array[w++]=array[r];
++r;
}
array.length=w;
0ffh fr...@youknow.what.todo.internetz wrote:
So, my question is: Huh?
The answer to this should for symmetry be: Duh!
However, it is not quite that simple.
void remove(T)(out T[] array,T element) {
This is the line that gives you problems. You are expecting 'out' to
work like 'ref',
http://d.puremagic.com/issues/show_bug.cgi?id=4721
--- Comment #3 from Andrej Mitrovic andrej.mitrov...@gmail.com 2010-08-24
09:55:25 PDT ---
(In reply to comment #2)
It might be a linux-only problem, I'm not sure. I also have an older machine,
maybe yours is twice as fast?
27 seconds
http://d.puremagic.com/issues/show_bug.cgi?id=4721
--- Comment #4 from Andrej Mitrovic andrej.mitrov...@gmail.com 2010-08-24
09:55:55 PDT ---
* not that many files, not size.
--
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
--- You are receiving this mail
http://d.puremagic.com/issues/show_bug.cgi?id=4721
--- Comment #5 from Steven Schveighoffer schvei...@yahoo.com 2010-08-24
10:13:43 PDT ---
(In reply to comment #3)
y small from what I can tell.
Btw your updated d2.0b library now compiles in 11 seconds on my system with
DMD
2.048.
Still
http://d.puremagic.com/issues/show_bug.cgi?id=3682
--- Comment #3 from Don clugd...@yahoo.com.au 2010-08-24 12:39:36 PDT ---
Reduced testcase shows that it doesn't require -unittest, and it is D2-only.
--- a3682.d--
struct Tuple(Types...)
{
Tuple!(Types[0..1]) slice()()
{
http://d.puremagic.com/issues/show_bug.cgi?id=4717
--- Comment #6 from bearophile_h...@eml.cc 2010-08-24 14:02:31 PDT ---
For efficiency on 64 bit systems too you may change this code from the BitArray
struct:
struct BitArray
{
size_t len;
uint* ptr;
...
void init(void[] v,
http://d.puremagic.com/issues/show_bug.cgi?id=4721
--- Comment #6 from Steven Schveighoffer schvei...@yahoo.com 2010-08-24
14:10:26 PDT ---
More testing, I did some printf debugging.
According to the comments and the code of the function, it's a *linear* search
through the symbol table for a
http://d.puremagic.com/issues/show_bug.cgi?id=3725
Jonathan M Davis jmdavisp...@gmail.com changed:
What|Removed |Added
CC|
http://d.puremagic.com/issues/show_bug.cgi?id=4722
Summary: Debug Phobos lib
Product: D
Version: D2
Platform: All
OS/Version: Windows
Status: NEW
Severity: enhancement
Priority: P2
Component: DMD
http://d.puremagic.com/issues/show_bug.cgi?id=4688
--- Comment #4 from Nick Sabalausky cbkbbej...@mailinator.com 2010-08-24
21:42:18 PDT ---
Note that this bug is not just cosmetic: It causes problems for programs that
launch rdmd through a system() call. The system() call will return *before*
28 matches
Mail list logo
