1  2  3  |   Order by default

Mar 18, 2001, 10:01pm

However whoever made it, it's very nice :-)
-RD
[View Quote]

Mar 26, 2001, 8:23pm

Also you might want to have a basic knowledge of linked lists. Because a
post on such things might be long, I'll include it in my next message, and
don't download it if you don't want.
-RD
[View Quote]

Mar 26, 2001, 8:54pm

This is a multi-part message in MIME format.

------=_NextPart_000_0068_01C0B61C.BB6E9560
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable


-------------------------------------------------------------------------=
-------

GUIDE TO PROGRAMMING =
SIMPLE LINKED LISTS
Copyright =A9 =
2001 by Joshua Trask (Rough Diamond)

-------------------------------------------------------------------------=
-------


1.Source code is in italics
2. I know ' isn't a comment in C, and that // is how you do one line =
comments, and that ' is Visual Basic, but I happen to like =20
'.

Linked lists are a very convenient way of storing data for an undefined =
number of elements, since it allows adding and removing of elements =
without wasting any extra memory. In fact, they are often more efficient =
than several other ways of storing data, since you never need to define =
them to be larger than you need.

Linked lists' key is in pointers. Pointers store the address of =
something else, but do not actually store anything. For example, if you =
do int n; and then do a pointer that equals n, the pointer will not =
store the value of n, but rather the address of n in memory.

Also, some functions that may be useful:

malloc(size) - allocates memory of size bytes, returning a pointer to =
the beginning =20
of the memory if successful, and a null pointer if =
not.

sizeof(type) - has as its value the number of bytes needed to contain a =
value of the
specified type.

free(pointer) - releases a block of memory pointed to by pointer that =
was previously
allocated by a calloc or malloc call.

Just as a quick reference, to make a pointer, do int *nameofpointer, for =
example.

GUIDE TO PROGRAMMING SIMPLE LINKED LISTS

-------------------------------------------------------------------------=
-------
The first step is to make your struct to hold all your information, and =
include a pointer to itself called *next. Here's an example:

struct person_data
{
char name[10];
int phonenumber;
struct person_data *next;
}

This creates a struct called person_data which holds a person's name and =
phone number, as well as a pointer to its own type, person_data. The =
next step is to declare pointers for different uses in the list. An =
example of possibilities would be:

struct person_data *first, *last, *current, *holder;

This allows pointers for storing the first element of the list as well =
as the last (to allow faster movement to the ends), as well as the =
current struct you are getting information from, and a holder to store =
structs for removing them from the list.

Each time you need to add an element to the list, you need to allocate =
memory for it, where it was previously blank. An example of how to do =
this is:

current =3D NULL; 'Make sure we aren't allocating over anything.
current =3D malloc(sizeof(person_data)); 'Make 'current' a copy of =
our struct
last -> next =3D current; 'Connect our new struct to the end of our =
list

This basically adds a blank copy of our struct to the end of the list. =
You might notice that instead of using periods, which is what would =
usually be used in linked lists, I am using "->". This is because, when =
using pointers, periods can sometimes be used wrong and give an error, =
though -> always works when doing this, even when periods are =
appropriate.

If you want to search the list for a certain element, then you can just =
go through from the start to the end, like this:

current =3D first;
while(current -> next !=3D NULL && !stricmp(current -> name, =
search_query)) 'Keeps going until you're on the last or right=20
=
'element.
{
current =3D current -> next;
}
'Also, a check could be added to make sure, if you landed on the last =
element, that it is either the one you are searching
'for or you just got it because you don't want to keep counting forever.

