HDTenEightyP/NetNews huggingface dataset:
From: crw3551@hertz.njit.edu (Christopher R. Wingert  AI)
Newsgroups: comp.lang.pascal
Subject: BrandExe
Date: 27 Jan 93 20:37:59 GMT
Organization: New Jersey Institute of Technology, Newark, N.J.

Timo,
 I saw your BrandExe procedure in your units and I was wondering how
you found out the offset of the constant within the .exe file?  Thanks
 
                                        Regards,
                                                Christopher
 
 
 
Newsgroups: comp.lang.pascal
From: sjsobol@wariat.org (Steven J. Sobol)
Subject: Re: Getting in touch with Borland
Organization: APK Public Access
X-Newsreader: TIN [version 1.1 PL7]
Distribution: na
Date: Sat, 23 Jan 1993 13:50:55 GMT

sixx@matt.ksu.ksu.edu wrote:
: Is there some way, via email, that I can get in touch with Borland?
: Thanks,

Borland is on the net.. I have talked with one or two people from that
company.

Last I checked the only email address open to outsiders was bugs@borland.com
for bug reports. The story then was that they had just started with e-mail and
were not able to offer tech support through e-mail at that time.

There are two people I know of that are around Usenet... one is Richard
Nelson, who is a technical writer, and the other one is Wayne Davison (I
don't know what his title is, but he wrote TRN). One of them might be able
to answer this question. Richard, are you reading this?

 
-- 
*** **  ** The Tiny Software Co.   Steve Sobol, President   sjsobol@tiny.com
 * *   *           23707 Glenhill Drive    Cleveland, OH 44122    USA
 *  *  *   Cleveland OH  216 691-1169    Home of  Top-Quality  Shareware  And
 *   * *   Columbus OH   614 793-1835    KNOWLEDGE IS POWER Training Seminars
 * **   ** Freenet: ag510@po.cwru.edu      FINGER me at: sjsobol@wariat.org
From: kabreuer@cip.informatik.uni-erlangen.de (Klaus Breuer)
Newsgroups: comp.lang.pascal
Subject: Re: Q about DPMI + 64K limit
Date: Tue, 26 Jan 1993 14:01:01 GMT
Organization: Student Pool, CSD, University of Erlangen, Germany
NNTP-Posting-Host: faui09.informatik.uni-erlangen.de

jo@rrz.de (Jochen Magnus) writes:
>Darcy Boese writes
>> I know that in BP6 you are limited to 64K for your data structures, but
>> what about using BP7 in DPMI mode?  I need to be able to create an 800K
>> 7-dimensional array (in high memory)...
>> 
>> Since I don't have BP7 yet, what would be involved in doing this? 

>Hi,

>Data-Structures in BP7 are unfortunately limited to 64K. But there can be  
>blocks with this size. The only hint: Use lists instead of arrays if possible.

Try using an array of pointer. That way the data structure itself
takes up very little RAM, with the data residing somewhere in high RAM
(perhaps with the aid of on of the EMS utilities).

Ciao,
Klaus
---
Klaus Breuer, Rudelsweiher Str. 6b, 8520 Erlangen, Germany
** "Geez, I need a _reason_ for everything?" --Calvin 
** "Should I or shouldn't I? -- Too late, I did!" --Hobbes
Date: Wednesday, 20 January 1993 21:58:52 MST
X-Mailer: TMail version 1.16R
From: "D. C. Sessions" <dcs@witsend.tnet.com>
Organization: Nobody but me -- really
Subject: Re: TEXT File Question
Newsgroups: comp.lang.pascal
Distribution: world

In <1jh4ksINN86m@usenet.INS.CWRU.Edu>, jeb2@po.CWRU.Edu (Jared E. Bendis)  wrote:
# Anyway, I have been developing an image format for work and it is coming
# along but to be more efficeint I wanted to store byte of hex data and not
# char nd convert them, BUT the file buffer command only seemed to work
# on TEXT files (makes sense considering it was the settextbuffer commnd)
# Is the fastest way of accesssing Hard drive data uses text files or converting
# or am I missing something.

  Check out the various Streams objects.  They do untyped I/O
  in a much cleaner way than the untyped files.

--- D. C. Sessions                            Speaking for myself ---
--- Note new network address:                dcs@witsend.tnet.com ---
--- Author (and everything else!) of TMail  (DOS mail/news shell) ---
From: tdarcos@access.digex.com (Paul Robinson)
Newsgroups: comp.lang.pascal
Subject: [TDR] VAX Pascal Dispose
Date: 27 Jan 93 16:39:15 GMT


 F>I have a question about how can I prove or disprove that the 
  >DISPOSE procedure in Vax Pascal does really return the storage 
  >space pointed to by the parameter of the dispose procedure to 
  >the system's free space so that it can be reused.
 
 F>All Comments welcome,

To do this you need to be able to "see" a pointer which you can't do
because the compiler usually won't let you look at them directly, like
this:

PROGRAM DUMPPTR(OUTPUT);
TYPE 
     ILP = ^IL;
     IL = RECORD
            DValue : Integer;
            PREV,NEXT: ILP;
          END;       
    (* 1 *)      

VAR
     V1,V2,V3: ILP;
    (* 2 *)

begin
    new(V1);
    writeln(v1);
    new(v2);
    writeln(V2);   (* 3 *)
    dispose(V2);
    new(v3);
    writeln(V3);    (* The second two output lines *)
                    (* should be identical *)
end.

This won't work because you can't write a pointer out (most Pascals won't
allow it, anyway).  So you have to fool the compiler, by inserting code at
points 1,2 and 3.  So we have the following:

PROGRAM ImprovedDump(OUTPUT);

TYPE  
     ILP = ^IL;
     IL = RECORD
            DValue : Integer;
            PREV,NEXT: ILP;
          END;
      SW = RECORD
              CASE boolean OF
                 true: (P: ILP);
                false: (I: INTEGER);
           END;

VAR
     V1,V2,V3: ILP;
     T: SW;

BEGIN
        new(V1);
        T.P := V1;
        WRITELN(T.I);
        new(v2);
        T.P := V2;
        WRITELN(T.I);
        dispose(v2);
        new(v3);
        T.P := V3;
        WRITELN(T.I);  (* The second two output lines should be *)
                       (* identical *)
 end.

The construct SW and the T variable are sometimes called "pornographic"
memory access because this is something Pascal provides that usually only
C programmers can have: access to any memory anywhere.  By simply
assigning an integer value to T.I and reading it with, say, T.P, it is
possible to examine any location in memory.  This is a "kluge" to fool the
compiler which doesn't know what we are trying to accomplish.
From: lfosdal@falcon.no (Lars Fosdal)
Newsgroups: comp.lang.pascal
Subject: Streams mixed with Files - FileMode problems
Date: Fri, 22 Jan 93 14:01:09 MET
Organization: Falcon Information Services AS, Oslo, Norway

Problem: Streams mixed with files in BP7.0 (under Windows).

The app uses several external files (data/indexes, etc.), of which some 
are binary files, and others are streams.

Scenario:
My app first stores some data on a stream (TBufStream, mode stCreate).
If I then try to open another file with assign/reset/blockread, using
filemode ReadOnly + DenyNone, I get a "can't open for output" error 
message.  If I retry, it works (!), ie the file is opened for read.

Pseudocode:

VAR
  Stream : TBufStream;
  Data   : MyData;
  fil    : File;
BEGIN
  Stream.Init(stCreate);
  Data.Store(Stream);
  Stream.Done;

  oldmode:=filemode;
  filemode:=ReadOnly + denyNone;     {$40}
Retry:  
 Assign(File
  Reset(Fil,1);      -> Gives File not open for output (RTE:105)
  	                the first time
  IF (IOresult<>0)
  THEN Retry
  .
  :
  filemode:=oldmode;
    
Clues, anyone ?

Lars F.
--
/ Mr.Lars Fosdal, Software Developer, Financial Analysis Systems  /
/ Falcon Information Services AS, Stranden 1, N-0250 Oslo, Norway /
/ E-mail:lfosdal@falcon.no  Tel:(47-2) 831310  Fax:(47-2) 831290  /
-- All opinions are personal and does not reflect company policy --
Newsgroups: comp.lang.pascal
From: favre@medsun.unige.ch (Eric Favre)
Subject: Borland Pascal 7.0 upgrade price
Organization: University of Geneva	
Date: Tue, 26 Jan 1993 16:56:09 GMT

Hello,

I am the happy owner of a Turbo Pascal 5.0 version but I would
like to upgrade to Borland Pascal with Objects 7.0.
Do you know what is the upgrade price (list price or street price)?
Thank you.

		Eric Favre


Eric Favre, favre@medsun.unige.ch
University of Geneva
Voice   : ++41.22.70.253.56
Fax     : ++41.22.347.33.34
Address :
  C.M.U.
  Department of Physiology
  1, rue Michel-Servet
  CH - 1211 Geneva 4
  (Switzerland)
From: elliss@unixg.ubc.ca (Stefan Ellis)
Newsgroups: comp.lang.pascal
Subject: Re: URGENT HELP NEEDED ON RESOURCE WORKSHOP (TPW 1.5)
Date: 27 Jan 1993 18:05:41 GMT
Organization: University of British Columbia, Vancouver, B.C., Canada
NNTP-Posting-Host: unixg.ubc.ca

>: In article <930127030733_75230.1437_DHE59-1@CompuServe.COM> 75230.1437@CompuServe.COM (I.I.S.) writes:
>: >From: 75230.1437@CompuServe.COM (I.I.S.)
>: >Subject: URGENT HELP NEEDED ON RESOURCE WORKSHOP (TPW 1.5)
>: >Date: 26 Jan 1993 22:14:36 -0600
>: >A very weird problem: my TPW 1.5 application will run only if the
>: >Resource Workshop is running. If not, whenever I start the application,
>: >I get an error: "error code = -1". 

Solution: Include "BWCC" in the "USES" list.  This will allow your app to
access the BWCC.DLL file (which you should distribute with your app).

Stefan Ellis
Faculty of Education, University of British Columbia
Vancouver, Canada
E-Mail: ELLISS@UNIXG.UBC.CA
From: HRU003@DJUKFA11.BITNET
Newsgroups: comp.lang.pascal
Subject: TurboPower - Address and Products ?
Date: 26 Jan 93 09:02:05 GMT
Organization: Forschungszentrum Juelich

Hi,
could anyone please be so kind to post the address of TurboPower?
BTW, maybe this person could drop one or two words on their products
too (name, price, description, rating) :-)

Thanks a lot,
Jens           (Bitnet  : hru003@djukfa11,
                Internet: jens.pirnay@rphs1.physik.uni-regensburg.de
                Fido    : Jens Pirnay 2:246/124.5 )
 Internet: jens.pirnay@rphs1.physik
From: lfosdal@falcon.no (Lars Fosdal)
Newsgroups: comp.lang.pascal
Subject: Re: TPU 5.5 -> 6.0 translator needed
Date: 28 Jan 93 08:28:00 GMT
Organization: Falcon Information Services AS, Oslo, Norway

avl0@cine88.cineca.it writes:

> Is there anyone knowing if there is a TPU translator from version 5.5 to 6.0.
> I need to use a TPU compiled under TurboPASCAL 5.5 
> but I have the version 6.0.

There is not, and will not be any such translator.  It is techically 
impossible, due to the major differences between TP55 and TP6
(Different heap handling, and more).
  
> Another solution could be a decompiler:
> a tool to come back to the source having just a TPU.

There is not, and will not be any such decompiler. It is technically
impossible, if you don't have the source for the compiler (even then it
would be extremely difficult).


