Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]

Groups > comp.lang.c++ > #47578 > unrolled thread

My C++ Coding Standards ( apologies to Bjarne Stroustrup ).

Back to article view | Back to comp.lang.c++

This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by below is the oldest one visible, not the original post.

Contents

  My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Jeff-Relf.Me <@.> - 2016-12-23 17:06 -0800
    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-24 11:00 +0200
      Re: while() and "Loop(3) { _Loop(4)..." aren't "impenetrable". Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-26 23:17 +0200
        Re: Refactoring is good, God's speed. Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-27 01:17 +0200
          Re: Refactoring is good, God's speed. "Rick C. Hodgin" <rick.c.hodgin@gmail.com> - 2016-12-26 15:26 -0800
          Re: PHP could use #define, seriously. Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-27 10:01 +0200
          Re: Refactoring is good, God's speed. legalize+jeeves@mail.xmission.com (Richard) - 2016-12-28 18:10 +0000
            Re: Refactoring is good, God's speed. woodbrian77@gmail.com - 2016-12-28 10:20 -0800
        Re: Refactoring is good, God's speed. interval1066@gmail.com - 2016-12-30 10:43 -0800
          Re: Refactoring is good, God's speed. legalize+jeeves@mail.xmission.com (Richard) - 2017-01-02 00:44 +0000
            #define came from God himself, it's sacred. Jeff-Relf.Me <@.> - 2017-01-01 23:51 -0800
              #define came from God himself, it's sacred. Jeff-Relf.Me <@..yep> - 2017-01-02 08:00 +0000
                Re: #define came from God himself, it's sacred. moroney@world.std.spaamtrap.com (Michael Moroney) - 2017-01-03 03:58 +0000
                  I completely reWrote it, of course. Jeff-Relf.Me <@.> - 2017-01-03 00:46 -0800
                    I completely reWrote it, of course. Jeff-Relf.Me <@..sour> - 2017-01-03 08:51 +0000
                    Re: I completely reWrote it, of course. Peter Köhlmann <peter-koehlmann@t-online.de> - 2017-01-03 12:13 +0100
                      Re: I completely reWrote it, of course. Melzzzzz <mel@zzzzz.com> - 2017-01-03 12:28 +0100
                      Re: I completely reWrote it, of course. chrisv <chrisv@nospam.invalid> - 2017-01-03 07:32 -0600
                        Ezekiel lives in your head RENT FREE!!  LOL!!! GreyCloud <mist@cumulus.com> - 2017-01-03 12:16 -0700
                        With "warnings as errors", turn off these warnings. Jeff-Relf.Me <@.> - 2017-01-03 13:00 -0800
                      Re: I completely reWrote it, of course. GreyCloud <mist@cumulus.com> - 2017-01-03 12:16 -0700
                        Re: I completely reWrote it, of course. red floyd <dont.bother@its.invalid> - 2017-01-03 12:30 -0800
                          If you're retarded then, yes, _Loop() is "undefined". Jeff-Relf.Me <@.> - 2017-01-16 11:06 -0800
                        Re: I completely reWrote it, of course. scott@slp53.sl.home (Scott Lurndal) - 2017-01-04 13:33 +0000
                          Re: I completely reWrote it, of course. chrisv <chrisv@nospam.invalid> - 2017-01-04 07:45 -0600
                            Re: I completely reWrote it, of course. scott@slp53.sl.home (Scott Lurndal) - 2017-01-04 14:54 +0000
                              The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Jeff-Relf.Me <@.> - 2017-01-04 10:17 -0800
                                Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Peter Köhlmann <peter-koehlmann@t-online.de> - 2017-01-04 19:19 +0100
                                Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). moroney@world.std.spaamtrap.com (Michael Moroney) - 2017-01-05 03:34 +0000
                                  The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Jeff-Relf.Me <@.> - 2017-01-04 22:26 -0800
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Anonymous <anonymous@invalid.tld> - 2017-01-05 08:18 +0000
                                      Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Peter Köhlmann <peter-koehlmann@t-online.de> - 2017-01-05 09:24 +0100
                                      PostScript is my thing. Jeff-Relf.Me <@.> - 2017-01-05 01:08 -0800
                                    My diffs now _perfectly match MicroSoft's WinMerge. Jeff-Relf.Me <@.> - 2017-01-07 03:56 -0800
                                      Re: My diffs now _perfectly match MicroSoft's WinMerge. Peter Köhlmann <peter-koehlmann@t-online.de> - 2017-01-07 13:09 +0100
                                      Re: My diffs now _perfectly match MicroSoft's WinMerge. jonkalb <google@kalbweb.com> - 2017-01-07 08:32 -0800
                                      Re: My diffs now _perfectly match MicroSoft's WinMerge. moroney@world.std.spaamtrap.com (Michael Moroney) - 2017-01-07 20:25 +0000
                                        Like a compiler that compiles itself, my Diff app diffs itself. Jeff-Relf.Me <@.> - 2017-01-07 17:53 -0800
                                        Re: My diffs now _perfectly match MicroSoft's WinMerge. Christian Gollwitzer <auriocus@gmx.de> - 2017-01-10 22:15 +0100
                                          Text file comparison is essential. Jeff-Relf.Me <@.> - 2017-01-16 11:23 -0800
                                            Nothing to compare, left and right, old and new. Jeff-Relf.Me <@.> - 2017-01-19 04:12 -0800
                                Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). jmfbahciv <See.above@aol.com> - 2017-01-05 14:08 +0000
                                Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Vir Campestris <vir.campestris@invalid.invalid> - 2017-01-05 21:09 +0000
                                  Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). legalize+jeeves@mail.xmission.com (Richard) - 2017-01-05 21:19 +0000
                                    "Functional" programming is "Tree Crawling". Jeff-Relf.Me <@.> - 2017-01-05 14:53 -0800
                                Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Lofty Goat <rlwatkins@gmail.com> - 2017-01-05 17:43 -0600
                                  Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). woodbrian77@gmail.com - 2017-01-10 12:02 -0800
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Gareth Owen <gwowen@gmail.com> - 2017-01-10 20:13 +0000
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). scott@slp53.sl.home (Scott Lurndal) - 2017-01-10 20:34 +0000
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Vir Campestris <vir.campestris@invalid.invalid> - 2017-01-10 21:21 +0000
                                      Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). David Brown <david.brown@hesbynett.no> - 2017-01-10 22:48 +0100
                                        Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Vir Campestris <vir.campestris@invalid.invalid> - 2017-01-12 21:40 +0000
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). red floyd <dont.bother@its.invalid> - 2017-01-10 13:46 -0800
                                    Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). Ian Collins <ian-news@hotmail.com> - 2017-01-11 17:41 +1300
                              Re: I completely reWrote it, of course. jmfbahciv <See.above@aol.com> - 2017-01-05 14:08 +0000
                        What about you, GreyCloud ? Jeff-Relf.Me <@.> - 2017-01-16 11:02 -0800
                          Re: What about you, GreyCloud ? GreyCloud <mist@cumulus.com> - 2017-01-16 19:46 -0700
                            Health issues ? Jeff-Relf.Me <@.> - 2017-01-16 20:39 -0800
                              Re: Health issues ? GreyCloud <mist@cumulus.com> - 2017-01-17 11:50 -0700
                                Negative Interest Rates. Jeff-Relf.Me <@.> - 2017-01-19 04:25 -0800
                                  Re: Negative Interest Rates. GreyCloud <mist@cumulus.com> - 2017-01-19 11:47 -0700
                                    Negative Interest Rates "rips off" rich people, not the poor. Jeff-Relf.Me <@.> - 2017-01-19 19:23 -0800
                                      Re: Negative Interest Rates "rips off" rich people, not the poor. GreyCloud <mist@cumulus.com> - 2017-01-20 16:17 -0700
                          Tons of people have reviewed the code, source and object. Jeff-Relf.Me <@.> - 2017-01-19 04:02 -0800
                          Building a complex system can't be done when you're drunk and horny. Jeff-Relf.Me <@.> - 2017-01-19 04:17 -0800
                            Re: Building a complex system can't be done when you're drunk and horny. David Brown <david.brown@hesbynett.no> - 2017-01-19 13:59 +0100
                              No one is here to learn at your feet, sorry. Jeff-Relf.Me <@.> - 2017-01-19 05:30 -0800
                              Re: Building a complex system can't be done when you're drunk and horny. chrisv <chrisv@nospam.invalid> - 2017-01-19 07:37 -0600
                                Building a complex system can't be done when you're drunk and horny. Jeff-Relf.Me <@.> - 2017-01-19 05:43 -0800
                              Re: Building a complex system can't be done when you're drunk and horny. moroney@world.std.spaamtrap.com (Michael Moroney) - 2017-01-20 04:32 +0000
                                Usenet isn't WikiPedia; here, it's all play and no work, anything goes. Jeff-Relf.Me <@.> - 2017-01-19 21:02 -0800
                    The "Least Longest" diffs. Jeff-Relf.Me <@.> - 2017-01-03 03:04 -0800
                  Re: #define came from God himself, it's sacred. Vir Campestris <vir.campestris@invalid.invalid> - 2017-01-03 21:27 +0000
        Re: LoopP( !isDigit( Ch ) ); jonkalb <google@kalbweb.com> - 2017-01-16 22:05 -0800
          Re: LoopP( !isDigit( Ch ) ); woodbrian77@gmail.com - 2017-01-17 11:17 -0800
            Re: LoopP( !isDigit( Ch ) ); David Brown <david.brown@hesbynett.no> - 2017-01-17 22:20 +0100
          Re: LoopP( !isDigit( Ch ) ); Cholo Lennon <chololennon@hotmail.com> - 2017-01-17 18:18 -0300
            Re: LoopP( !isDigit( Ch ) ); Vir Campestris <vir.campestris@invalid.invalid> - 2017-01-17 21:51 +0000
      Re: while() and "Loop(3) { _Loop(4)..." aren't "impenetrable". Öö Tiib <ootiib@hot.ee> - 2016-12-26 13:24 -0800
        Re: "Standards" are like assholes, everyone's got one. Öö Tiib <ootiib@hot.ee> - 2016-12-26 14:27 -0800
          Re: _Underscores have never been -- and could never be -- a problem. Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-27 13:25 +0200
            Re: Compiling C++ is trivial, always. Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-27 21:38 +0200
              Re: Compiling C++ is trivial, always. Mr Flibble <flibble@i42.co.uk> - 2016-12-27 20:01 +0000
                Re: Compiling C++ is trivial, always. Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-27 22:20 +0200
              Re: How big are your .CPP files ( in MegaBytes, not lines ) ? Paavo Helde <myfirstname@osa.pri.ee> - 2016-12-28 00:02 +0200
                Re: You could condense it down into fewer, larger, .CPP files. Ian Collins <ian-news@hotmail.com> - 2016-12-28 14:11 +1300
                  Re: What are you compiling, and how long does it take ? ! Ian Collins <ian-news@hotmail.com> - 2016-12-28 15:34 +1300
                    Re: Are you Linus Torvalds ? Ian Collins <ian-news@hotmail.com> - 2016-12-28 16:14 +1300
                      Re: The _Default "Subject:" line is neither mandatory or desirable. Ian Collins <ian-news@hotmail.com> - 2016-12-28 17:35 +1300
                        Re: Would a hardware/software upgrade help ? Ian Collins <ian-news@hotmail.com> - 2016-12-29 08:09 +1300
                        Re: The _Default "Subject:" line is neither mandatory or desirable. legalize+jeeves@mail.xmission.com (Richard) - 2016-12-28 20:01 +0000
            Re: I don't create .h files, not a one. Mr Flibble <flibbleREMOVETHISBIT@i42.co.uk> - 2017-01-16 19:03 +0000
          Re: _Underscores have never been -- and could never be -- a problem. Öö Tiib <ootiib@hot.ee> - 2016-12-27 05:58 -0800
            Re: _Loop() works fine; I don't use "concurrent_vector.h". Vir Campestris <vir.campestris@invalid.invalid> - 2016-12-27 22:14 +0000
            Re: _Loop() works fine; I don't use "concurrent_vector.h". Öö Tiib <ootiib@hot.ee> - 2016-12-28 02:08 -0800
              Re: _Loop() works fine; I don't use "concurrent_vector.h". woodbrian77@gmail.com - 2016-12-28 09:45 -0800
        Re: "Standards" are like assholes, everyone's got one. Ian Collins <ian-news@hotmail.com> - 2016-12-27 12:34 +1300
    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Peter Köhlmann <peter-koehlmann@t-online.de> - 2016-12-24 10:40 +0100
      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-26 17:41 -0800
        Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-27 15:28 +1300
    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). jonkalb <google@kalbweb.com> - 2016-12-26 23:24 -0800
      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-27 10:54 -0800
        Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-28 11:26 +1300
          Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-27 20:36 -0800
            Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-28 17:42 +1300
              Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-27 21:24 -0800
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-27 22:16 -0800
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-28 13:29 -0800
                  Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-29 10:46 +1300
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-30 09:55 +1300
                  Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-29 14:19 -0800
                    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-30 11:25 +1300
                      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-29 21:59 -0800
                        Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-30 21:27 +1300
                          Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-30 09:51 -0800
                            Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Wouter van Ooijen <wouter@voti.nl> - 2016-12-30 19:46 +0100
                    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). David Brown <david.brown@hesbynett.no> - 2016-12-30 10:07 +0100
                    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). asetofsymbols@gmail.com - 2016-12-30 02:49 -0800
                      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). asetofsymbols@gmail.com - 2016-12-30 03:17 -0800
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-29 10:08 +1300
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-28 12:41 -0800
                  Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Chris Vine <chris@cvine--nospam--.freeserve.co.uk> - 2016-12-28 21:59 +0000
                    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Dombo <dombo@disposable.invalid> - 2016-12-29 14:34 +0100
                      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-29 10:27 -0800
                        Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Dombo <dombo@disposable.invalid> - 2016-12-29 20:33 +0100
                    Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). woodbrian77@gmail.com - 2016-12-28 15:14 -0800
                      Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Ian Collins <ian-news@hotmail.com> - 2016-12-29 13:05 +1300
                Re: My C++ Coding Standards ( apologies to Bjarne Stroustrup ). Chris Vine <chris@cvine--nospam--.freeserve.co.uk> - 2016-12-28 19:36 +0000