Lastly, if you wanted to remove an element from your list, it could be =
done like this:
holder =3D first;
current =3D first -> next;
while(current -> next !=3D NULL && !stricmp(current -> name, =
search_query))
{
holder =3D holder -> next; 'Holder is needed so that you know =
which element comes before the one you delete
current =3D holder -> next;
}
'You may want to install a check to make sure that it wasn't the first =
or last element of the list
holder -> next =3D current -> next; 'Link over the removed element =
(don't have a break, which results in a crash)
free(current);

------=_NextPart_000_0068_01C0B61C.BB6E9560
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD W3 HTML//EN">
<HTML>
<HEAD>

<META content=3Dtext/html;charset=3Diso-8859-1 =
http-equiv=3DContent-Type>
<META content=3D'"MSHTML 4.72.3110.7"' name=3DGENERATOR>
</HEAD>
<BODY>
<DIV><FONT size=3D2></FONT><FONT color=3D#000000 size=3D2></FONT>
<HR>
</DIV>
<DIV><FONT color=3D#000000=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =

<STRONG><FONT color=3D#000000>GUIDE TO PROGRAMMING SIMPLE LINKED=20
LISTS</FONT></STRONG></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><STRONG><FONT=20
color=3D#000000></FONT></STRONG></FONT><STRONG><FONT=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
</STRONG><EM>Copyright &copy; 2001 by Joshua Trask (Rough=20
Diamond)</EM></FONT></DIV>
<DIV><FONT size=3D2><EM></EM></FONT>
<HR>
</DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2>1.Source code is in =
italics</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT><FONT size=3D2>2. I know ' =
isn't a comment=20
in C, and that // is how you do one line comments, and that ' is Visual =
Basic,=20
but I happen to like&nbsp; </FONT></DIV>
<DIV><FONT size=3D2>&nbsp;&nbsp;&nbsp; '.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>Linked lists are a very convenient way of storing =
data for an=20
undefined number of elements, since it allows adding and removing of =
elements=20
without wasting any extra memory. In fact, they are often more efficient =
than=20
several other ways of storing data, since you never need to define them =
to be=20
larger than you need.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>Linked lists' key is in pointers. Pointers store the =
address=20
of something else, but do not actually store anything. For example, if =
you do=20
<EM>int n;</EM><STRONG> </STRONG>and then do a pointer that equals n, =
the=20
pointer will not store the value of n, but rather the address of n in=20
memory.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>Also, some functions that may be =
useful:</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>malloc(size) - allocates memory of <EM>size</EM> =
bytes,=20
returning a pointer to the beginning&nbsp; </FONT></DIV>
<DIV><FONT=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
of the memory if successful, and a <EM>null </EM>pointer if =
not.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>sizeof(type) - has as its value the number of bytes =
needed to=20
contain a value of the</FONT></DIV>
<DIV><FONT=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
specified type.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>free(pointer) - releases a block of memory pointed =
to by=20
<EM>pointer</EM> that was previously</FONT></DIV>
<DIV><FONT color=3D#000000=20
size=3D2>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=20
allocated by a <EM>calloc </EM>or <EM>malloc</EM> call.</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2>Just as a quick reference, to make a =
pointer, do=20
int *nameofpointer, for example.</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2><STRONG>GUIDE TO PROGRAMMING SIMPLE =
LINKED=20
LISTS</STRONG></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><STRONG>
<HR>
</STRONG>The first step is to make your struct to hold all your =
information, and=20
include a pointer to itself called *next. Here's an =
example:</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>struct =
person_data</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>{</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>&nbsp;&nbsp;&nbsp; char=20
name[10];</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>&nbsp;&nbsp;&nbsp; int=20
phonenumber;</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2>&nbsp;&nbsp;&nbsp; <EM>struct =
person_data=20
*next;</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>}</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM></EM></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2>This creates a struct called =
person_data which=20
holds a person's name and phone number, as well as a pointer to its own =
type,=20
person_data. The next step is to declare pointers for different uses in =
the=20
list. An example of possibilities would be:</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2><EM>struct person_data *first, =
*last, *current,=20
*holder;</EM></FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2><EM></EM></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2>This allows pointers for storing the =
first=20
element of the list as well as the last (to allow faster movement to the =
ends),=20
as well as the current struct you are getting information from, and a =
holder to=20
store structs for removing them from the list.</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT color=3D#000000 size=3D2>Each time you need to add an element =
to the=20
list, you need to allocate memory for it, where it was previously blank. =
An=20
example of how to do this is:</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT>&nbsp;</DIV>
<DIV><EM><FONT size=3D2>current =3D NULL;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
'Make sure=20
we aren't allocating over anything.</FONT></EM></DIV>
<DIV><EM><FONT size=3D2>current =3D =
malloc(sizeof(person_data));&nbsp;&nbsp;&nbsp;=20
'Make 'current' a copy of our struct</FONT></EM></DIV>
<DIV><EM><FONT size=3D2>last -&gt; next =3D current;&nbsp;&nbsp;&nbsp; =
'Connect our=20
new struct to the end of our list</FONT></EM></DIV>
<DIV><EM><FONT size=3D2></FONT></EM>&nbsp;</DIV>
<DIV><FONT size=3D2>This basically adds a blank copy of our struct to =
the end of=20
the list. You might notice that instead of using periods, which is what =
would=20
usually be used in linked lists, I am using &quot;-&gt;&quot;. This is =
because,=20
when using pointers, periods can sometimes be used wrong and give an =
error,=20
though -&gt; always works when doing this, even when periods are=20
appropriate.</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2>If you want to search the list for a certain =
element, then you=20
can just go through from the start to the end, like this:</FONT></DIV>
<DIV><FONT size=3D2></FONT>&nbsp;</DIV>
<DIV><FONT size=3D2><EM>current =3D first;</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>while(current -&gt; next !=3D NULL &amp;&amp;=20
!stricmp(current -&gt; name, search_query)) 'Keeps going until you're on =
the=20
last or right </EM></FONT></DIV>
<DIV><FONT=20
size=3D2><EM>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;=20
'element.</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>{</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>&nbsp;&nbsp;&nbsp; current =3D current -&gt;=20
next;</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>}</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>'Also, a check could be added to make sure, if =
you landed=20
on the last element, that it is either the one you are=20
searching</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>'for or you just got it because you don't want =
to keep=20
counting forever.</EM></FONT></DIV>
<DIV><FONT size=3D2><EM></EM></FONT><EM></EM>&nbsp;</DIV>
<DIV><FONT size=3D2>Lastly, if you wanted to remove an element from your =
list, it=20
could be done like this:<EM></FONT></EM></DIV>
<DIV><EM><FONT size=3D2>holder =3D first;</FONT></EM></DIV>
<DIV><FONT size=3D2><EM></FONT><FONT size=3D2>current =3D first -&gt;=20
next;</FONT></EM></DIV>
<DIV><FONT size=3D2><EM>while(current -&gt; next !=3D NULL &amp;&amp;=20
!stricmp(current -&gt; name, search_query))</FONT></EM></DIV>
<DIV><FONT size=3D2><EM>{</FONT></EM></DIV>
<DIV><FONT size=3D2><EM>&nbsp;&nbsp;&nbsp; holder =3D holder -&gt;=20
next;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 'Holder is needed so =
that you=20
know which element comes before the one you delete</FONT></EM></DIV>
<DIV><FONT size=3D2><EM>&nbsp;&nbsp;&nbsp; current =3D holder -&gt;=20
next;</FONT></EM></DIV>
<DIV><FONT size=3D2><EM>}</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>'You may want to install a check to make sure =
that it=20
wasn't the first or last element of the list</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>holder -&gt; next =3D current -&gt; =
next;&nbsp;&nbsp;&nbsp;=20
'Link over the removed element (don't have a break, which results in a=20
crash)</EM></FONT></DIV>
<DIV><FONT size=3D2><EM>free(current);</EM></FONT></DIV></BODY></HTML>