The only solution for your problem is to recompile the original source 
for the matrix unit with TP6 (or you going back to use TP55).

Sorry to disappoint you, but this are the hard facts.

(There was a unit translator from version 4.0 to version 5.0,
but it didn't work on all units, and the differences between 4.0 and
5.0 was minor, if my memory serves me right)

Lars F.
--
/ Mr.Lars Fosdal              / Falcon AS            / lfosdal@falcon.no  /
/ Software Developer          / Stranden 1           / Tel. +47 22831310  /
/ Financial Analysis Systems  / N-0250 OSLO, Norway  / Fax. +47 22831290  /
----=* All opinions are personal and does not reflect company policy *=----
Newsgroups: comp.lang.apl
From: bathurst@phoenix.Princeton.EDU (Bruce Bathurst)
Subject: Re: Weaning  myself from Matlab: is APL a viable alternative for scientific programming and signal processing?
Originator: news@nimaster
Organization: Princeton University
Date: Wed, 20 Jan 1993 16:00:00 GMT

In article <WEG.93Jan19140548@mace.cc.purdue.edu>
weg@mace.cc.purdue.edu (Eythan Weg) writes:

>Can someone try to build a linear algebra (for example) version of J?

The one aspect of APL (or J) that I haven't seen mentioned in this
thread is its flexibility.  If one is dealing with a limited class of
problems, such as those described with linear algebra or linguistic
rules, there is often a language designed for those problems.  APL is
a language designed to describe more general algorithms.

