
                  OS/2 Programming                 (Fidonet)

                 Saturday, 18-Sep-1999 to Friday, 24-Sep-1999

+----------------------------------------------------------------------------+

From: Ian Moote                                         18-Sep-99 14:04:00
  To: MIKE RUSKAI                                       18-Sep-99 21:50:00
Subj: Maximum threads.

MR> No, there's no set limit per process.  The only limitation is the
MR> per-process address space.

Oh; okay. So that test that Vitus was refering to topped out at 1500 
because of the per-process address space available to that particular 
program.


MR> The larger the thread stack, the less threads you can start. If
MR> you're going to use that many threads in a process, getting near the
MR> process address space limit [...] it's important to check all memory
MR> allocations, so you don't end up crashing your program.

It's a distinct possibility. I've gotten some time and have been reading 
a little more on the topic. I'm still not certain how I'm going to 
attack the project. Nothing's carved in stone yet.

Thanks again. Take care and TTYL.

---
  This tagline soon to be a major motion picture.                        

--- AdeptXBBS v1.11y (FREEWare/2)
 * Origin: Moote Pointe (1:2424/224.211)

+----------------------------------------------------------------------------+

From: David Noon                                        19-Sep-99 00:00:01
  To: Mark Lewis                                        19-Sep-99 00:00:01
Subj: Did you get a Netmail?

Hi Mark,

I sent you a netmail a couple of months ago regarding this echo and its
e-list entry. I have not received a response so I suspect netmail is broken.
[What's new there?]

Can you please reply to dwnoon@ibm.net?

Regards

Dave
<Team PL/I>
___
 * MR/2 2.25 #353 * Get the facts first. You can distort them later.

--- Maximus/2 2.02
 * Origin: OS/2 Shareware BBS, telnet://bbs.os2bbs.com (1:109/347)


+----------------------------------------------------------------------------+

From: Tom Torfs                                         19-Sep-99 22:29:00
  To: Sean Dennis                                       20-Sep-99 07:46:04
Subj: ... Perl

Sean Dennis wrote in a message to David Van Hoose:

 SD> ROT13 is a simple 'encryption' code (think of the 'Simple Caesar')
 SD> that people use in USENET to prevent joke punchlines and tv show
 SD> plot spoilers from being read until you're ready.  GoldEd also
 SD> supports this, but it's not encouraged to use this in FidoNet.
 SD> It's extremely easy to write a program that does the same thing. 

Anyhow, just in case:

/* Rot13 filter */

#include <stdio.h>
int main(void)
{
   int c,i;

   while ((c=fgetc(stdin))!=EOF)
   {
      if (c>='a' && c<='z')
         c = (((c-'a')+13)%26)+'a';
      else if (c>='A' && c<='Z')
         c = (((c-'A')+13)%26)+'A';
      fputc(c,stdout);
   }

   return 0;
}

greetings,
Tom
tomtorfs@village.uunet.be

--- timEd/2 1.10.y2k+
 * Origin: 80X86 BBS 32-15-24.62.32 V.34/V.FC (24h/24h) (2:292/516)
724/10

+----------------------------------------------------------------------------+

From: Tom Torfs                                         19-Sep-99 22:30:00
  To: Sean Dennis                                       20-Sep-99 07:46:04
Subj: ... Perl

Tom Torfs wrote in a message to Sean Dennis:

 TT>       if (c>='a' && c<='z')
 TT>          c = (((c-'a')+13)%26)+'a';
 TT>       else if (c>='A' && c<='Z')
 TT>          c = (((c-'A')+13)%26)+'A';

This assumes contiguous letters of course. Extension to non-contiguous is
fairly obvious (but probably unnecessary for most systems running OS/2).

greetings,
Tom
tomtorfs@village.uunet.be

--- timEd/2 1.10.y2k+
 * Origin: 80X86 BBS 32-15-24.62.32 V.34/V.FC (24h/24h) (2:292/516)
724/10

+----------------------------------------------------------------------------+

From: Sean Dennis                                       21-Sep-99 12:04:20
  To: Tom Torfs                                         22-Sep-99 09:33:02
Subj: ... Perl

Hello Tom.

19 Sep 99 22:30, you wrote to me:

 TT>       if (c>> ='a' && c<='z')
 TT>>          c = (((c-'a')+13)%26)+'a';
 TT>>       else if (c>='A' && c<='Z')
 TT>>          c = (((c-'A')+13)%26)+'A';

 TT> This assumes contiguous letters of course. Extension to non-contiguous
 TT> is fairly obvious (but probably unnecessary for most systems running
 TT> OS/2).

Thanks for that... I'm wanting to learn C and now I have something to look at. 
;)

Later,
Sean

... "A cross upon her bedroom wall/From grace she will fall" -- Type O
Negative
--- AfterHours/2 and GoldED/2 : Enjoying the silence.
 * Origin: a..f..t..e..r..h..o..u..r..s..2..b..b..s (1:395/610)

+----------------------------------------------------------------------------+

+============================================================================+