------=_NextPart_000_0068_01C0B61C.BB6E9560--

Mar 27, 2001, 8:37pm

thanks :-)

[View Quote]

Mar 29, 2001, 10:23pm

It's more convenient to know C then C++ in case you ever may need it (I
wound up programming Nintendo Game Boy, sooner or later)
-RD
[View Quote]

Mar 28, 2001, 8:51pm

Something that applies to everyone... File transfer rarely works with
firewall/proxy, would it be ok to join to test that?
-RD
[View Quote]

Mar 29, 2001, 8:15pm

I can make you a fairly complicated bot for a fairly small fee...
-RD
[View Quote]

Apr 6, 2001, 8:17pm

Mak, no offense, because we all love new, promising bot programmers, but
bots can, for the most part, only be released once and be big, so let
someone else come out with a Slot Bot first that can do a lot, please :-)
-RD
[View Quote]

Apr 7, 2001, 3:01pm

I never said he couldn't. I'm saying that bots can have one impact on the
community, so if someone made an exact copy of CyPac except 1,000x better,
it still wouldn't have as much impact. So all I'm saying is that if you just
want to do things to toy around and learn then let someone who wants to make
it for the impact make it.

Let me make my recommendations like we all have. If I want to talk to new
programmers about "impact", then let me do it for Heaven's sake !!

-RD

[View Quote]

Apr 8, 2001, 9:55am

Yeah, same here... Oh, and on my previous post, sorry. I'm not going to say
I didn't mean it, because there was something that I meant to say in there,
but that was definatelly not how I meant to say it (School's been
frustrating lately) so I'm sorry, and I hope you'll accept my apology.
-RD
[View Quote]

Apr 8, 2001, 9:59am

XelaG - Although that speech didn't appear to have anything to contradict
what I said, I still loved it, and would like to thank you for it :-)
-RD
[View Quote]

Apr 11, 2001, 7:30pm

Thank you, I was about to say that :-)
-RD

[View Quote]

Apr 14, 2001, 9:04am

Which bot are you using, or did you program them?
-RD
[View Quote]

Apr 15, 2001, 10:27pm

This is a multi-part message in MIME format.

------=_NextPart_000_00C0_01C0C5E9.1E6A2AE0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