Conventional mathematical notation beautifully describes algebraic and
geometric structures, and the application of logic to them; but the
notation does not uniquely describe algorithms for constructing these
objects from numbers or truth values (T or F).  (Notice the large
number of algorithms published on constructing the inner product of
two vectors.)  APL notation describes algorithms "uniquely", in terms
of operations for which numerically stable algorithms are well known.

I use APL in two ways.  When I work on new mathematical solutions to
problems in my field (metamorphic petrology), I don't know where the
mathematics will lead.  APL is then not just the language of choice;
it's the only language I can use.  (The APL can not only follow the
mathematics, the APL notation sometimes suggests the next step to
take.)

My second use of APL is to write what B. Kernighan has called "little
languages", languages designed to express and solve a limited class of
problems.  Here efficiency becomes an issue; so after writing the
prototype in APL, I sometimes replace the slower lines or functions
with links to compiled routines from NetLib.  

One way to write a "linear algebra" APL for real numbers would be to
replace the QR matrix operation with an SVD.  Easier, however, would
be to write this as a little language.  Choose a set of matrix
factorizations, and write these as (closed) functions in a workspace,
linked to compiled Fortran code.

IMO, J has not discarded the one feature impeding APL's popularity:
its intimate link with an interpretive environment from the 1960's.
APL might be seen in a better light if it were far more closely
connected to each computer's native operating system, the was AWK is
connected to UNIX and C.  (The code itself would still be portable.)

