Gpc

gpc@gnu.de

5400 discussions

Re: Vector arithmetic
by Contestcen＠aol.com 10 Aug '10

10 Aug '10

> Do not built things into the compiler (or ask for them) that can be > done outside of it. Building in things is many times as much work. > Maybe I haven't stressed this enough so far because it's so obvious > to me, but not to those who haven't worked in the compiler. I understand, but the balance changes when 10 people, or 100 or 1000 people need to do the same thing. Which is more work, a compiler writer making a hard change, or 100 people each writing a set of relatively straightforward code? That's why we try to identify features that will be widely used, such as vector arithmetic. FPC already supports assignments of vectors and arrays, so why not addition and subtraction? It builds on a capability that the compiler already has. Frank Rubin

3 2

Re: Vector arithmetic
by Contestcen＠aol.com 09 Aug '10

09 Aug '10

(Oops, I hit Send before I hit the control that removes the HTML tags. Please excuse the error. Here is the cleansed message.) I see. How would that work? Can you give me an example of a routine that would, for example, add arrays of long integers and could handle the 3 cases that I mentioned? Would it also handle arrays of bytes? arrays of words? arrays of reals? Would I need to repeat the same for multiplication? for xor? for string concatenation? for modular arithmetic? for 96-bit arithmetic? for quaternions? for division rings? A general vector facility would be a great work saver, even if it did nothing regarding parallel execution. In a message dated 8/6/2010 3:16:27 A.M. Eastern Daylight Time, felipemonteiro.carvalho(a)gmail.com writes: On Fri, Aug 6, 2010 at 8:35 AM, <Contestcen(a)aol.com> wrote: > Except that you have to code every single case separately, 2x6, 3x10, > 4x4x4, etc. You need to write a separate routine for every shape of array you > want to use. Or you could use dynamic arrays instead of static ones. Then you can write only one case. -- Felipe Monteiro de Carvalho

1 0

Re: Vector arithmetic
by Contestcen＠aol.com 09 Aug '10

09 Aug '10

I see. How would that work? Can you give me an example of a routine that would, for example, add arrays of long integers and could handle the 3 cases that I mentioned? Would it also handle arrays of bytes? arrays of words? arrays of reals? Would I need to repeat the same for multiplication? for xor? for string concatenation? for modular arithmetic? for 96-bit arithmetic? for quaternions? for division rings? A general vector facility would be a great work saver, even if it did nothing regarding parallel execution. In a message dated 8/6/2010 3:16:27 A.M. Eastern Daylight Time, felipemonteiro.carvalho(a)gmail.com writes: On Fri, Aug 6, 2010 at 8:35 AM, <Contestcen(a)aol.com> wrote: > Except that you have to code every single case separately, 2x6, 3x10, > 4x4x4, etc. You need to write a separate routine for every shape of array you > want to use. Or you could use dynamic arrays instead of static ones. Then you can write only one case. -- Felipe Monteiro de Carvalho

1 0

Vector arithmetic
by Contestcen＠aol.com 08 Aug '10

08 Aug '10

> For your information: that already exists in FPC. It's called operator overloading: > > http://www.freepascal.org/docs-html/ref/refch12.html#x161-16800012 > > -- > Felipe Monteiro de Carvalho Except that you have to code every single case separately, 2x6, 3x10, 4x4x4, etc. You need to write a separate routine for every shape of array you want to use. Frank Rubin

4 3

Re: [GPC]: Ada
by Pascal 07 Aug '10

07 Aug '10

Hello Adriaan. Few years ago, Mac Pascal Interfaces were translated into Carbon-Ada. You can found them on www.macada.org. Basically Ada 2005 is supporting all modern object oriented paradigmes : classes as package + tagged record, multiple inheritance with interfaces (as Java), static and dynamic binding... Would be the translation of Cocoa Interfaces into Ada achievable? What would be necessary ? Anyway, I'm really interesting in "such thing like Objective-Ada" and contributing if I can help. Regards, Pascal. http://blady.pagesperso-orange.fr Le 5 août 10 à 09:46, gpc-owner(a)gnu.de a écrit : > De : Adriaan van Os <gpc(a)microbizz.nl> > Date : 5 août 2010 09:01:36 HAEC > À : gpc(a)gnu.de > Objet : Rép : Ada (was: D > > > But there is no such thing like Objective-Ada, is there ? That > would be a clear disadvantage of Ada as an intermediate language. > > Regards, > > Adriaan van Os

2 1

pascal code for numerical computations
by Leo Brewin 06 Aug '10