Page 2 of 7 — ← Prev page 1 [2] 3 4 5 6 7  Next page →

#47808 — Re: I completely reWrote it, of course.

On 01/03/17 04:13, Peter Köhlmann wrote:
> The worst "programmer" of all time babbled:
>
>> You ( MichaelMoroney ) wrote:
>>> Gee, the code from the forged Relf looks better than
>>> the code from the real Jeff.
>>
>> No one gives a shit about the C++ code I posted,
>> nor should they, but it helps _me.
>>
>> Since then, I completely reWrote it, of course;
>> I'm sure to change it again, as time goes by.
>>
>> Currently, it's:
>>
>>    //  ScreenShot:  http://Jeff-Relf.Me/Diff.PNG
>>    //  Help/Settings:  http://Jeff-Relf.Me/X.HTM
>>
>>    //  Peel(), below, peels off diffs from the tops and bottoms
>>    //  of LeftOlder and RightNewer text files.
>>    //
>>    //  BB is a pointer to the start of a dynamic array of lines ( pointers
>>    );
>>    //  EE points to the end of the array.
>>    //
>>    //  Already, BB and EE point to "diffs" (mismatches lines).
>>    //   BB and  EE are from the LeftOlder file.
>>    //  _BB and _EE are from the RightNewer file.
>>
>>    void Peel( LnA BB, LnA EE, LnA _BB, LnA _EE ) { int rv, S, _S, F, _F ;
>>      LnP t, _t ;  LnA  BB_Slow, _BB_Slow, BB_Fast, _BB_Fast, EE_Slow,
>>      _EE_Slow, EE_Fast , _EE_Fast, Mid = BB + ( EE - BB )/2, _Mid = _BB + (
>>      _EE - _BB )/2 ; TopMatch = BtmMatch = 0, BB_Slow = BB, _BB_Slow = _BB
>>      ; EE_Slow = EE, _EE_Slow = _EE, ReSetBB_Fast, ReSetEE_Fast ;
>>
>>      Top:    if ( TopMatch ) if ( BtmMatch ) goto Done ; else goto Btm ;
>>              if ( Level = BB_Fast - BB_Slow, TopFlags, TopMatch = !S&&  !_S
>>              ) {
>
> Ye gods!

He doesn't work for anybody needing code.  That much is certain.
Otherwise, he'd have been fired.

[toc] | [prev] | [next] | [standalone]

#47810 — Re: I completely reWrote it, of course.

On 1/3/2017 11:16 AM, GreyCloud wrote:
> On 01/03/17 04:13, Peter Köhlmann wrote:
>> The worst "programmer" of all time babbled:
>>
>>> You ( MichaelMoroney ) wrote:
>>>> Gee, the code from the forged Relf looks better than
>>>> the code from the real Jeff.
>>>
>>> No one gives a shit about the C++ code I posted,
>>> nor should they, but it helps _me.
>>>
>>> Since then, I completely reWrote it, of course;
>>> I'm sure to change it again, as time goes by.
>>>
>>> Currently, it's:
>>>
>>>    //  ScreenShot:  http://Jeff-Relf.Me/Diff.PNG
>>>    //  Help/Settings:  http://Jeff-Relf.Me/X.HTM
>>>
>>>    //  Peel(), below, peels off diffs from the tops and bottoms
>>>    //  of LeftOlder and RightNewer text files.
>>>    //
>>>    //  BB is a pointer to the start of a dynamic array of lines (
>>> pointers
>>>    );
>>>    //  EE points to the end of the array.
>>>    //
>>>    //  Already, BB and EE point to "diffs" (mismatches lines).
>>>    //   BB and  EE are from the LeftOlder file.
>>>    //  _BB and _EE are from the RightNewer file.
>>>
>>>    void Peel( LnA BB, LnA EE, LnA _BB, LnA _EE ) { int rv, S, _S, F,
>>> _F ;
>>>      LnP t, _t ;  LnA  BB_Slow, _BB_Slow, BB_Fast, _BB_Fast, EE_Slow,
>>>      _EE_Slow, EE_Fast , _EE_Fast, Mid = BB + ( EE - BB )/2, _Mid =
>>> _BB + (
>>>      _EE - _BB )/2 ; TopMatch = BtmMatch = 0, BB_Slow = BB, _BB_Slow
>>> = _BB
>>>      ; EE_Slow = EE, _EE_Slow = _EE, ReSetBB_Fast, ReSetEE_Fast ;
>>>
>>>      Top:    if ( TopMatch ) if ( BtmMatch ) goto Done ; else goto Btm ;
>>>              if ( Level = BB_Fast - BB_Slow, TopFlags, TopMatch =
>>> !S&&  !_S
>>>              ) {
>>
>> Ye gods!
>
> He doesn't work for anybody needing code.  That much is certain.
> Otherwise, he'd have been fired.
>

Indeed.  That code is full of constructs that exhibit UB.  Any
identifier with a leading underscore followed by an uppercase
letter is reserved to the implementation, and the use of such
identifiers is undefined.

[toc] | [prev] | [next] | [standalone]

#48096 — If you're retarded then, yes, _Loop() is "undefined".

red_floyd wrote:
> Any identifier with a leading underscore followed by an uppercase
> letter is reserved to the implementation, and the use of such
> identifiers is undefined.

If you're retarded then, yes, it's "undefined"; otherwise, no.

Hit Ctrl F3, to find the declaration of _Loop();
it's all in one .CPP file; no .H files were created.

[toc] | [prev] | [next] | [standalone]

#47817 — Re: I completely reWrote it, of course.

GreyCloud <mist@cumulus.com> writes:
>On 01/03/17 04:13, Peter Köhlmann wrote:
>> The worst "programmer" of all time babbled:
>>
>>> You ( MichaelMoroney ) wrote:
>>>> Gee, the code from the forged Relf looks better than
>>>> the code from the real Jeff.
>>>
>>> No one gives a shit about the C++ code I posted,
>>> nor should they, but it helps _me.
>>>
>>> Since then, I completely reWrote it, of course;
>>> I'm sure to change it again, as time goes by.
>>>
>>> Currently, it's:
>>>
>>>    //  ScreenShot:  http://Jeff-Relf.Me/Diff.PNG
>>>    //  Help/Settings:  http://Jeff-Relf.Me/X.HTM
>>>
>>>    //  Peel(), below, peels off diffs from the tops and bottoms
>>>    //  of LeftOlder and RightNewer text files.
>>>    //
>>>    //  BB is a pointer to the start of a dynamic array of lines ( pointers
>>>    );
>>>    //  EE points to the end of the array.
>>>    //
>>>    //  Already, BB and EE point to "diffs" (mismatches lines).
>>>    //   BB and  EE are from the LeftOlder file.
>>>    //  _BB and _EE are from the RightNewer file.
>>>
>>>    void Peel( LnA BB, LnA EE, LnA _BB, LnA _EE ) { int rv, S, _S, F, _F ;
>>>      LnP t, _t ;  LnA  BB_Slow, _BB_Slow, BB_Fast, _BB_Fast, EE_Slow,
>>>      _EE_Slow, EE_Fast , _EE_Fast, Mid = BB + ( EE - BB )/2, _Mid = _BB + (
>>>      _EE - _BB )/2 ; TopMatch = BtmMatch = 0, BB_Slow = BB, _BB_Slow = _BB
>>>      ; EE_Slow = EE, _EE_Slow = _EE, ReSetBB_Fast, ReSetEE_Fast ;
>>>
>>>      Top:    if ( TopMatch ) if ( BtmMatch ) goto Done ; else goto Btm ;
>>>              if ( Level = BB_Fast - BB_Slow, TopFlags, TopMatch = !S&&  !_S
>>>              ) {
>>
>> Ye gods!
>
>He doesn't work for anybody needing code.  That much is certain.
>Otherwise, he'd have been fired.
>

I dunno - I've seen similar code in shipping products:

For example (Product: ADSINP, language: BPL circa 1977):

DEFINE flip (x) = x := x NOT 1#,                 &FLIP 0/1              00223000
       inc (a,b,c,d,e,f,g,h,i,j,k) =                                    00224000
                a := a + IFF (b,b,1)                                    00225000
                IFF (c,+c) IFF (d,+d) IFF (e,+e) IFF (f,+f) IFF (g,+g)  00226000
                IFF (h,+h) IFF (i,+i) IFF (j,+j) IFF (k,+k)#,           00227000
       dinc (a,b) = inc (a,b,b)#,                                       00228000
       dec  (a,b,c,d,e,f,g,h,i,j,k) =                                   00229000
                a := a - IFF (b,b,1)                                    00230000
                IFF (c,-c) IFF (d,-d) IFF (e,-e) IFF (f,-f) IFF (g,-g)  00231000
                IFF (h,-h) IFF (i,-i) IFF (j,-j) IFF (k,-k)#,           00232000
       ddec (a,b) = dec (a,b,b)#,                                       00233000

or 

@PAGE&******************************************************************00136700
&***********************************************************************00136800
   PROCEDURE.CONVERT_DATE;                                              00136900
   BEGIN                                                                00137000
       OWN INTEGER DAYS_TO_DATE (65) :=                                 00137100
  36699335123051127410244092130818207152061210509104060030310200001;    00137200
       INTEGER TRASH (4),LOCAL_JULIAN_DATE(5);                          00137300
                                                                        00137400
       LOCAL_JULIAN_DATE := THE_JULIAN_DATE;                            00137500
       GREGORIAN_DATE.2.+6 := LOCAL_JULIAN_DATE.2;                      00137600
       IF LOCAL_JULIAN_DATE.3.+2 GEQ 60 THEN                            00137700
       BEGIN                                                            00137800
           TRASH := LOCAL_JULIAN_DATE.2 * 25;                           00137900
           IF TRASH.2.+2 NEQ 0 THEN                                     00138000
               LOCAL_JULIAN_DATE := LOCAL_JULIAN_DATE + 1;              00138100
       END;                                                             00138200
       SEARCH LOW DAYS_TO_DATE.3 THRU DAYS_TO_DATE.+65                  00138300
           FOR LOCAL_JULIAN_DATE.3.+2 INCREMENT 5;                      00138400
       GREGORIAN_DATE.2 := BASE.2.+3.IX1;                               00138500
       GREGORIAN_DATE.2.+3.NM := LOCAL_JULIAN_DATE.3.+2 - BASE.3.IX1;   00138600
   END; & CONVERT_DATE                                                  00138700

[toc] | [prev] | [next] | [standalone]

#47818 — Re: I completely reWrote it, of course.

Scott Lurndal wrote:

> some POS that calls itself "GreyCloud" wrote:
>>
>>He doesn't work for anybody needing code.  That much is certain.
>>Otherwise, he'd have been fired.
>
>I dunno - I've seen similar code in shipping products:
>
>For example (Product: ADSINP, language: BPL circa 1977):

I suppose that there are some clueless managers who are "impressed" by
impenetrable code.

-- 
"Or could it be that some ISPs are using the shitty linux servers that
draws in viruses and malware?   LOL!!!"  -  some POS that calls itself
"GreyCloud"

[toc] | [prev] | [next] | [standalone]

#47819 — Re: I completely reWrote it, of course.

chrisv <chrisv@nospam.invalid> writes:
>Scott Lurndal wrote:
>
>> some POS that calls itself "GreyCloud" wrote:
>>>
>>>He doesn't work for anybody needing code.  That much is certain.
>>>Otherwise, he'd have been fired.
>>
>>I dunno - I've seen similar code in shipping products:
>>
>>For example (Product: ADSINP, language: BPL circa 1977):
>
>I suppose that there are some clueless managers who are "impressed" by
>impenetrable code.

to be fair, in the 1970's, there were limits on pretty
much everything, including number of lines that a compiler could
handle in a reasonable amount of time given memory constraints.

Compact (dense) code was more the rule than the exception in those
days.

[toc] | [prev] | [next] | [standalone]

#47825 — The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

You ( Scott Lurndal ) replied:
> > > > He doesn't work for anybody needing code.
> > > > That much is certain.  Otherwise, he'd have been fired.
> > >
> > > I dunno - I've seen similar code in shipping products:
> > > For example (Product: ADSINP, language: BPL circa 1977):
> >
> > I suppose that there are some clueless managers 
> > who are "impressed" by impenetrable code.
> 
> to be fair, in the 1970's, there were limits on pretty
> much everything, including number of lines that a compiler could
> handle in a reasonable amount of time given memory constraints.
> 
> Compact (dense) code was more the rule 
> than the exception in those days.

My C++ is dense, 236 columns wide, and I'm running:

  Core i7-5775c, TeraBye SSD, 16 gigs of 1.9 gigaHz RAM,
  and an ArmMounted 4k UHD IPS monitor.

When I see sparse code, with lots of whitespace and comments,
I _immediately know the programmer is struggling.

P.S. Another day, another rewrite.
All the code that I posted here has been _trashed already.

Today, when I find the time, I plan on using 
the Longest Common Sequence ( NonContiguous ) algorithm ( recursive ); like:

  LCS( "ABCDE", "AEBDF" ) = Max( LCS( "ABCD", "AEBDF" ), LCS( "AEBD", "ABCDE" ) )
  LCS(  "ABCD",  "AEBD" ) = 1 + LCS( "ABC", "AEB" )

[toc] | [prev] | [next] | [standalone]

#47826 — Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

 wrote:

> You ( Scott Lurndal ) replied:
>> > > > He doesn't work for anybody needing code.
>> > > > That much is certain.  Otherwise, he'd have been fired.
>> > >
>> > > I dunno - I've seen similar code in shipping products:
>> > > For example (Product: ADSINP, language: BPL circa 1977):
>> >
>> > I suppose that there are some clueless managers
>> > who are "impressed" by impenetrable code.
>> 
>> to be fair, in the 1970's, there were limits on pretty
>> much everything, including number of lines that a compiler could
>> handle in a reasonable amount of time given memory constraints.
>> 
>> Compact (dense) code was more the rule
>> than the exception in those days.
> 
> My C++ is dense, 236 columns wide, and I'm running:
> 
>   Core i7-5775c, TeraBye SSD, 16 gigs of 1.9 gigaHz RAM,
>   and an ArmMounted 4k UHD IPS monitor.
> 
> When I see sparse code, with lots of whitespace and comments,
> I _immediately know the programmer is struggling.
> 
> P.S. Another day, another rewrite.
> All the code that I posted here has been _trashed already.
> 
> Today, when I find the time, I plan on using
> the Longest Common Sequence ( NonContiguous ) algorithm ( recursive );
> like:
> 
>   LCS( "ABCDE", "AEBDF" ) = Max( LCS( "ABCD", "AEBDF" ), LCS( "AEBD",
>   "ABCDE" ) )
>   LCS(  "ABCD",  "AEBD" ) = 1 + LCS( "ABC", "AEB" )

Idiot

[toc] | [prev] | [next] | [standalone]

#47833 — Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

Jeff-Relf.Me <@.> writes:

>All the code that I posted here has been _trashed already.

Yay! Relfie did something right for once!

[toc] | [prev] | [next] | [standalone]

#47834 — The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

You ( MichaelMoroney ) replied ( to me ):
> > All the code that I posted here has been _trashed already.
> 
> Yay! Relfie did something right for once!

Thanks, but it's just a refinement, not a big deal.

My guide:

  " Dynamic Programming | Set 4 (Longest Common Subsequence) "
  http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/

[toc] | [prev] | [next] | [standalone]

#47836 — Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

Jeff-Relf.Me <@.> in <Jeff-Relf.Me@Jan.4--10.26P.Seattle.2017> writes:

> You ( MichaelMoroney ) replied ( to me ):
>> > All the code that I posted here has been _trashed already.
>> 
>> Yay! Relfie did something right for once!
>
> Thanks, but it's just a refinement, not a big deal.
>
> My guide:
>
>   " Dynamic Programming | Set 4 (Longest Common Subsequence) "
>   http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/

Jeff, just out of curiosity: did you ever tried programming in Lisp or Forth?

[toc] | [prev] | [next] | [standalone]

#47837 — Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ).

Anonymous wrote:

> Jeff-Relf.Me <@.> in <Jeff-Relf.Me@Jan.4--10.26P.Seattle.2017> writes:
> 
>> You ( MichaelMoroney ) replied ( to me ):
>>> > All the code that I posted here has been _trashed already.
>>> 
>>> Yay! Relfie did something right for once!
>>
>> Thanks, but it's just a refinement, not a big deal.
>>
>> My guide:
>>
>>   " Dynamic Programming | Set 4 (Longest Common Subsequence) "
>>   http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/
> 
> Jeff, just out of curiosity: did you ever tried programming in Lisp or
> Forth?

Relf programmes in "Shit". And naturally writes shitty code

[toc] | [prev] | [next] | [standalone]

#47839 — PostScript is my thing.

You ( Anonymous ) asked me:
//  Jeff, just out of curiosity: did you ever tried programming in Lisp or Forth?

Lisp no ( not seriously ).  Forth/PostScript yes, -- big time.

PostScript is my thing.  WikiPedia says: ＜＜

  PostScript is an interpreted, stack-based language 
  similar to Forth but with strong dynamic typing, 
  data structures inspired by those found in Lisp, 
  scoped memory and, since language level 2, garbage collection.  ＞＞

  https://en.wikipedia.org/wiki/PostScript#The_language

[toc] | [prev] | [next] | [standalone]

#47868 — My diffs now _perfectly match MicroSoft's WinMerge.

I wrote:
> My guide: " Dynamic Programming | Set 4 (Longest Common Subsequence) "
>   http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/

As is turns out, the The Longest Common Sequence ( NonContiguous ) algorithm,
outlined above, works better than what I was using before.
It uses a table, not recursion; recursion overflows the stack.

My diffs now _perfectly match MicroSoft's WinMerge.
Now _any whitspace change, including blank lines, is flaged.
Now, certain odd cases produce smaller diffs, which is _nice.
Before, my sequence of LeftOlder diffs was slightly different from RightNewer.

The code:

  //  ScreenShot:  http://Jeff-Relf.Me/Diff.PNG
  //  Help/Settings:  http://Jeff-Relf.Me/X.HTM

  //  _FileCmp(), below, records thousands of matching lines ( text ),
  //  LeftOlder vs RightNewer, using the "LongestCommonSequence"
  //  ( shortest diffs ) algorithm.
  //  
  //  BB is a pointer to the start of 
  //  a dynamic array of ( contiguous ) pointers ( lines );
  //  PP points to the end of the array.
  //  
  //   BB and  PP are from the LeftOlder file.
  //  _BB and _PP are from the RightNewer file.

  _FileCmp( LnA BB, LnA _BB, LnA PP, LnA _PP, LnT &Ln ) { 

    int Rows = PP - BB + 1, Cols = _PP - _BB + 1 ;  u64 Row = Rows, Col = Cols ;

    //  Allocate a " LeftOlderLines * RightNewerLines " table of 32 bit integers
    //  to store all LongestCommonSequence Lengths.
 
    pInt _Table = (pInt)MallocTmp( Rows * Cols * szInt );
    { LoopRow( Rows ) { LoopCol( Cols ) { 

        if ( !Row || !Col ) { Table( Row, Col ) = 0 ;  continue ;  }
        if ( aMatch ) Table( Row, Col ) = Table( Row - 1, Col - 1 ) + 1 ; 
        else Table( Row, Col ) = ER( Table( Row, Col - 1 ), Table( Row - 1, Col ) );  } } }

    //  " Ln " is a dynamic array of thousands of ( contiguous ) 64 bit pointers,
    //  repurosed to store two 32 bit intergers ( Row and Col ) in a pointer.
    //  If both files are the same, with X Lines, it'll store X RowCol pairs.
    //  
    //  The first " StoreRowColumn ", below, stores the end of the files;
    //  the last is first, and vice versa; it's reversed.

    Zero( Ln ), StoreRowColumn;  
    while ( Row > 0 && Col > 0 ) 
      if ( aMatch ) StoreRowColumn ;
      else Table( Row, Col - 1 ) > Table( Row - 1, Col ) ? Col-- : Row-- ;  }


Near Globals:

  //  Access " _Table ", a One Dimensional array, as if it were Two Dimensional.
  #define  Table( i, j )  _Table[ ( j ) * Rows + i ]

  //  F[-1] is the ( 16 bit ) length of the leading whitespace.
  #define  aMatch  ( F = BB[ Row - 1 ], _F = _BB[ Col - 1 ], F[-1] == _F[-1] && Eq( F, _F ) )

  //  Store the matching lines as line numbers from LeftOlder and RightNewer 
  #define  StoreRowColumn  ( Inc( Ln ) = LnP( Row - 1 << 32 | Col - 1 ), Row--, Col-- )

  LnP  F, _F ;

Far Globals:

  #define  Zero( X )  memset( & X, 0, sizeof X )
  #define  Eq  !strCmp

  #define  LoopRows( N )  int  Row = -1, eRow = ( N ) - 1 ; while ( ++Row <= eRow )
  #define  LoopCols( N )  int  Col = -1, eCol = ( N ) - 1 ; while ( ++Col <= eCol )

  typedef wchar_t  wchar ;  typedef wchar  *LnP ;  typedef  LnP  *LnA ; 
  typedef int  *pInt ;  typedef void  *Void_P ;  typedef unsigned __int64  u64 ;
  const int  szInt = sizeof( int );

  struct  LnT { LnA  BB, PP, maxPP ;  };  LnT  Ln ;

  //  " Inc() ", below, dynamically allocates thousands of ( contiguous ) pointers.
  //  When diff is done, " Temp_Heap " is simply destroyed.

  template < typename TyT, typename TyA, typename TyP >
  TyP & Inc( TyT  & Xx, int N ) {  int I_PP, I_PP_New, I_maxPP, rv, Sz, Temp_Heap = N >= 0 ;  if ( !Temp_Heap ) N = 1 ;
    I_PP = !Xx.PP ? -1 : Xx.PP - Xx.BB, I_maxPP = !Xx.maxPP ? 0 : Xx.maxPP - Xx.BB, I_PP_New = I_PP + N ;  if( I_maxPP < 0 ) exit(1);
    if ( I_PP_New < I_maxPP ) {    OK:    return  Xx.PP = Xx.BB + I_PP_New, *Xx.PP ;  }
    rv = ER( 1024, 3 * I_PP_New ), Sz = 16 + rv * szPtr ; 
    Xx.maxPP = Xx.BB = TyA( Temp_Heap ? ReAllocTmp( Xx.BB, ++I_PP * szPtr, Sz ) : realloc( Xx.BB, Sz ) ), Xx.maxPP += rv ;
    if( !Xx.BB ) exit(1);  goto OK ;    }

  LnP &Inc( LnT &Ln ) { return Inc< LnT, LnA, LnP>( Ln,  1 ) ;  }

  LnP ReAllocTmp( Void_P B⁰, int Sz⁰, int Sz ) { Void_P  B = B⁰ ; if ( Sz > 0 && Sz > Sz⁰ ) B = MallocTmp( Sz );
    if ( B⁰ && Sz⁰ > 0 ) memmove( B, B⁰, Sz⁰ );  return LnP( B );  }

[toc] | [prev] | [next] | [standalone]

#47869 — Re: My diffs now _perfectly match MicroSoft's WinMerge.

 wrote:

> I wrote:
>> My guide: " Dynamic Programming | Set 4 (Longest Common Subsequence) "
>>   http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/
> 

< snip shitty code >

Just leave us alone with your shite. That garbage is not worth to be pissed 
on

[toc] | [prev] | [next] | [standalone]

#47872 — Re: My diffs now _perfectly match MicroSoft's WinMerge.

On Saturday, January 7, 2017 at 3:56:47 AM UTC-8, Jeff-Relf.Me wrote:

>   _FileCmp( LnA BB, LnA _BB, LnA PP, LnA _PP, LnT &Ln ) { 
> 
>     int Rows = PP - BB + 1, Cols = _PP - _BB + 1 ;  u64 Row = Rows, Col = Cols ;

This language has a passing resemblance to C++, but isn't C++.

Why are you posting in this group?

Jon

[toc] | [prev] | [next] | [standalone]

#47879 — Re: My diffs now _perfectly match MicroSoft's WinMerge.

Jeff-Relf.Me <@.> writes:

>My diffs now _perfectly match MicroSoft's WinMerge.
>Now _any whitspace change, including blank lines, is flaged.

While you continue to struggle getting your differences going, I
will continue using the differences code I have, which, although
ancient (but updated for modern computer advances), is based on a rather 
sophisticated algorithm.  It's recursive, but with memory measured in
gigabytes these days and efficient use of the stack, this is not a
problem.

It can turn on or off whether spaces/whitespace, character case, the
number of matching lines before a section after a mismatch is considered
matching, and how far to look ahead to look for a match etc.  It can even
produce editing output to produce merged sources so that if Person A makes
some source code changes implementing Change X, and Person B makes changes
to the same original code implementing Change Y, and Person C makes his
own changes Z to the same original code, I can easily produce code with
all three changes X, Y and Z in it.  Of course any changes to the same
area are flagged for special consideration, and there is never any
guarantee all changes are even compatible with each other, but it is a
huge headstart when the goal is to produce new code with changes X, Y and
Z in it.

Another nice feature is it doesn't run on Windows.

[toc] | [prev] | [next] | [standalone]

#47882 — Like a compiler that compiles itself, my Diff app diffs itself.

You ( Michael Moroney ) replied ( to me ):
> > My diffs now _perfectly match WinMerge's.
> > Now _any whitspace change, including blank lines, is flaged.
> 
> While you continue to struggle [[ with your Diff utility ]]

Like a compiler that compiles itself, my Diff app diffs itself;
I use it all day, everyday, year after year; for me, and only me,
there's nothing better; see:  http://Jeff-Relf.Me/Diff.PNG

> I will continue using the differences code I have, which, 
> although ancient ( but updated for modern computer advances ), 
> is based on a rather sophisticated algorithm.  
> 
> It's recursive, but with memory measured in gigabytes these days
> and efficient use of the stack, this is not a problem.

Cool, I _should try that; I'd have to up my stack limits, somehow;
if both files were the same, with X Lines, it'd recurse X times.
Oh great ! more work, thanks a lot.  ha ha

> It can turn on or off whether spaces/whitespace, character case, the
> number of matching lines before a section after a mismatch is considered
> matching, and how far to look ahead to look for a match etc.  

Interesting options, Thanks, but I'm not so sure I'd need them.

> It can even [[ compare/merge 3 versions ]]
> so that if Person A makes some source code changes implementing Change X, 
> and Person B makes changes to the same original code 
> implementing Change Y, and Person C makes his own changes, Z,
> to the same original code, I can easily produce code with
> all three changes X, Y and Z in it.
> 
> Of course any changes to the same area 
> are flagged for special consideration [...] 

Flagging/HighLighting what version ( not what author )
made what change, would be cool... nice idea, thanks.
More work !  I need to get outside more often, seriously.

> Another nice feature: it doesn't run on Windows.

The right tool for the right job, no ?

My Diff code ( posted ) is just a tool ( one of many ) in X.EXE/.CPP;
I run multiple copies of X.EXE all day, everyday, year after year; 
-- for me, and only me, there's nothing better.

[toc] | [prev] | [next] | [standalone]

#47918 — Re: My diffs now _perfectly match MicroSoft's WinMerge.

Am 07.01.17 um 21:25 schrieb Michael Moroney:
> It can turn on or off whether spaces/whitespace, character case, the
> number of matching lines before a section after a mismatch is considered
> matching, and how far to look ahead to look for a match etc.  It can even
> produce editing output to produce merged sources so that if Person A makes
> some source code changes implementing Change X, and Person B makes changes
> to the same original code implementing Change Y, and Person C makes his
> own changes Z to the same original code, I can easily produce code with
> all three changes X, Y and Z in it.  Of course any changes to the same
> area are flagged for special consideration, and there is never any
> guarantee all changes are even compatible with each other, but it is a
> huge headstart when the goal is to produce new code with changes X, Y and
> Z in it.


Sounds good.

> Another nice feature is it doesn't run on Windows.
>

what, git and GNU textutils don't run on Windows?

	Christian (has never felt the urge to reimplement diff algorithms)

[toc] | [prev] | [next] | [standalone]

#48098 — Text file comparison is essential.

Christian Gollwitzer wrote:
> I've never felt the urge to reimplement diff algorithms

The best code ( for me, and only me ) 
is the code I designed and wrote myself.

As a programmer, text file comparison is essential, like water;
so I wrote my own diff routines.

ScreenShot:  http://Jeff-Relf.Me/Diff.PNG
Help/Settings:  http://Jeff-Relf.Me/X.HTM

[toc] | [prev] | [next] | [standalone]

Page 2 of 7 — ← Prev page 1 [2] 3 4 5 6 7  Next page →

Back to top | Article view | comp.lang.c++

csiph-web