Bruce (Gypsy Scholar)
-- 
Department of Geological and Geophysical Sciences
Princeton University, Princeton, NJ 08544
bathurst@phoenix.princeton.edu bathurst@pucc.bitnet !princeton!phoenix!bathurst
Newsgroups: comp.lang.apl
From: 6035230@LMSC5.IS.LMSC.LOCKHEED.COM (Charles Schulz)
Subject: Re: J is NOT APL (was Re: Interpreter advice sought.)
Organization: Lockheed Missiles & Space Company, Inc.
Date: Mon, 25 Jan 93 13:35:53 PST

---------------------------------Original article------------------------
Newsgroups: comp.lang.apl
 csd.unb.ca!torn!cs.utexas.edu!uwm.edu!caen!uunet!mcsun!sunic!news.lth.se!kurt
From: kurt@dna.lth.se (Kurt Swanson)
Subject: J is NOT APL (was Re: Interpreter advice sought.)
Organization: Lund Institute of Technology, Sweden
Date: Sat, 23 Jan 1993 10:05:53 GMT


kurt@dna.lth.se (Kurt Swanson)  [That's me] writes:
>Is there any "free" apl *interpreter* available for UNIX and/or MAC's???
                     ===

Many have written to me tell me about the wonders of J. ...

END -----------------------------Original article------------------------

Free or nominal fee commerical-grade APLs seem to be just for the PC; see
the FAQ recently published here.  Don't know of any free or low-cost ones
for UNIX (one reason may be which UNIX?).

There was a Mac version, APL90, which may still be around.  Contact:
Jean Jacques Girardot, Computer Science Dept., School of Mines, France,
girardot@emse.fr.  But I think this was mostly experimental.

MicroAPL in London has two Mac APLs, the basic one is quite low-priced,
but >$100 I think.

/Charles A. Schulz
Lockheed Missiles & Space Co., Inc.
Sunnyvale, California  94088-3504
E-mail:  cschulz@lmsc.lockheed.com
Newsgroups: comp.lang.apl
From: abalje47@ursa.calvin.edu (Alan Baljeu)
Subject: $: (self-reference) difficulties
Keywords: J
Organization: Calvin College
Date: Mon, 25 Jan 1993 01:32:23 GMT

J6   Copyright (c) 1990-1992, Iverson Software Inc.  All Rights Reserved.

	NB. The following four lines were copied (cut and paste) from
	NB. tut19.js which I got at watserv1.waterloo.edu from the file
	NB. /languages/apl/j/tutorial.tar.  It was placed there in March,
	NB. while the executable arrived in October '92

   a=. '$.=. 2-0=y.' ; '1'
   b=. 'y. * $: y.-1'
   factorial=. (a,<b) : ''
   factorial 5
limit error
[2] y. * $: y.-1
	NB. The above is my problem
   factorial
+------------+-++
|$.=. 2-0=y. |:||
|1           | ||
|y. * $: y.-1| ||
+------------+-++
	NB. A simplified example:
   b =. '$:0'
   test =. (a,<b) : ''
   test
+-----------+-++
|$.=. 2-0=y.|:||
|1          | ||
|$:0        | ||
+-----------+-++
   test 2
limit error
[2] $:0        
   NB. okay, so what's wrong with $: ?  
--
			Alan Baljeu
This signature is.
Newsgroups: comp.lang.apl
From: qmdbms@gsusgi2.gsu.edu (Brian Schott)
Subject: Surrogate arguments in J 3.0
Organization: Georgia State University
Date: Fri, 22 Jan 1993 11:56:00 GMT


I have been reading Alexei Skurihin's article "Neural networks in J" from
the Russian APL92 Conference.  His code does NOT contain the surrogate
arguments x. and y. presumably because early versions of J accomplished
this differently: How?


-- 
Brian Schott/Decision Sciences Dept.             qmdbms@gsusgi2.gsu.edu
College of Business Administration                         404-651-4070
Georgia State University                  interests: approx. reasoning,
Atlanta, Georgia USA 30303-3083     (B=)       decision support systems
Newsgroups: comp.lang.apl
From: emclean@sfsuvax1.sfsu.edu (Emmett McLean)
Subject: Re: Selective assignment (was Re: J is NOT APL)
Organization: San Francisco State University
Date: Wed, 27 Jan 1993 09:40:37 GMT

NB. In article 1993Jan26.184600.24394@csi.jpl.nasa.gov sam@csi.jpl.nasa.gov (Sam Sirlin) writes:
NB. .... Though I do think ammend is much more confusing
NB. than the old standard, reliable, selective assignment, this descision
NB. had nothing to do with the character set.
NB. 
NB.  I agree with this.
NB. 
NB. .... There's even lots
NB. of new ideas and functionality. The only thing that I still find
NB. missing is selective assignment...
NB. 
NB.    Not sure what Sam means by missing but here is a nice verb
NB.    implementing selective assignment.  New Jer's might enjoy looking
NB.    at it.  Perhaps this will also touch on the thread of how readable
NB.    J can be. Apologies to bold APL enthusiasts tired of verbose
NB.    postings -:)

