archive-com.com » COM » E » EFG2.COM

Total: 878

Choose link from "Titles, links and description words view":

Or switch to "Titles and links view".

  • news demon co uk 932508997 nnrp 09 13958 NO IDENT aziraphale demon co uk 194 222 242 160 Organization Mark s linux box Mime Version 1 0 Newsgroups comp lang pascal delphi misc Jeremy Collins wrote IIRC the ntohl function does this Yes on Wintel however to assume that it ll do that on all platforms that Delphi might run on might be a bit optimistic Any of the follwing

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/1999/0720.txt (2016-02-14)
    Open archived version from archive


  • efg's Endian Page
    have to live with Subject Re IEEE standard single precision format to Delphi 3 format From Earl F Glynn Date 1997 12 31 Newsgroups borland public delphi objectpascal Here s some code that should get you started using a variant record to look at the four individual bytes within a single value you also could use pointers to do the same thing procedure TForm1 Button1Click Sender TObject TYPE SingleOverlay RECORD cases in variant overlay same memory area CASE INTEGER OF 1 float Single 2 b ARRAY 1 4 OF BYTE END only one END here VAR z SingleOverlay a SingleOverlay BEGIN z float 1 305085E3 Emphasize little endian order Result is B822A344 that in normal order would be 44A322B8 label1 caption format 02x 02x 02x 02x z b 1 z b 2 z b 3 z b 4 44A322C0 in little endian is C022A344 gives value of 1305 0859375 a b 1 C0 a b 2 22 a b 3 A3 a b 4 44 label2 caption FloatToStr a float END Subject Re Converting floating point data from SUN to PC how From Earl F Glynn Date 1997 02 13 Newsgroups comp lang pascal delphi misc With 8 byte doubles in C on a big endian Sun workstation the logical arrangement of hex digits is in a normal order On a PC with little endian order just swap 4 byte words swap 2 byte words within 4 byte words swap bytes within 2 byte words This can be done recursively Unfortunately I only could find C code that shows this void swap BYTE x BYTE size unsigned char c unsigned short s unsigned long l switch size case 2 swap two bytes c x x x 1 x 1 c break case 4 swap two shorts 2 byte words s

    Original URL path: http://www.efg2.com/Lab/OtherProjects/Endian.htm (2016-02-14)
    Open archived version from archive


  • Trace 15 Mar 2000 09 22 17 0800 212 64 56 26 X MSMail Priority Normal X Priority 3 Newsgroups borland public codecentral X MimeOLE Produced By Microsoft MimeOLE V5 00 2919 6600 Hi John Kaster Borland wrote in message news 38ced7fc dnews Another good candidate for CodeCentral submission I submitted the following code snippet to codecentral id 14560 function GCD Nr1 Nr2 integer integer Calculate the greatest common divisor

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/2000/0315b.txt (2016-02-14)
    Open archived version from archive


  • mail Xref newsgroups borland com borland public delphi language basm 532 Will DeWitt wrote Almost Re ran the same tests as before and the gap was narrowed down to less than 1 percent in one test case it eeked out a lead tho I made one or two minor modifications to the code and now it s faster in all situations short or long The first change was right at

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/2002/1010.txt (2016-02-14)
    Open archived version from archive


  • technique to compare the file name with all the files in the list For each file in the list I compute an integer value e g the sum of all characters in name and when I search if the file name exists in list I have to compare only integer values quite faster The problem is the hash function that converts the file name into an integer value If I

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/1997/1216.txt (2016-02-14)
    Open archived version from archive


  • algorithm References Content Type text plain charset us ascii Content Transfer Encoding 7bit NNTP Posting Host 194 202 44 145 X Trace 26 Mar 2001 06 49 49 0800 194 202 44 145 Lines 64 Path dnews 194 202 44 145 Xref dnews borland public delphi non technical 203398 Had an interview question recently to write an algorithm to construct the Pascal Pyramid It stumped me does any one have

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/2001/0326b.txt (2016-02-14)
    Open archived version from archive


  • Newsgroups borland public turbopascal On Sat 31 Jul 1999 11 03 23 0200 John Smith wrote Does anyone know where I can find a tutorial on the net for binary search trees and traversing them using recursion There are binary trees and there is a search method called binary searching But I don t know quite what you mean by binary search trees Binary search Assuming your data are ordered

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/1999/0801c.txt (2016-02-14)
    Open archived version from archive


  • that I have been using since Pascal 5 0 and it is still functions perfectly under all release of Delphi up to D4 type files array array 1 200 of string 12 files ptr files array var zip lst files ptr zip top int procedure SORT LIST var StringList FILES PTR FirstElement LastElement int Primary Array sorting routine var newfirst newlast int procedure divideList var worklist FILES PTR var begin1

    Original URL path: http://www.efg2.com/Lab/Library/UseNet/1998/1228.txt (2016-02-14)
    Open archived version from archive



  •