D - Charon Common Library - charon.zip
- resistor mac.com (74/74) Feb 24 2004 This is the preliminary version of a library I'm working on that I thoug...
- larry cowan (4/78) Feb 24 2004 Would like to look at your zip, but I can't seem to get a good decode of...
- resistor mac.com (5/90) Feb 24 2004 Hmm... I just attached it normally. But it appears not to have worked.
- Mike Janssen (1/1) Feb 25 2004 it would be cool to have a Ternary Search Tree in the package
- resistor mac.com (4/5) Feb 25 2004 That I can work on, but I'm trying to make my binary tree work first. S...
- Juanjo Alvarez (4/6) Feb 25 2004 Cool! You could register it in the Phobos-Project wiki page here so othe...
This is the preliminary version of a library I'm working on that I thought might be of interest to some people here. As of right now it's a primitive data structures library drawing loose inspiration from the Java Foundation Classes, and making extensive use of D's generic programming capabilities. Included in this archive are implementations of: Queues, Stacks, and Trees. There are also two supporting classes (Array and Node), and an interface (Enqueue). A Linked list implementation is mostly complete, and Binary Trees will be the next target. I'd like to eventually get this collection up to snuff for inclusion in Phobos or maybe another standard library. Remember, this is a preliminary release. So if it blows up in your face, don't blame me. Owen P.S. If anyone out there who's proficient at the Design by Contract bit would like to take a look at this, that would be awesome. I tried to fill in the appropriate asserts, but I'm not very good at it yet. begin 0644 charon.zip M9`"-4\%N S`,/3M?X=U`E1"[CC%I_\"MJB8&V8 4,`IA6C7Q[TM*&`VE,`Y) M0O/RB0%DQQ/6;ZX( ,%89U.Z$ET0F .(QA2"S0(,=J%>+R+O5)[]T-0A0]II M`H8B5SIP/"+)FT]=89KB8YBL`([QR29I3"[&PS4(*;FA8P3[A*;N-`U^P?BJ M]1[-/_1]&5-GA_L A8%H-(HT3E`\^P4F<CB$;N12N1B5F]WU&C:NP.J/RKZ= MM3"K6J-CYIGKZ0T4[UIJ.A[ZTJ>P)>&S7O="<=VK9 %U2(_+Y3KDJBT2']*E M'__A)WU7]JC?=T]N:KLIF/%X^<SYBT1I7B+/U<:=[SR%>/-OGZ?'#C;\`E!+ M`P04````"`!J%%DP(/./-U````!?````%P`5`&-H87)O;B]C;VUM;VXO96YQ M=65U92YD550)``/H"3Q`!^([0%5X!`#H`V0`R\U/*<U)54C.2"S*S]-+SL_- M!5*I>86EJ:6IUEQ<F7DEJ45IB<FI"JX0,8T0385J+LX0A8+\` U-:S"KM#A M(T0A'\I+3<W6`&I3R`/R:P%02P,$%````` `=!E9,-Y6K+[A````QP(``!0` M-B $>6XLF9TDK>-EJ,62<[QU9#U M%6(+XVQH2 _^?'%0B%1R,;$OWNGKTT'!KY03M?=!FK39H ;ZXK)I,U)!!51. M[SSAON0/8(5%UY%Q*$:GF!^MGV6HJBFR*+<F6_3!FFPM;\/7D7X#F!/%2,/D MKVA;!?21NLCV)I;L4F%C_UA<QFV"4MOC:_"H.Z 6:\M^8NHL<]!4/CKU3U!+ M_8!(W"I4T6154&%-_)`25?GWVM 0B*BJ<H!E9X89#YT\V!9A7U=*4KJ77><> M1XL6!>=-UTME;L!*J>HLUC&D48JG`+>5UK#SRZ38P!9>O/K.S0^O >MG^.:, M1K=0$N(7)-Z,EC7%$Q`\W_C/XBX;_+7`Z_]=/VH,.]*HC*S+#U!+`P04```` M"`",%5DP5/CL BX!``!3`P``%0`5`&-H87)O;B]C;VUM;VXO<W1A8VLN9%54 M9!40L*9^J(FJ]-MK Z&`W*KA8-::V=V9D5M^U`U"4>:"4USPMC4_J?*B3H* M,G6^\>/%\3, /"M(H7WM+>T?#CV/N?L,V<:Q*^,&Z:1*QQ2HM*!^CEL!SH>5 MKV4)809\;F$FD_OT_>5L\I6F9F RAT:A2Y7WV\.MW&FU/[*]87UP45=T&F:Z MO.D! G*%K+*/4I F2+8'C0<I596[U\-?((K:2LT"\/`^WCP]`M6=1Z N)Z;X M5E$(^2&,6%K;A)98'K1(M6IX'31_2 D.F2\.#K:PS^I&CU_6M$R"E6"]M<8H M`N'H\4/*^\C-^:*S-8/?3"I7N#R9)JJ7,7K=]$:=0,&86HH)W2":G`)9YM>P MVXW+7#E_^$[UYX S2L=QD4>)U>[^)*L$TY)-(=`DB)WW;F&ON5;<X*Y1?DXQ M``````$```"D 4$```!C:&%R;VXO8V]M;6]N+V%R<F%Y+F155`4``Z(-/$!5 MP`$``&-H87)O;B]C;VUM;VXO96YQ=65U92YD550%``/H"3Q`57 ``%!+`0(7 M=65U92YD550%``-W#CQ M```5``T```````$```"D >0$``!C:&%R;VXO8V]M;6]N+W-T86-K+F155`4` M`0```*2!6 8``&-H87)O;B]C;VUM;VXO=')E92YD550%``/3$CQ`57 ``%!+ 4!08`````!P`'`"D"``"`!P````!M ` end
Feb 24 2004
Would like to look at your zip, but I can't seem to get a good decode of it. Did you make it an attachment, or what? Can you attach so it comes as a separate mime-section? In article <c1h4l7$2rl5$1 digitaldaemon.com>, resistor mac.com says...This is the preliminary version of a library I'm working on that I thought might be of interest to some people here. As of right now it's a primitive data structures library drawing loose inspiration from the Java Foundation Classes, and making extensive use of D's generic programming capabilities. Included in this archive are implementations of: Queues, Stacks, and Trees. There are also two supporting classes (Array and Node), and an interface (Enqueue). A Linked list implementation is mostly complete, and Binary Trees will be the next target. I'd like to eventually get this collection up to snuff for inclusion in Phobos or maybe another standard library. Remember, this is a preliminary release. So if it blows up in your face, don't blame me. Owen P.S. If anyone out there who's proficient at the Design by Contract bit would like to take a look at this, that would be awesome. I tried to fill in the appropriate asserts, but I'm not very good at it yet. begin 0644 charon.zip M9`"-4\%N S`,/3M?X=U`E1"[CC%I_\"MJB8&V8 4,`IA6C7Q[TM*&`VE,`Y) M0O/RB0%DQQ/6;ZX( ,%89U.Z$ET0F .(QA2"S0(,=J%>+R+O5)[]T-0A0]II M`H8B5SIP/"+)FT]=89KB8YBL`([QR29I3"[&PS4(*;FA8P3[A*;N-`U^P?BJ M]1[-/_1]&5-GA_L A8%H-(HT3E`\^P4F<CB$;N12N1B5F]WU&C:NP.J/RKZ= MM3"K6J-CYIGKZ0T4[UIJ.A[ZTJ>P)>&S7O="<=VK9 %U2(_+Y3KDJBT2']*E M'__A)WU7]JC?=T]N:KLIF/%X^<SYBT1I7B+/U<:=[SR%>/-OGZ?'#C;\`E!+ M`P04````"`!J%%DP(/./-U````!?````%P`5`&-H87)O;B]C;VUM;VXO96YQ M=65U92YD550)``/H"3Q`!^([0%5X!`#H`V0`R\U/*<U)54C.2"S*S]-+SL_- M!5*I>86EJ:6IUEQ<F7DEJ45IB<FI"JX0,8T0385J+LX0A8+\` U-:S"KM#A M(T0A'\I+3<W6`&I3R`/R:P%02P,$%````` `=!E9,-Y6K+[A````QP(``!0` M-B $>6XLF9TDK>-EJ,62<[QU9#U M%6(+XVQH2 _^?'%0B%1R,;$OWNGKTT'!KY03M?=!FK39H ;ZXK)I,U)!!51. M[SSAON0/8(5%UY%Q*$:GF!^MGV6HJBFR*+<F6_3!FFPM;\/7D7X#F!/%2,/D MKVA;!?21NLCV)I;L4F%C_UA<QFV"4MOC:_"H.Z 6:\M^8NHL<]!4/CKU3U!+ M_8!(W"I4T6154&%-_)`25?GWVM 0B*BJ<H!E9X89#YT\V!9A7U=*4KJ77><> M1XL6!>=-UTME;L!*J>HLUC&D48JG`+>5UK#SRZ38P!9>O/K.S0^O >MG^.:, M1K=0$N(7)-Z,EC7%$Q`\W_C/XBX;_+7`Z_]=/VH,.]*HC*S+#U!+`P04```` M"`",%5DP5/CL BX!``!3`P``%0`5`&-H87)O;B]C;VUM;VXO<W1A8VLN9%54 M9!40L*9^J(FJ]-MK Z&`W*KA8-::V=V9D5M^U`U"4>:"4USPMC4_J?*B3H* M,G6^\>/%\3, /"M(H7WM+>T?#CV/N?L,V<:Q*^,&Z:1*QQ2HM*!^CEL!SH>5 MKV4)809\;F$FD_OT_>5L\I6F9F RAT:A2Y7WV\.MW&FU/[*]87UP45=T&F:Z MO.D! G*%K+*/4I F2+8'C0<I596[U\-?((K:2LT"\/`^WCP]`M6=1Z N)Z;X M5E$(^2&,6%K;A)98'K1(M6IX'31_2 D.F2\.#K:PS^I&CU_6M$R"E6"]M<8H M`N'H\4/*^\C-^:*S-8/?3"I7N#R9)JJ7,7K=]$:=0,&86HH)W2":G`)9YM>P MVXW+7#E_^$[UYX S2L=QD4>)U>[^)*L$TY)-(=`DB)WW;F&ON5;<X*Y1?DXQ M``````$```"D 4$```!C:&%R;VXO8V]M;6]N+V%R<F%Y+F155`4``Z(-/$!5 MP`$``&-H87)O;B]C;VUM;VXO96YQ=65U92YD550%``/H"3Q`57 ``%!+`0(7 M=65U92YD550%``-W#CQ M```5``T```````$```"D >0$``!C:&%R;VXO8V]M;6]N+W-T86-K+F155`4` M`0```*2!6 8``&-H87)O;B]C;VUM;VXO=')E92YD550%``/3$CQ`57 ``%!+ 4!08`````!P`'`"D"``"`!P````!M ` end
Feb 24 2004
Hmm... I just attached it normally. But it appears not to have worked. Anyways, you can get it here: http://fortytwo.athensacademy.net/charon.zip Owen In article <c1h9r6$2vd$1 digitaldaemon.com>, larry cowan says...Would like to look at your zip, but I can't seem to get a good decode of it. Did you make it an attachment, or what? Can you attach so it comes as a separate mime-section? In article <c1h4l7$2rl5$1 digitaldaemon.com>, resistor mac.com says...This is the preliminary version of a library I'm working on that I thought might be of interest to some people here. As of right now it's a primitive data structures library drawing loose inspiration from the Java Foundation Classes, and making extensive use of D's generic programming capabilities. Included in this archive are implementations of: Queues, Stacks, and Trees. There are also two supporting classes (Array and Node), and an interface (Enqueue). A Linked list implementation is mostly complete, and Binary Trees will be the next target. I'd like to eventually get this collection up to snuff for inclusion in Phobos or maybe another standard library. Remember, this is a preliminary release. So if it blows up in your face, don't blame me. Owen P.S. If anyone out there who's proficient at the Design by Contract bit would like to take a look at this, that would be awesome. I tried to fill in the appropriate asserts, but I'm not very good at it yet. begin 0644 charon.zip M9`"-4\%N S`,/3M?X=U`E1"[CC%I_\"MJB8&V8 4,`IA6C7Q[TM*&`VE,`Y) M0O/RB0%DQQ/6;ZX( ,%89U.Z$ET0F .(QA2"S0(,=J%>+R+O5)[]T-0A0]II M`H8B5SIP/"+)FT]=89KB8YBL`([QR29I3"[&PS4(*;FA8P3[A*;N-`U^P?BJ M]1[-/_1]&5-GA_L A8%H-(HT3E`\^P4F<CB$;N12N1B5F]WU&C:NP.J/RKZ= MM3"K6J-CYIGKZ0T4[UIJ.A[ZTJ>P)>&S7O="<=VK9 %U2(_+Y3KDJBT2']*E M'__A)WU7]JC?=T]N:KLIF/%X^<SYBT1I7B+/U<:=[SR%>/-OGZ?'#C;\`E!+ M`P04````"`!J%%DP(/./-U````!?````%P`5`&-H87)O;B]C;VUM;VXO96YQ M=65U92YD550)``/H"3Q`!^([0%5X!`#H`V0`R\U/*<U)54C.2"S*S]-+SL_- M!5*I>86EJ:6IUEQ<F7DEJ45IB<FI"JX0,8T0385J+LX0A8+\` U-:S"KM#A M(T0A'\I+3<W6`&I3R`/R:P%02P,$%````` `=!E9,-Y6K+[A````QP(``!0` M-B $>6XLF9TDK>-EJ,62<[QU9#U M%6(+XVQH2 _^?'%0B%1R,;$OWNGKTT'!KY03M?=!FK39H ;ZXK)I,U)!!51. M[SSAON0/8(5%UY%Q*$:GF!^MGV6HJBFR*+<F6_3!FFPM;\/7D7X#F!/%2,/D MKVA;!?21NLCV)I;L4F%C_UA<QFV"4MOC:_"H.Z 6:\M^8NHL<]!4/CKU3U!+ M_8!(W"I4T6154&%-_)`25?GWVM 0B*BJ<H!E9X89#YT\V!9A7U=*4KJ77><> M1XL6!>=-UTME;L!*J>HLUC&D48JG`+>5UK#SRZ38P!9>O/K.S0^O >MG^.:, M1K=0$N(7)-Z,EC7%$Q`\W_C/XBX;_+7`Z_]=/VH,.]*HC*S+#U!+`P04```` M"`",%5DP5/CL BX!``!3`P``%0`5`&-H87)O;B]C;VUM;VXO<W1A8VLN9%54 M9!40L*9^J(FJ]-MK Z&`W*KA8-::V=V9D5M^U`U"4>:"4USPMC4_J?*B3H* M,G6^\>/%\3, /"M(H7WM+>T?#CV/N?L,V<:Q*^,&Z:1*QQ2HM*!^CEL!SH>5 MKV4)809\;F$FD_OT_>5L\I6F9F RAT:A2Y7WV\.MW&FU/[*]87UP45=T&F:Z MO.D! G*%K+*/4I F2+8'C0<I596[U\-?((K:2LT"\/`^WCP]`M6=1Z N)Z;X M5E$(^2&,6%K;A)98'K1(M6IX'31_2 D.F2\.#K:PS^I&CU_6M$R"E6"]M<8H M`N'H\4/*^\C-^:*S-8/?3"I7N#R9)JJ7,7K=]$:=0,&86HH)W2":G`)9YM>P MVXW+7#E_^$[UYX S2L=QD4>)U>[^)*L$TY)-(=`DB)WW;F&ON5;<X*Y1?DXQ M``````$```"D 4$```!C:&%R;VXO8V]M;6]N+V%R<F%Y+F155`4``Z(-/$!5 MP`$``&-H87)O;B]C;VUM;VXO96YQ=65U92YD550%``/H"3Q`57 ``%!+`0(7 M=65U92YD550%``-W#CQ M```5``T```````$```"D >0$``!C:&%R;VXO8V]M;6]N+W-T86-K+F155`4` M`0```*2!6 8``&-H87)O;B]C;VUM;VXO=')E92YD550%``/3$CQ`57 ``%!+ 4!08`````!P`'`"D"``"`!P````!M ` end
Feb 24 2004
it would be cool to have a Ternary Search Tree in the package
Feb 25 2004
That I can work on, but I'm trying to make my binary tree work first. Stupid template problem... Owen In article <c1hlt6$p5j$1 digitaldaemon.com>, Mike Janssen says...it would be cool to have a Ternary Search Tree in the package
Feb 25 2004
resistor mac.com wrote:will be the next target. I'd like to eventually get this collection up to snuff for inclusion in Phobos or maybe another standard library.Cool! You could register it in the Phobos-Project wiki page here so other people could find about your project before trying to reinvent the wheel: http://www.prowiki.org/wiki4d/wiki.cgi?Phobos
Feb 25 2004