On the topic of C++ programming (and not to say don't go to MicroB, my =
understanding is that it's a fine place), when I'm available I can do =
private C/++ lessons...
-RD
[View Quote] -God Zedle (306364)=20

Greg Gage=20
CEO & Chairman=20
MicroB=20
=20


------=_NextPart_000_00C0_01C0C5E9.1E6A2AE0
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD W3 HTML//EN">
<HTML>
<HEAD>

<META content=3Dtext/html;charset=3Diso-8859-1 =
http-equiv=3DContent-Type><!doctype html public "-//w3c//dtd html 4.0 =
transitional//en">
<META content=3D'"MSHTML 4.72.3110.7"' name=3DGENERATOR>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV><FONT color=3D#000000 size=3D2>On the topic of C++ programming (and =
not to say=20
don't go to MicroB, my understanding is that it's a fine place), when =
I'm=20
available I can do private C/++ lessons...</FONT></DIV>
<DIV><FONT color=3D#000000 size=3D2></FONT><FONT =
size=3D2>-RD</FONT></DIV>
[View Quote] ------=_NextPart_000_00C0_01C0C5E9.1E6A2AE0--

Apr 22, 2001, 7:31pm

I told you I'd teach it and I ment it....
-RD
[View Quote]

May 1, 2001, 9:06pm

C/++ is, as the letter states, "complex", "crazy", and so on. This is
actually not true... C just comes because it came after B. However, it has
been known to be pretty hard. It isn't that hard, but you do need to get the
swing of it, so to speak. I'd say *all* the other languages are easier, but
C/++ is MUCH more capable, much more powerful, and will help you if you ever
seriously go into the field of programming. Also, I often give free
beginner-level C/++ lessons if you'd like them...
-RD
[View Quote]

May 2, 2001, 10:43pm

You've got a point, though by "I'd say *all* the other languages are easier"
I meant Delphi/VB/Java/Didn't-they-try-one-for-perl?
-RD :-)
[View Quote]

May 4, 2001, 5:44pm

I wouldn't say dying, but I'd say I work on an honest profit :-)
-RD
[View Quote]

May 30, 2001, 6:49pm

[View Quote] <<<What if the object went on a slant? Then people would be "flying" just by
climbing up/down it. The bot would need to actually download(!) the objects
in the survey>>>

Jul 13, 2001, 8:52pm

Well, I finally got around to fixing the motherboard problem that's been
keeping me off-line since May, I doubt anyone noticed I was gone but I'm
back :-)
-Rough Diamond

Jul 16, 2001, 11:00am

eh, i dunno, i intentionally forgot all about my problem except how to fix
it: that way it'll take a couple months before i can fix it next time it
breaks :-) actually, its the standard kind but i don't remember it's name
-RD
[View Quote]

Jul 17, 2001, 1:08am

yeah, that's the one
[View Quote]

Mar 28, 2001, 8:51pm

Something that applies to everyone... File transfer rarely works with
firewall/proxy, would it be ok to join to test that?
-RD
[View Quote]

Mar 29, 2001, 8:21pm

Again, will program for $, contact me with more details,
joshua_trask at capecod.com, also for help with a world, my artificially
intelligent world caretaker will be out soon so if you want to take a look
at that it should be pretty awesome :-)
-RD
[View Quote]

Apr 6, 2001, 8:20pm

J B E L L isn't a jerk, and if there is anything called "Concept Toolz" then
that is a renamed clone, because I know Concept's original thing and that is
NOT what it was called (Most recent is Concept's AW Tools GOLD) so... at
least know what you're doing :P :-)
-RD
[View Quote]

Apr 20, 2001, 9:37pm

Really? I heard that there was a special build command that, if used, anyone
in the area running 3.1 would crash. Strangely enough, if I try to update my
browser, I crash :-/
-RD
[View Quote]

Apr 20, 2001, 10:05am

I know some of you have been hearing about a new game completely different
and better from the first out of hQuests, and I'd like to tell you that the
bot has been programmed and is now entering its Beta/Debugging phase, and
will be ready in approximately one week :-)
-RD, hQuests

Apr 20, 2001, 10:34pm

As a couple of telegrams I just sent out stated...
"Most recent update on the new hQuests bot: 102 errors, 34 warnings. Expect
to be able to play in approximately a week!"
Um, I'm also serious, I'm sure half these errors are cascades (errors based
on other errors based on other errors that are fixed by debugging a single
error).... and even so, it won't take too long to debug, I don't think, so
you can all expect to be able to play in, as I said, approximately one week
:-)
-RD

Apr 20, 2001, 10:51pm

Note: 32 warnings come from gd, the graphics library I'm using for a cool
feature, so from now on, my messages will not include these warnings :-)
-RD
[View Quote]

Apr 20, 2001, 11:02pm

Though this seems unusual... jumping from 99 to 5 errors to ME implies that
I commented maybe 100-500 lines of code, but you never know...
-RD
[View Quote]

1  2  3  |   Order by default