06 Aug '10

Hi, I'd like to put in my 2 cents worth for GPC. It is fantastic! I've been using GPC for the past few years and it has been an invaluable aid to my productivity. It meets all my needs (most importantly the support for conformant arrays and modules). My main area of research is in numerical general relativity and I have taught numerical methods to science students for a number of years. With the current lively discussion on the future directions of GPC I though it would be good time to make my own contribution by way of making some of my code available. It's a collection of numerical codes covering a range of standard numerical methods (root finding, interpolation, integration etc.) as well as some more advanced methods (multigrids, adaptive integrations, improper integrals, boundary value problems, genetic algorithms and so on). You can find the code at http://users.monash.edu.au/~leo/software/pascal/files/GPCExamples.tar.gz More information can be found in the README.txt in the parent directory. Cheers, Leo Brewin School of Mathematical Sciences Monash University Australia

2 1

For the wish list: Vector Arithmetic
by John L. Ries 06 Aug '10

06 Aug '10

Fortran 90 and later allow arithmetic operations on whole arrays, like so: !Both arrays must be the same shape integer foo(37), doublefoo(37) doublefoo=foo*2 This is actually a highly useful feature as it reduces the need for looping (a common place for bugs to hide) and allows array operations to be distributed over multiple processors, if available. In Pascal, the above might look something like this: var foo, doublefoo: array[1..37] of integer; {...} begin {...} doublefoo:=2*foo; {...} end. --------------------------| John L. Ries | Salford Systems | Phone: (619)543-8880 x107 | or (435)867-8885 | --------------------------|

4 7

Quo vadis, GPC?
by Frank Heckenbach 06 Aug '10

06 Aug '10

Hi everybody, since GPC development has mostly stalled, I've thought about if and how its development could be continued. Here are my current thoughts about it. Since the text is quite long, I put it on the web: http://fjf.gnu.de/gpc-future.html As I write there, I don't see much future in the current way of developing GPC, but also alternative development models will not be a task for a single person. In other words, without some new contributors, there is probably no chance for GPC development to continue. I don't really know how many of you currently use GPC, and to what extent and in which ways, e.g., do you use it just to maintain some legacy code, or are you actively writing new applications? So in order to tell whether continuing GPC development is worthwhile, I'd like to know who of you would actually care about major new features in GPC (as opposed to just preserving the status quo), and who would be interested not only in using GPC, but also supporting its continued development, either by actively contributing to it, or -- perhaps in the case of companies that use GPC -- by paying for continued development. If it turns out there is no sufficient amount of interest, I'm afraid to say it's probably better to put an end to it now rather than further dragging along. (Of course, the existing GPC versions will continue to be available, and anyone who wants to can use and modify them, which the GPL already guarantees, but without prospects for the future, I would then retire from GPC development and start to rewrite my own Pascal programs in other languages.) Frank -- Frank Heckenbach, f.heckenbach(a)fh-soft.de, http://fjf.gnu.de/, 7977168E GPC To-Do list, latest features, fixed bugs: http://www.gnu-pascal.de/todo.html GPC download signing key: ACB3 79B2 7EB2 B7A7 EFDE D101 CD02 4C9D 0FE0 E5E8

26 98

Pastel compiler (GCC's predecessor)
by Rugxulo 05 Aug '10

05 Aug '10

Okay, somebody mentioned the Pastel compiler (Pascal-ish, compiled itself) that was the original basis for RMS' hacking. He wrote his own C frontend and that later became GCC proper. It's very hard to find info on this, so I'm pasting here my recent findings for ya. (Note that I know less than probably anybody about this. I'm no knowledgeable insider or anything!) In particular, GCC's history and Wikipedia seem to omit mention of most of this. Somebody should also probably e-mail RMS to ask if he still has a copy of the sources around somewhere (interesting to me, at least, and I'm just vaguely curious!). "Jeff Broughton, then Amber project leader, implemented two extended Pascal compilers. The extended language was named Pastel (an off-color Pascal). A complete compiler targeted to the S-1 architecture was completed in several months. However, the first version of the compiler, which was implemented in slightly more than a weekend, produced PL/1 as its output! This was done to allow the continued use of Multics, which had no Pascal compiler, as the development site for Amber. At that point the project had a couple of man-years of code written in PL/1. The conversion of all PL/1 code to Pastel was accomplished in about 3 man months. (1998 historical note: at one point in the project Richard Stallman visited, and had the Pastel compiler explained to him. He left with a copy of the source, and used it to produce the Gnu C compiler. Most of the techniques that gave the Gnu C compiler its reputation for good code generation came from the Amber Pastel compiler.)" http://www.mit.edu/~cbf/thesis.htm http://killian.com/earl/ http://www.lbl.gov/cs/CSnews/CSnews073109a.html http://en.wikipedia.org/wiki/PathScale

