HDTenEightyP/NetNews huggingface dataset:
Newsgroups: comp.lang.pascal
Subject: Info requested:  3D Graphics & TP Accessories.
Date: 02 Jan 93  22:29:00 MET

Hello,

a good book to start with is in my opinion the following one:

Marc Berger, Computer Graphics with PASCAL
ISBN 0-8053-0790-7
The Benjamin/Cummings Publishing Company, Inc.
2727 Sand Hill Road
Menlo Park, California 94025
(Price about US $35.00)

The book covers two-dimension graphics and three-dimensional graphics from 
the beginning.

Gerhard Kroemer  
 

 * Origin: @Schiller-Hm.nsn.ni.schule.de <SBOX Hameln> (49:305/4)
Newsgroups: comp.lang.pascal
From: gyl.midroni@rose.com (gyl midroni)
Subject: P 7.0 and qemm6.02
Organization: Rose Media Inc, Toronto, Ontario.
Date: Sun, 3 Jan 1993 15:48:47 GMT
X-Gated-By: Usenet <==> RoseMail Gateway (v1.70)


Date Entered: 01-03-93 10:45
M(> From: msfuller@cc.utah.edu (MARC S. FULLER)
M(> Subject: BP 7.0 and qemm6.02
M(> Does anyone have experience running BP 7.0 while using QEMM? 
Recently I 
M(> received exception errors 12 or 13 while trying to start BP7.0.  I traced it 
M(> down to a noems switch I had put in the qemm statement in the config.sys file.  
M(> I did this to save the 64k expanded memory  base page in upper memory since I
M(> had no need of expanded memory functions.  BP7.0  is a protected mode compiler, 

    I have been using BP 7.0 quite heavily, under QEMM 6.02 and DV 
with NO problems.  I have anoems statement in the config.sys


                Gyl
                gyl.midroni@rose.com
---
   RR 1.60 R001881
   RM 2.00 : RoseNet<=>Usenet Gateway : Rose Media 416-733-2285
From: vanney.raphael@lill.frmug.fr.mugnet.org (Vanney Raphael)
Newsgroups: comp.lang.pascal
Subject: EXAMPLE PROGRAM WANTED
Date: 23 Dec 92 00:31:00 GMT
Reply-To: vanney.raphael@lill.frmug.fr.mugnet.org (Vanney Raphael)
Organization: Li'LL BBS - Paris, France

PDT>Hello all.

PDT>I have to put on a presentation in a few weeks on the different
languages
PDT>available.  I want to show the general format of the language, basic
PDT>commands (I/O, calculations, rem statements, etc).  It would be
quite
PDT>useful to thread a little example together which could be translated
into
PDT>different languages.  If this example was useful, all the better!!!
PDT>Any ideas (or even better - code) much appreciated.

PDT>Paul

If you really want to have some pieces of code here, just ask something
like "whom of you guys is gonna make me the fastest-smallest-securest-
smallest-compiled programm that does..." well, just find an idea of what
a sample program should show...
Contesting is the word out there, I think ! :-))

Alp,                                              Raphael.

 * OLX 2.1 TD * On dirait que mon olmr fonctionne, non ?
--- FMail 0.92
 * Origin: ICEBERG - La Garenne * FRANCE * Tel:(33)-1-47699261 (2:320/1)
                                                               
Newsgroups: comp.lang.pascal,rec.games.programmer,comp.sys.ibm.pc.misc,comp.sys.ibm.pc.programmer
From: dlcox@bilbo.encore.com (David L. Cox)
Subject: Re: Source of a little puzzle under MS-DOS TurboPascal wanted
Organization: Encore Computer Corp.
Date: Wed, 30 Dec 1992 20:01:02 GMT

I saw an example of this on a 3b10 (If I remember right) at the Oklahoma
State Fair.  AT&T had put together an exhibit where they digitized a picture
and scrambled it.  You then used a touch screen to put the picture back together.  (Hey guys, this was 5 years ago!)

How did it solve the puzzle?

They cheated.  They just remembered every move made and reversed it.  If you
have a good enough memory, I guess that is a valid way to do it!  :-)

David
From: foster@nzkites.UUCP (Foster Schucker)
Newsgroups: comp.lang.pascal
Subject: BP7 on CD-ROM
Date: 22 Dec 92 03:26:13 GMT
Organization: Kiteflyers Roost

My personal Borland Pascal sales person called the other day to let me
know that BP7 was out.  I informed him that I had fallen over the box
to answer the phone.  We then discussed the other Borland Products that
I could purchase, the key item was BP7 on CD-ROM.  I ordered it, but
it's out of stock.  Any of you netters have a copy and care to comment?
                 2
I have C on CD (c D ?) :-) and it works pretty good.  When I want to
C I fling the disk in the drive and compile from there.  It saves a 
good 15Mb of disk, I'm hoping for the same thing with the Pascal CD.

BTW, is anyone annoyed by the $15 handle charges by Borland or is it just
me that minds paying $15 to ship a box via UPS for $3?

Thanks!



Foster Schucker  (foster@nzkites.uucp)  (1-215-458-8354 (voice))
Newsgroups: comp.lang.pascal
From: kjell@hertz.e.kth.se (Kjell Rilbe)
Newsgroups: comp.lang.pascal
Subject: Re: Turbo Vision Keys?
Date: 21 Dec 92 12:06:39 GMT
Organization: Dept. of EE, Royal Institute of Technology, Stockholm, Sweden

In article <724675113.AA00819@contrast.wlink.nl> berend@contrast.wlink.nl (Berend de Boer) writes:
>  CUA87 was directed to computer independence. A 3270 should behave like
>your IBM PC. Let's take for example the ENTER and TAB key. When running
>a 3270 emulator on our LAN connected to a CICS mainframe, the TAB moves
>to the next field, ENTER accepts the screen. Just like your TVision
>programs (if you follow standard behaviour).

Now, I just feel I have to comment this. 
(1) Which key is easiest to find of TAB and ENTER?
	Answer: ENTER

(2) Which action is most frequent of 'Next Field' and 'Accept Screen'?
	Answer: 'Next Field'

So why the heck are they not using ENTER for 'Next Field'?????

I just *HATE* when TAB moves to next field and ENTER accepts the stuff
by mistake when you really wanted next field!!!!

I will *NEVER* follow such a stupid standard if I can avoid it!

Just my opinion, you guys don't have to agree!

/Kjell
-- 
------------------------------------------------------------------------
! Kjell Rilbe           !  "There's only one way of life,              !
! kjell@elixir.e.kth.se !   and that's your own!"   ---The Levellers   !
------------------------------------------------------------------------
From: copernicus@digund.uucp (Copernicus) 
Newsgroups: comp.lang.pascal
Subject: Unzipping algorithm wante
Date: 31 Dec 92 15:50:00 GMT
Distribution: world
Organization: Digital Underground - PRIVATE
Reply-To: copernicus@digund.uucp (Copernicus) 

To: coplex!uunet!gatech!destroyer!cs.ubc.ca!mala.bc.ca!oneb!nimcompu

N>Does anyone have an unzipping algorithm that they could send to me?  I would
 >like it in Pascal but C is OK.  Thanks in advance.


Just snag INFO-ZIPs C code for ZIPPING and UNZIPPING .. Its PKZIP 1.10
compatiable and is totally portable accross platforms.

I've taken the code and stripped in down and plugged it into a graphics
program that I have been working on just to make some more buttons to
play with in Turbo Vision (C++ Version).

Available at your favorite monster FTP archive near you.

If you can find it .. Check ARCHIE .

Hope this helps a bit!

Chris Nalley / Copernicus@digund.uucp
---
 . QMPro 1.0 03-1234 . Digital Underground - Linux Support Board - 812-941-9427
           
Newsgroups: comp.lang.pascal
From: leonard@qiclab.scn.rain.com (Leonard Erickson)
Subject: Re: Week numbers
Reply-To: Leonard.Erickson@f51.n105.z1.fidonet.org
Organization: SCN Research/Qic Laboratories of Tigard, Oregon.
Date: Mon, 28 Dec 1992 18:06:51 GMT

patlee@panix.com (Patrick Lee) writes:

>In article <1992Dec15.000536.15663@qiclab.scn.rain.com> Leonard.Erickson@f51.n105.z1.fidonet.org writes:

> > As I say, there's no standard. And since the years is 52 weeks and one
> > day long (two days in leap years), you need to be ready to deal with week
> > 53 occasionally. 

>Funny, did someone crossposted this in comp.std.internat recently?  The
>same question was asked.  According to keld@login.dkuug.dk (Keld J|rn
>Simonsen), the ISO standard on week numbering is 8601.  The standard
>basically says what has been posted already -- that the week containing
>the first Thursday is week number 1.

Well, the outfit I was working for didn't use it...


-- 
Leonard Erickson		      leonard@qiclab.scn.rain.com
CIS: [70465,203]			 70465.203@compuserve.com
FIDO:   1:105/51	 Leonard.Erickson@f51.n105.z1.fidonet.org
(The CIS & Fido addresses are preferred)
Xref: sparky comp.lang.pascal:7797 rec.games.programmer:5238 comp.sys.ibm.pc.misc:16281 comp.sys.ibm.pc.programmer:722
Newsgroups: comp.lang.pascal,rec.games.programmer,comp.sys.ibm.pc.misc,comp.sys.ibm.pc.programmer
Subject: Re: Source of a little puzzle under MS-DOS TurboPascal wanted
From: cscmd@lux.latrobe.edu.au (Mitch Davis)
Date: Sat, 2 Jan 1993 10:06:25 GMT
Organization: La Trobe University

In article <1992Dec30.162530.7112@delos.stgt.sub.org> stefanb@delos.stgt.sub.org (Stefan Bechtold) writes:
>Hi !
>
>A friend of mine is looking for a puzzle; it's a little bit difficult 
>to describe but I'll try it.
>This puzzle shuffles a display like those old 16 square plastic
>puzzles.
>(Like:		9	14	10	4
>		
>		6	1	8	12
>			
>		2	15		5
>		
>		11	7	3	13
>
>and you have to put those squares in the right order)
>
>The program should also be able to solve the problem itself.

First, I should mention that picking Turbo Pascal as a language for
solving this problem is fairly poor.  To do this in a language like LISP
or Scheme is about 100 lines (or at least, that is how big my CS
assignment this year to do it was), while I can't see how you'd do it
in TP would take less than say 600 lines.

Here is one way of tackling the problem:

First, make some way of representing the state of the puzzle.  In Scheme
terms, something like ((9 14 10 4)(6 1 8 12)(2 15 0 5)(11 7 3 13)), or a
4x4 array in TP.

Second, build a function which, given a transformation like "u","d","l"
or "r", it takes a puzzle state and returns the state of the puzzle
AFTER that transformation.

Next, you start with a few lists.  One list contains all the states
visited so far, so it starts off with only one item, the initial state.
Then to solve it, you use recursion to search the tree of possible
transformations until you either find some combination of
transformations which results in the final state, or you are left with
no states after any transform which have not occured before.  In effect,
you'll be applying "u,d,l,r,uu,ud,ul,ur,du,dd,dl,dr,lu,ld,ll,lr,ru,rd,rl,
rr,uuu,uud, etc" to the initial state, and seeing if you get the final
state.  The order of the letters you try gets read off when your
recursion unwinds, and this gives the moves you need.

Note that this is a VERY computationally intensive algorithm if the
solution is non-trivial (it is of the order O(4^n)), and only uses a
simple heuristic - that is, it doesn't search parts of the search tree
that have already been searched.  What it WON'T do is infalibly see
that a simple move would be shorter than a longer set.

Hmm.  Other thoughts:

Take each state in the list in turn:
  Apply in turn, u,d,l and r.
  Put the resultant states in another list.
  Are any of the resultant states the final state?  If so, unravel the
  recursion reading off the moves.
  If not, add the resultant states to the list of ones to search next
  time, unless they already occur, ie, no duplicates.

Having said all that, I think it IS possible to do it in TP (although
not a wise thing to do).  I must admit I am tempted, and if I get around
to doing it, my preferred method to use would be to hijack the
TSortedCollections from Turbo Vision.

Hope this helps.

Mitch.
Newsgroups: comp.lang.pascal
From: dmurdoch@mast.queensu.ca (Duncan Murdoch)
Subject: Re: To truncate or not to truncate. That is the question?
Organization: Queen's University
Date: Thu, 31 Dec 1992 02:51:29 GMT

In article <1992Dec30.210553.9807@ac.dal.ca> asuncion@ac.dal.ca writes:
>
>I tried loading source code into turbo, but turbo said that the code was too
>big to enter the editor buffer and asked me if I wanted to truncate the code.
>What do I do to compile it?

Lots of choices:

 -  The command line compiler TPC has no file size limits.  
 -  TP 6.0 and BP 7.0 have limits that are usually so large they 
don't matter.  
 -  Split your source into units or include files.

Duncan Murdoch
Newsgroups: comp.lang.pascal
From: delusion@casbah.acns.nwu.edu (Albert Schmezer)
Subject: LARGE Sorts and such...
Organization: Northwestern University, Evanston Illinois.
Date: Sun, 3 Jan 1993 22:22:48 GMT

	Hello all, again. I am in the midst of a large programming project,
and have come across an interesting stumbling block. I hope this isn't a FAQ.
If it is, could someone direct me to the source of the answer?

	Anyways, for the question: How does one go about, in TurboPascal,
sorting an array of IMMENSE proportions? What I mean is that I am making a
database-type program, and I have at least 10,000 items in the database. How
can I sort 10,000 items? They won't even fit into an array! If I can't sort
them, how can I at least index them? I really need the ability to sort these
LARGE amounts of information. If it were only 500 or even 1000 entries, it
wouldn't be a problem - I would use a Quicksort or Heapsort routine, but
10,000 or 100,000 presents a grave problem. Is there a way to make use of a
temporary file on the harddrive? How slow is this? How would I even go about
doing this? Can I stick groups of 100 or so into an array and integrate the
sorts? How would I do this?! Is this slow, too?

	Once again, if this is a FAQ, I apologize, and would like to be
referred to the source of the answer of this problem. It is a very important
problem to be solved, though, so I would appreciate any help at all in this.

	Thanx in advance!
<<delusion

Newsgroups: comp.lang.pascal
From: jeffbyrn@mp.cs.niu.edu (Jeff Byrne)
Subject: Calling Local Procedures - Problems
Organization: Northern Illinois University
Date: Mon, 21 Dec 1992 23:36:11 GMT

{   Hi,
  I'm having a problem that I hope someone can help me with.  I want to
  have a method that takes an address to a procedure/function and calls
  that routine with some value.  I have tried this a couple ways and have
  run into problems.  It seems that I am having problems because I want the
  procedure/function to be local to another method.  I don't know enough
  about assembler or the TP calling conventions to write the procedure
  I need.

  I know that it can be done because the ForEach and FirstThat methods in
  TVISION's TGroup object do this.  However, I don't have the source to
  these units and can't seem to figure it out.  I have written a small
  test program below that illustrates the problem and two attempted
  solutions.  The answer is probably a relativly simple assembler routine,
  however, I lack knowledge in that area.  I would appreciate any ideas.
  Thank you, and Happy Holidays.
  - Jeff
  jeffbyrn@mp.cs.niu.edu
  jeff@art.niu.edu  }

Program Problem;

Uses
  Crt;

Type
  PTestObj = ^TestObj;
  LocalMethodType = Procedure (P : PTestObj); { Procedure Type }
  TestObj = Object
    Procedure SetAll (Value : Word; Enable : Boolean);
    Procedure SetOne (Value : Word; Enable : Boolean);
    Procedure ForEach (Proc : LocalMethodType);
    Procedure ForEach2 (Proc : Pointer);
  end;

Var
  Test : TestObj; { Global Variable }

Procedure TestObj.SetAll (Value : Word; Enable : Boolean);
   Procedure SetLocal (P : PTestObj); Far;  { LOCAL PROCEDURE }
   begin    { Doesn't work with variables? }
     P^.SetOne (Value, Enable); { This doesn't send the right values }
     P^.SetOne (123, True);     { This works - But I want to access }
   end;{ Works with literals }  { SetAll's variables }
begin
{  ForEach (SetLocal); } { This way won't work unless SetLocal is not Local }
  ForEach2 (@SetLocal);
end;

Procedure TestObj.SetOne (Value : Word; Enable : Boolean);
begin
  If Enable then
    Writeln ('Value ',Value, ' is Enabled.')
  else
    Writeln ('Value ',Value, ' is Disabled.');
end;

{ This method won't work if Proc is Local to a procedure }
Procedure TestObj.ForEach (Proc : LocalMethodType);
Var
  Count : Integer;
begin
  For Count := 1 to 10 do
    begin
      Proc (@Test);  { These would be different instances of the object }
    end;
end;

Procedure TestObj.ForEach2 (Proc : Pointer);
Var
  P : LocalMethodType absolute Proc; { Cast as Procedure }
  Count : Integer;
begin
  For Count := 1 to 10 do
    begin
      asm
{???}   Push AX { Push somthing because the subroutine eats one word too many }
      end;
      P (@Test);  { These would be different instances of the object }
    end;
end;

begin { Main }
  Clrscr;
  Test.SetAll (123, True);
Newsgroups: comp.lang.pascal
From: graeme@tasman.cc.utas.edu.au (Graeme)
Subject: Cross reference for Think Pascal 4.0 on the Mac.?
Summary: cross reference for macintosh, where can I get one?
Keywords: cross reference, pascal, macintosh
Organization: University of Tasmania, Australia.
Date: Fri, 25 Dec 1992 21:34:09 GMT

Does anyone know where I can get a good cross reference program
to be used with THINK Pascal 4.0 on the Macintosh?

Thanks,
Graeme

--
----------------------------------------------------------
graeme@tasman.cc.utas.edu.au
----------------------------------------------------------

Newsgroups: comp.lang.pascal
From: trodgers@nmsu.edu (Thomas Rodgers)
Subject: Re: Distributing TPUs
Organization: NMSU Computer Science
	<765338d8368876t211@witsend.uucp> <dmurdoch.254.725594757@mast.queensu.ca>
Date: Tue, 29 Dec 1992 16:37:45 GMT

dmurdoch@mast.queensu.ca writes :
> It's a trade-off.  .TPU files contain some optimizations that make
> compiling and linking go much faster than ic could with .OBJ files; 
> these mean upward compatibility is essentially impossible.

Hmmm...Having used Borland's C++ product as well as their pascal
product, I think I would rather put up with slightly slower compile times
to get the ability to use .OBJ files, for several reasons.  Borland's
C++ product is not that slow of a compiler, the biggest slowdown comes
from compiling all of those <.h> files, but you can pre-compile the
headers (not the greatest solution, but it works).  Borland could go a
similar route with the Pascal units.

I would like to see Borland spend less time worrying about how to make
their compiler go faster, fix the bugs in their existing products and
give some attention to generating better quality code (though I
haven't seen BP7 yet, so I can't comment on the quality of its
compiled code and optimizations).

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
trodgers@nmsu.edu     In Real Life ???

                     ---------------------------
    "Bob's" promise is to widen the scope and nature of *abnormal 
behavior*, to explore NEW WAYS of going over the edge *and coming
back*.  PLUS to *bring back those who couldn't on their own*...to
help you create the HIGHEST POSSIBLE EARNINGS from the PSYCHODYNAMICS
of ABNORMALITY...to turn Conspiracy-implanted personality disorders
into an ILLUSION OF CREATIVITY that will *fool normals* and GET YOU
SEX!
--
  Excerpted from an online pamphlet for the Church Of The SubGenius
From: mmigdol@ccwf.cc.utexas.edu (michael a migdol)
Newsgroups: comp.lang.pascal
Subject: Error in TVGdemo5? (Alt-# doesnt work)
Date: 30 Dec 92 18:05:24 GMT
Reply-To: mmigdol@ccwf.cc.utexas.edu (michael a migdol)
Organization: The University of Texas at Austin, Austin TX
Originator: mmigdol@grumpy.cc.utexas.edu

Hello!

     I'm running TP 6.0, and working my way through the TVG demos. In TVGUID04,
where windows are first introduced, alt-# to select window # works fine; 
everything is handled by TApplication.HandleEvent, which then sets the event
to evNothing. However in TVGUID05, in which interiors are introduced, alt-#
doesn't work any more; TApplication.HandleEvent doesn't do anything to it.
Is this a bug some place? Or am I missing something painfully obvious?

Thanks in advance...
-Michael
Newsgroups: comp.lang.pascal
Subject: BP7 DPMI, Reading graphic formats .. PCX etc..
From: woodgate@ccu1.aukuni.ac.nz (Dr S.Woodgate)
Date: Mon, 28 Dec 1992 02:47:09 GMT
Organization: University of Auckland, New Zealand.

Hi there, this is really two questions.
1.  The perennial does anyone have PCX readers out there that
A. CAN read PCX files that expand to > 64K (the pcx.tpu at simtel can't)
B. CAN read 24-bit PCX files ?
- I have also looked at PCX.C at simtel, and PCXFMT.LZH at garbo but these
have no info on 24-bit PCX files.
Assembly source would be preferable ? - but I can translate (must be FAST)
Likewise anyone with GIF decoder that can hook to TP any help would be gratefully
accepted! - (I have the format gif.doc)

2. BP7

A. Using the Turbo Vision editor!
The application I am using is graphics based.  What I am trying to do is go into
text mode - do a Turbo Vision editor and then return (i.e. I perform Init, Run, and Done)
However, upon entering the Turbo Vision editor (direct copy of TVEDIT.PAS) I have 
MEMAVAIL and MAXAVAIL = 185K.  On exit MEMAVAIL and MAXAVAIL are 46K !!! - is it not
cleaning up everything?  
The MAXHEAPSIZE variable seems to be the problem.  BP7 manual contradicts itself
about what this specifies and I think the problem heap is PERMANENTLY reduced by
MAXHEAPSIZE - even when I leave the TVEDIT and return to by graphics application.

As an aside, is there anyway I can redirect the Turbo Vision editor / whole system
to perform its New() procedures in EMS/XMS - I am very short of memory....

B. Using DPMI

Because I am short of memory I have considered DPMI.  My graphics application
uses a third party toolkit (which I have the assembly source for).  It interfaces
to Turbo Pascal thro'
e.g.
    regs.ax := 2
    regs.ds := 3
    regs.es := Seg(FileName);
    regs.si := Ofs(FileName[1]);
    Intr($66,regs)

In DPMI this does not work.  I know it has to do with selectors c.f. physical
addresses (Borland's Language manual could do with MUCH work here).  
Do I need to change how I am calling the TSR routines from pascal, or the
routines themselves ? - If I need to change the assembly language please tell
me HOW to get around changing cs,ds,es - how to use selectors in tasm.

One more final aside - the TSR routines are in a .COM file.  TASM manual says
they must be compiled under TINY.  If I compile under TINY, and then attempt to
use them the system crashes (but if compiled tasm /p (protected mode check) it
gives only two errors).  If I compile under SMALL then it works FINE but with
tasm /p gives 180 errors!!!!!

Sorry if some of this is hard to understand,
" Its never to late to learn but sometimes you learn when its too late "

Dr. S. Woodgate
Chemistry Dept. Auckland University NZ

woodgate@ccu1.aukuni.ac.nz
Newsgroups: comp.lang.pascal
From: ts@uwasa.fi (Timo Salmi)
Subject: Re: large arrays
Organization: University of Vaasa, Finland
Date: Wed, 30 Dec 1992 04:43:41 GMT

Have you already checked the information in the Frequently Asked
Questions:

 118710 Dec 19 18:56 garbo.uwasa.fi:/pc/ts/tsfaq31.zip

"If you do not know how to go about getting this material, users are
welcome to email me for the prerecorded garbo.uwasa.fi instructions
(long, circa 29Kb).  North American users are referred to the Garbo
mirror on wuarchive.wustl.edu.  Australian users are referred to the
archie.au mirror.  For the Asian users there is the NCTUCCCA.edu.tw
mirror.  The mirrors may lag occasionally, or might not have all the
files.  If you do not receive my reply within five days, please ask
your own site's system manager to construct a returnable mail path
for you". 

..................................................................
Prof. Timo Salmi      Co-moderator of comp.archives.msdos.announce
Moderating at garbo.uwasa.fi anonymous FTP archives 128.214.87.1
Faculty of Accounting & Industrial Management; University of Vaasa
Internet: ts@uwasa.fi Bitnet: salmi@finfun   ; SF-65101, Finland
Newsgroups: comp.lang.pascal