NB.    (This verb only works on v6.1 & v6.2)

NB.    First some redefined  J primitives:
   right =. ]
   drop =. }.
   open =. > 
   shape =. $
   scalar =. ''&shape 
   take =. {.
   base =. #.
   left =. [
   amend =. }
   link =. ;
   integers =. i.
   largOrEql =. >:
   orscan =. +./
   agenda =. @.
   laminate =. ,:
   9!:3 (5) NB. nice for functional verb displays 
  
NB. and now for the construction :
 
   data =. scalar@:open@drop@right
   positions =. shape@left base open@take@right
   amendNoun =. left
   selectiveAssign =. data`positions`amendNoun amend 

NB.    As is, "selectiveAssign" works perfectly  but in the instance
NB.    where one is indexing into a postion which doesn't exist, it 
NB.    sometimes it assigns when it shouldn't.  We can make
NB.    "selectiveAssign" return an error in this case:

   assign =. data`positions`amendNoun amend  NB. old selectiveAssign
   errorMessage =. 'index error (selectiveAssign)'"_
   errorCondition =. scalar@orscan@(open@take@right largOrEql shape@left) 
   selectiveAssign =. assign`errorMessage agenda errorCondition

NB. For the indigenous representation :
   assign =. (data f.)`(positions f.)`(amendNoun f.) amend 
   selectiveAssign=.(assign f.)`(errorMessage f.)(agenda f.)(errorCondition f.)

NB. lets check (I leave it to you to 0!:2 this file.)

   a =. integers 4 4
   b =. 2 1 link 1000
   c =. (2 2 shape 0 1 2 3) link 100 200
   b link a selectiveAssign b
   c link a selectiveAssign c
   a3D =. integers 2 2 2
   b3D =. (1 1 1) link 200
   b3D link a3D selectiveAssign b3D
   ae0 =. 2 5 link 1000
   ae1 =. 5 5 link 1000
   ae2 =. 4 4 link 1000
   ae0 link a selectiveAssign (2 5 link 1000) 
   ae1 link a selectiveAssign (2 5 link 1000) 
   ae2 link a selectiveAssign (2 5 link 1000) 

NB. Of course all this may be making a big deal about something
NB. which amend would handle nicely. 
NB.    Emmett

Newsgroups: comp.lang.apl
From: mark@11srus.enet.dec.com (Mark Eklof)
Subject: Re: branching in proposed ISO standard
Keywords: branching goto ISO APL
Reply-To: mark@11srus.enet.dec.com (Mark Eklof)
Organization: Digital Equipment Corporation
Date: Thu, 21 Jan 1993 15:54:58 GMT


In article <abalje47.727565873@ursa>, abalje47@ursa.calvin.edu (Alan Baljeu) writes:
|>Perhaps I'm blind, but I can't find any sort of flow control structures in
|>the latest draft of the ISO Apl proposal.

	If you mean the Branch arrow, that's still there.  It's mostly
in chapters 5 & 6, where it was in IS 8485.  For example, section 6.1.6 on
statement analysis mentions it.

	If you mean things like if-then-else, and such, they aren't intended
to be there.  I'm not aware of any APL implementations that include them, and
I don't recall proposals for them.

Mark


Newsgroups: comp.lang.apl
From: Mike Kent <70530.1226@CompuServe.COM>
Subject: Re:  Looking for good APL2 book
Organization: University of Waterloo
Date: Sun, 24 Jan 1993 03:09:33 GMT

In article <1993Jan20.065531.22302@Princeton.EDU>,
lardieri@phoenix.Princeton.EDU (Stephen Lardieri) writes:

>>  I would like to learn the APL2 language and am looking for 
>>  recommendations on a good book to buy.  I would prefer a book that 
>>  does not assume I will be using one particular computer system.
>>  ...
>>  I will be using APL2 1.3.0 on an IBM 3090 ... I will eventually be 
>>  using STSC APL on a PC ...

"APL2 at a Glance", by Brown et. al. is pretty good at an elementary
level, which is fortunate as it's the only general introduction to APL2
that I know of.  For more depth, the choice is clear (to me):  the IBM
APL2 Language Reference.  The Manugistics/STSC documentation is pretty
good, as _documentation_, but the Language Reference describes, then
illuminates and explains.  Both are IBM-specific, but for base language 
this is not a problem as the Manugistics/STSC implementation has converged
with IBMs, and both are quite close to the ISO Extended APL Draft
Standard.    

The significant differences between the IBM and Manugistics products are  
in the way they handle contact with the outside world, for instance file,
screen, printer I/O, and calls to non-APL routines.  For this you _have_
to have an implementation-specific reference, as no two APL systems are
identical, and (except for mainframe implementations for IBM hardware),
they aren't even similar enough to get much benefit from knowing one when
you have to learn another.

// mike

Newsgroups: comp.lang.apl