2 3

Rewriting Pascal
by Prof. Harley Flanders 04 Aug '10

04 Aug '10

To Frank H. and all Pascal re-writers: One of the main, if not the main, point of keeping Pascal updated is to extend its usefulness. I want to address one area: scientific programming. It is what I do; I have done it in Pascal for vary many years, and continue doing so in Delphi. I even wrote a book, "Scientific Pascal", in 2 editions. So here is my wish list: Add types Complex Rational coded in assembler. All the standard operations and functions should apply to these types: Complex: +, -, *, /, ^ or ** Sqr, Sqrt, Sin, Cos, ..., Exp Ln Rational: +, -, *, /, Sqr, LowestTerms,... Even 40-year old FORTRAN has complex types. Obviously Complex is needed for numerical analysis, differential equations, electrical engineering, etc. A rational type would be very useful for number theory. Add higher precision floats (20 bytes, 24 bytes, user-chosen precision) again with all the standard operations and functions implemented in assembler. Borland introduced type Extended (10 byte floats), possibly in Turbo Pascal 4 or 5. This was an enormous improvement over the Real type, (4 byte), and made full use of the 80x87 mathematical coprocessor. Extended has remained the highest precision f.p. type in Borland Pascal and probably all other Pascals for 15-20 years, while computer speed and memory have improved by orders of magnitude. It is surely time for more accurate real types, coded in assembler. The current real types (in Delphi) are Single (4 bytes), Real48 (6 bytes), Double (8 bytes), Extended (10 bytes), [and Comp and Currency]. Synonyms are in order,skipping the factor of 8: Real4, Real6, Real8, Real10, etc. for the hopefully new ones. It is also time for more accurate integers. Borland introduced Int64 10-20 years ago, and it has remained the standard highest accuracy integer type. Delphi wisely added the names (and unsigned types) Int8, Int16, Int32, Int64, UInt8, UInt16, UInt32, UInt64. (My preference again would be to drop the factor 8: Int1, Int2, Int4, Int8, UInt1, UInt2, UInt4, UInt8.) I would love to see Int16, Int32, Int64 and Int128, and their unsigned counterparts. Add exponentiation, with the symbol ^ or ** overloaded for the special cases of the exponent: positive or negative integer [ (-0.02)^(-3) = -1.25E5 ], rational with odd denominator [ (-8)^(5/3) = -32 ]. FORTRAN and even BASIC have had exponentiation forever. Allow genuine operator overloading, such as operator "+" (const X, Y: MyType): MyType; operator "*" (const X: Integer; const Y: IntegerVector): IntegerVector; Delphi has made a mess of this so far, with overloading only possible with class functions and records. GNU Pascal and Free Pascal do much better. It should be possible to overload all the standard operators: + - * / ^ = <> <= >= > < There should be an abstract classes TRing which can be specialized to TField, etc. TRing should have a Ring Element that can be specialized. So one could define TMatrix, with elements in TRing, and define matrix multiplication A*B and Det (determinant) without specifying the elements in advance, and specialize them to any ring, such as the rings of rationals, of polynomials with complex coefficients, etc. This is what OOP, polymorphism, abstraction, inheritance should be about. Add Print Methods for TMemo, TStringGrid, TImage, and maybe a few other components. Obviously if I compute data and store it in a table or memo, or create a graph, I want to print it. Currently this requires searching the WWW for someone's code. One of the advantages of unicode (see below): one can mix alphabets in tables. For instance a table of number theoretic functions will have Greek headings: Omega, Phi, omega, etc. Any modern Pascal should use unicode, with all character and string procedures modified accordingly. This is a big advance Delphi started a year or so ago Add some more fonts that include Greek letters and many math symbols, and which can be easily added to code (which should be WYSIWYG). Fonts for scientific use should be non-justified, so that "9", "1" and "." are the same width in displays of numbers. As far as I can tell, Courier New (OEM CharSet) is the only satisfactory font at present. Harley Flanders -- ============================= Prof. Harley Flanders 3533 Windemere Court Ann Arbor, MI 48105-2867 Home: 734 668 1546 harley(a)umich.edu =============================

6 9

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

1996

1995

Gpc