| |
PE1PTP > PSBBS 25.06.96 20:50l 71 Lines 2715 Bytes #-10334 (0) @ WW
BID : 34246-PE1PTP
Read: DD6ZJ DC9KU DO3SMK UA6HJQ GUEST
Subj: -=*> Public Source BBS <*=-
Path: DB0AAB<DB0KCP<DB0ZKA<DB0LX<DB0RBS<DB0SEL<DB0ZDF<DB0AIS<DB0NDK<DB0RWI<
PI8JOP<PI8ZAA<PI8GCB
Sent: 960624/1458Z @:PI8GCB.#NH2.NLD.EU #:55068 [Bussum] $:34246-PE1PTP
From: PE1PTP@PI8GCB.#NH2.NLD.EU
To : PSBBS@WW
[¯¯¯ TST HOST v1.42b, Local time: Mon Jun 24 15:42:39 1996 ®®®]
Hello programmers!
Peter SQ6BOT wrote:
>/* All programmers out there, let's write BBS software for packet radio *
> * together - like the Linux project - with sources available to everyone, *
> * who wants to add something new? Please stay tuned and start up your *
> * C-compilers ! */
>
>void main()
> {
> }
Greatgreatgreat... (To all readers: I am in, are *you* ?)
>I have BC++3.1 for DOS (we can write program under Linux, but most sysops
>use DOS for their systems)
good idea.
>Standard C - it would be easier to find more participants for the project.
>The will be config.h file like in JNOS - every sysop would be able
>to compile its own BBS software - depending on his needs.
Hm. That's what I dislike of Linux and JNOS systems, one needs a C compiler
to just run the d* thing. Why not spread the sources, and a complete
compiled version which is configurable by an install program or cfg file?
It would support the use much more. This way a sysop doesn't have to be a
C- "guru".
>> Hashing table maybe?
>Huh? Either I'm unable to translate this or I just don't know what it is...
hihi, no prob. A hashing table system works like this : We take an array of
a certain size (e.g. what's left of memory) and index it like a normal
array. The only difference is the way we generate the index. From the
contents or comment of the mail, we generate a checksum-like number (you
can add the values of the ASCII characters for starters, and mod them with
the size of the table).
We stash the mail on the index generated from it's own contents. This way,
we can search very fast. Simple generate the key for the object to find,
and look at that point in the hashing table. If it isn't there, you haven't
got it. This search takes only *1* cycle. It doesn't get much faster.
The only problem is when 2 messages generate the same key. You have to
write an algorithm to put a linked list in the array or something like
that.
See? we re learning each other allready! (Hope you can help me with my C)
>> Good luck on your exams, Peter !
>
>Why while studying computer science I have to learn quantum physics ?!?
>Results tomorrow at 4 PM.
I have the same problem here, hi. School is a mystery...
>> I hope more people will join this project soon !!!
>
>...and I hope so...
bye!
----------------------------------------
Rolf, Amstelveen jo22ke The Netherlands
ax.25 mail pe1ptp@pi8gcb.#nh2.nld.eu
e-mail pe1ptp@amsat.org /..\
------------------------oOO-(____)-OOo--
Read previous mail | Read next mail
| |
