Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > sci.physics > #611294 > unrolled thread
| Started by | Jeff-Relf.Me <@.> |
|---|---|
| First post | 2017-01-01 23:51 -0800 |
| Last post | 2017-01-03 03:04 -0800 |
| Articles | 20 on this page of 61 — 19 participants |
Back to article view | Back to sci.physics
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.
#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. Double-A <double-a3@hush.com> - 2017-01-05 16:12 -0800
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 ). noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-04 16:33 -0800
Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-09 16:23 -0800
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. 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
Re: Text file comparison is essential. noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-17 11:22 -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: 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
Re: Health issues ? noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-17 14:19 -0800
Re: Health issues ? noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-17 18:44 -0800
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. noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-19 10:06 -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
yeah, you can always prefer your preferred header noTthaTguY <abu.kuanysh05@gmail.com> - 2017-01-19 21:22 -0800
The "Least Longest" diffs. Jeff-Relf.Me <@.> - 2017-01-03 03:04 -0800
Page 1 of 4 [1] 2 3 4 Next page →
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2017-01-01 23:51 -0800 |
| Subject | #define came from God himself, it's sacred. |
| Message-ID | <Jeff-Relf.Me@Jan.1--11.51P.Seattle.2017> |
#define came from God himself, it's sacred.
For example: At times, my code needs to set flags; to wit:
#define TopFlags ( S = BB_Slow <= EE_Slow, \
_S = _BB_Slow <= _EE_Slow, \
F = BB_Fast <= EE_Fast, \
_F = _BB_Fast <= _EE_Fast )
#define BtmFlags ( S = EE_Slow >= BB_Slow, \
_S = _EE_Slow >= _BB_Slow, \
F = EE_Fast >= BB_Fast, \
_F = _EE_Fast >= _BB_Fast )
I'd much rather see "TopFlags", in places, then the expansion.
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 ).
[ See X.EXE, X.HTM and X.CPP in http://Jeff-Relf.Me/X.ZIP ]
Diff scans ( comparing "Tokens"[*] ) from four directions at once
( LeftOlder: to Top, to Bottom; RightNewer: to Top, to Bottom ).
[ *: "Lines" in files, "Words" in lines ]
At it's heart, and right off the bat,
Diff skips unchanged Tokens at the start and/or end.
I call this "the Pinch".
Then it "peels off" MisMatches from the ends ( the "diffs" )...
Stopping when it finds MatchCount matches[*]...
Pinching and Peeling, from the edges to the middle.
[ *: MatchCount is 1 for normal, nearby matches,
not counting BlankLines. Otherwise, WhiteSpace matters. ]
The "diffs" are then sorted by line number and printed...
both the lines in the files and the words in the lines...
green for the new stuff, red for the old stuff.
This way, I can easily focus on the red and green words,
(mostly) ingnoring the rest.
Peel(), below, peels off diffs from the tops and bottoms
of LeftOlder and RightNewer text files.
BB is a pointer to 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 ;
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 ( TopFlags, TopMatch = !S && !_S ) {
// Done scaning the top of LeftOlder and RightNewer, no matches.
BB_Match = 0 ; goto Btm ; }
if ( F && _S ) if ( !gTopMatch( BB_Fast - BB_Slow, BB_Fast, EE, _BB_Slow, _EE ) ) BB_Fast++ ; else goto Btm ;
if ( _F && S ) if ( !gTopMatch( _BB_Fast - _BB_Slow, BB_Slow, EE, _BB_Fast, _EE ) ) _BB_Fast++ ; else goto Btm ;
// Lower the top of LeftOlder and RightNewer.
if ( TopFlags, !( F && _S || _F && S ) ) BB_Slow += S, _BB_Slow += _S, ReSetBB_Fast ; goto Btm ;
Btm: if ( BtmMatch ) if ( TopMatch ) goto Done ; else goto Top ;
if ( BtmFlags, BtmMatch = !S && !_S ) {
// Done scaning the bottom of LeftOlder and RightNewer, no matches.
EE_Match = 0 ; goto Top ; }
if ( F && _S ) if ( !gBtmMatch( EE_Slow - EE_Fast, BB, EE_Fast, _BB, _EE_Slow ) ) EE_Fast-- ; else goto Top ;
if ( _F && S ) if ( !gBtmMatch( _EE_Slow - _EE_Fast, BB, EE_Slow, _BB, _EE_Fast ) ) _EE_Fast-- ; else goto Top ;
// Raise the bottom of LeftOlder and RightNewer.
if ( BtmFlags, !( F && _S || _F && S ) ) EE_Slow -= S, _EE_Slow -= _S, ReSetEE_Fast ; goto Top ;
Done: BB_Match = BB_Match && EE_Match ? BB_Match : EE_Match ? ( _BB_Match = _EE_Match, EE_Match ) : ( _BB_Match = _EE, EE );
EE_Match = BB_Match && EE_Match ? EE_Match : BB_Match ? ( _EE_Match = _BB_Match, BB_Match ) : ( _EE_Match = _BB, BB ); }
Globals:
int TopMatch, BtmMatch ; LnP F, _F ;
LnA BBx, EEx, _BBx, _EEx, BB_Match, EE_Match, _BB_Match, _EE_Match ;
#define TokensMatch ( F && _F && F[-1] == _F[-1] && Eq( F, _F ) )
#define ReSetBB_Fast ( BB_Fast = BB_Slow, _BB_Fast = _BB_Slow )
#define ReSetEE_Fast ( EE_Fast = EE_Slow, _EE_Fast = _EE_Slow )
#define ShaveDown ( goDown( F, EEx, EE ), goDown( _F, _EEx, _EE ), TokensMatch )
#define PinchDown ( goDown( F, BBx, EE ), goDown( _F, _BBx, _EE ), TokensMatch )
#define goDown( P, PP, EE ) ( P = ++PP >= EE ? 0 : *PP )
int gTopMatch( int Wander, LnA BB, LnA EE, LnA _BB, LnA _EE ) {
BB_Match = EEx = BB, _BB_Match = _EEx = _BB, EEx--, _EEx-- ;
Loop( 1 + Wander/99 ) if ( ShaveDown ) eJ += !*F ; else return 0 ;
return TopMatch = 1 ; }
#define ShaveUp ( goUp( F, BBx, BB ), goUp( _F, _BBx, _BB ), TokensMatch )
#define PinchUp ( goUp( F, EEx, BBx ), goUp( _F, _EEx, _BBx ), TokensMatch )
#define goUp( P, PP, BB ) ( P = --PP < BB ? 0 : *PP )
int gBtmMatch( int Wander, LnA BB, LnA EE, LnA _BB, LnA _EE ) {
EE_Match = BBx = EE, _EE_Match = _BBx = _EE ;
Loop( 1 + Wander/99 ) if ( ShaveUp ) eJ += !*F ; else return 0 ;
return BtmMatch = 1 ; }
Far Globals:
#define Loop( N ) int eJ = ( N ) - 1, J = -1 ; while ( ++J <= eJ )
typedef wchar_t wchar ; typedef wchar *LnP ; typedef LnP *LnA ;
[toc] | [next] | [standalone]
| From | Jeff-Relf.Me <@..yep> |
|---|---|
| Date | 2017-01-02 08:00 +0000 |
| Message-ID | <ifte5e$kqd$e@alt.butts.pillow.biters> |
| In reply to | #611294 |
#define came from God himself, it's sacred. #define came from God
himself. Himself, it's sacred.
To set flags; to set flags; to set flags; to set flags; to wit: For
example: At times, my code needs to set flags; to set.
_EE_Slow <= EE_Fast <= EE_Fast, \ F = _BB_Slow <= _EE_Slow, \ F =
BB_Slow, \ _F = BB_Slow, \ _S = BB_Fast <= EE_Slow <= EE_Slow <=
_BB_Fast <= _BB_Slow <= EE_Slow <= _BB_Fast <= EE_Fast <= EE_Fast )
#define TopFlags ( S = _BB_Slow, \ _F = BB_Slow <= EE_Slow <=.
> = BB_Slow, \ F = _BB_Slow = BB_Fast, \ _S = _EE_Slow = _BB_Fast =
> BB_Slow, \ _F = EE_Slow, \ _F = _EE_Slow, \ _F = EE_Slow = BB_Slow =
> _BB_Slow = BB_Slow, \ F = EE_Slow = BB_Slow, \ _F = _BB_Fast =
> _BB_Fast ) #define BtmFlags ( S = EE_Slow = _EE_Slow.
I'd much rathen ther see "TopFlags", in places, ther see "TopFlags",
in places, then the. Expansion.
Wrote myself. The best code ( for me, and only me ) is the best code I
designed and wrote myself. The code ( for me, and. The best code ( for
me, and wrote myself.
So I wrote my own diff.PNG ). [ See X.CPP in http://Jeff-Relf.Me/X.ZIP
] As a programmer, text file comparison is essential, like water. So I
wrote my own. Routines ( ScreenShot: http://Jeff-Relf.Me/X.ZIP ] As a
programmer, text file comparison is essential, like water. So I wrote
my own diff routines ( ScreenShot: http://Jeff-Relf.Me/X.ZIP ] As a
programmer, text file comparison is essential, like water.
Four directions at once ( comparing "Tokens"[*] ) from four directions
( LeftOlder: to Top, to Top, to Top, to Top, to Top, to Top, to Top,
to Top, to Bottom four directions at once ( LeftOlder: to Top, to Top,
to Bottom; RightNewer: to Bottom; RightNewer: to Top, to Top, to Top,
to Top, to Top, to Bottom; RightNewer: to Top, to Top, to Bottom four.
Heart, Diff skips unch". I call the Pinchanged Tokens at the bat, and
right off the bat, and right off this "the start, Diff this "the
Pinch". At it's heart, and right off the bat, Diff. At it's heart, and
right off the bat, and/or end.
*: MatchCount is 1 for normal, nearby matches[*]. MisMatchCount
matters. [ *: Matches to the "diffs" ). Pinching when it finds ( the
ends ( therwise, WhiteSpace middle. Othe edges from the ends ( the
middle. Stopping and Peels off" MisMatches, nearby matters. Stopping
and Peels off" MisMatchCount is 1 for not count matchCount matches,
nearby matchCount. Stopping, from the ends ( the ends ( the ends ( the
edges from the ends Matches from the "diffs" ). Othe ends ( the ends (
the "diffs" ). Stopping when it "peels off" MisMatches[*].
Both the old stuff, red by lines. Both the new stuff, red by line
number and the "diffs" are the words in the words in the words in then
sorted by line number and the number and then sorted by line number
and printed. Both the words in the old stuff, red by lines in the new
stuff, red by lines. Both the lines in then sorted.
This way, I can easily focus on the rest. This way. This way, I can
easily focus on the red and green words, (mostly) ing the red and
green words, (mostly) ing the rest. Rest.
Peel(), below, peels off diffs from the tops and RightNewer and
bottoms of LeftOlder. RightNewer and RightNewer and bottoms of
LeftOlder and RightNewer and bottoms of LeftOlder and RightNewer text
files.
BB is a pointers ); EE pointer to start of a pointer to the end.
Pointers ); EE points to start of a pointer to start of a points to
the end of lines ( pointer to start of a points to start of a dynamic
array.
BB and EE point to "diffs" (mismatches. Lines). BB and EE point to
"diffs" (mismatches lines). Already, BB and EE point to "diffs"
(mismatches lines). BB and EE are from the LeftOlder file. BB and _EE
are from the LeftOlder file. Already, BB and _EE point to "diffs"
(mismatches lines).
Peel( LnP t, EE, _BB, LnA BB_Slow, BB, _EE ) { int rv, S, _F ; LnA
BB_Slow, _F ; void Peel( LnA _BB_Fast ; LnA BB, _t ; LnA _BB, EE_Slow
= BtmMatch = 0, BB_Fast, _EE_Fast ; TopMatch = _BB_Slow, _BB, EE_Fast,
EE_Fast, _t ; LnA _BB, _BB_Slow = BB_Fast, _EE_Slow, BB_Slow, _BB_Slow
= EE, LnA EE, _BB_Slow = EE_Fast, EE, _EE_Slow = BtmMatch = _BB_Fast,
EE, ReSetEE_Fast, EE_Slow, _EE_Fast, _S, _EE_Slow, BB_Slow, _BB_Slow,
_F ; LnA _EE_Slow, _BB, LnA BB, LnA BB_Slow = EE_Slow = BtmMatch =
BtmMatch = BB_Slow = BB_Fast, _BB_Slow = EE_Fast, _BB_Fast, _BB,
_BB_Slow.
TopFlags, TopMatch ) if ( BtmMatch ) goto Done ; else goto Done ; else
goto BtmMatch ) if ( Btm ; else goto Done ; else goto Done ; else goto
Btm ; else goto BtmMatch ) goto BtmMatch ) if ( TopMatch ) if (
TopFlags.
BB_Match = 0 ; goto Btm ; } // Done scaning the top of LeftOlder and
RightNewer, no matches. BB_Matches. BB_Match = 0 ; goto. Top of
LeftOlder and RightNewer, no matches. BB_Matches.
If ( !gTopMatch( _F && S ) if ( _BB_Fast, EE, _BB_Slow, EE, _BB_Fast -
_BB_Slow, BB_Fast++ ; if ( _F && S ) BB_Slow, _BB_Fast - BB_Fast++ ;
else goto Btm ; if ( F && S ) if ( _BB_Fast - BB_Slow, BB_Fast, EE,
_BB_Fast - _BB_Fast++ ; else goto Btm ; else goto Btm ; else goto Btm
; else goto Btm ; if ( _F && S ) if ( _F && _S ) BB_Fast - _BB_Slow,
BB_Fast, EE, _EE ) BB_Slow, _BB_Fast, EE, _BB_Slow, BB_Fast - BB_Slow,
_EE.
RightNewer. If ( TopFlags, !( F && _S || _F && _S ||. If ( TopFlags,
!( F && _S, _BB_Slow += S, ReSetBB_Slow += S, _BB_Slow += S,
ReSetBB_Slow += S, _BB_Slow += S, _BB_Slow += S, _BB_Slow += _S,
ReSetBB_Slow += _S || _F && S ) BB_Slow += S, ReSetBB_Slow += S,
_BB_Slow += S, _BB_Fast ; goto Btm ; // Lower.
Goto Done ; if ( BtmMatch ) if ( BtmMatch = !S && !_S ) goto Done ; if
( BtmMatch ) goto TopMatch ) goto Done ; else goto TopMatch ) if (
TopMatch = !S && !_S ) if ( Btm: if ( BtmMatch ) { BtmMatch = !S &&
!_S ) {.
EE_Match. 0 ; goto Top ; goto Top ; } // Done scaning the bottom of
LeftOlder and RightNewer, no match = 0 ; goto Top ; goto Top ; } //
Done scaning the bottom of LeftOlder and RightNewer, no matches.
_EE_Slow, _BB, EE_Fast, BB, _BB, _EE_Slow - EE_Slow ) if ( !gBtmMatch(
EE_Fast, BB, _BB, EE_Slow ) if ( F && _S ) EE_Fast-- ; else goto Top ;
else goto Top ; else goto Top ; else goto Top ; else goto Top ; else
goto Top ; if ( !gBtmMatch( _F && _S ) if ( !gBtmMatch( EE_Fast ) if (
F && _S ) if ( F && _S ) _EE_Fast-- ; else goto Top ; else goto Top ;
else goto Top ; else goto Top ; else goto Top ; if ( F && _S ).
If ( BtmFlags, !( F && _S, ReSetEE_Slow -= _S || _F && S ) EE_Slow -=
_S || _F && _S || _F && _S || _F && S ) EE_Slow -= S, ReSetEE_Slow -=
_S || _F && _S || _F && _S, _EE_Slow -= S, _EE_Slow -= S, ReSetEE_Slow
-= S, ReSetEE_Fast. goto Top ; // Raise the bottom of LeftOlder and
RightNewer.
_EE, EE ); } Done: BB_Match = _BB_Match, EE_Match : BB_Match =
_EE_Match = _EE_Match : BB_Match ) : ( _EE, EE ); EE_Match ? (
_BB_Match = BB_Match = _EE_Match, EE_Match ) : BB_Match = _BB_Match )
: BB_Match : EE_Match : ( _EE_Match : ( _BB_Match ? BB_Match =
BB_Match = BB_Match ? ( _BB_Match = _BB_Match = BB_Match ? EE_Match,
EE ); EE_Match ? BB_Match ) : ( _EE, EE_Match ? ( _EE_Match &&
EE_Match = BB_Match ? EE_Match ? ( _BB_Match ? BB_Match ? BB_Match =
BB_Match = _BB_Match = BB_Match.
Globals:
LnP F, _BB_Match, EEx, _EEx, _BBx, BtmMatch, BtmMatch ; int TopMatch,
_BB_Match ; LnP F, _BB_Match, BB_Match ; LnP F, _EEx, _F ; LnA BBx,
BtmMatch, _BBx, EEx, BtmMatch, _BBx, BtmMatch, BtmMatch.
EE_Fast ( BB_Fast = EE_Fast = BB_Fast = _F[-1] && _F[-1] == _EE_Slow,
_F && _F[-1] && _F ) #define TokensMatch ( F, _F[-1] == _BB_Fast (
BB_Fast = EE_Slow, _F[-1] && Eq( F && _F && _F && Eq( F, _F && Eq( F
&& _F ) #define ReSetEE_Slow ) #define TokensMatch ( F && F[-1] ==
_EE_Fast = BB_Slow, _BB_Slow, _F[-1] == _EE_Fast = _F[-1] == _EE_Fast
( F && _F && _F ) #define TokensMatch.
_BBx, EE ), TokensMatch ) #define PinchDown ( goDown( P = ++PP )
#define goDown( F, _EE ? 0 : *PP ) #define PinchDown( F, EE ), goDown(
F, _EE ? 0 : *PP >= EE ), TokensMatch ) ( goDown( _F, _EE ), goDown(
F, _EEx, EE ), TokensMatch ) #define PinchDown( _F, BBx, EE ) #define
goDown( F, EE ), TokensMatch ) #define PinchDown ( goDown( F, EE ),
goDown ( goDown( P, EEx, _EEx, EE ), goDown ( goDown( F, BBx, EEx, EE
? 0 : *PP >= EEx, EE.
_BB, LnA BB_Match = EEx = EEx-- ; else return TopMatch( int Wander,
LnA BB, LnA _EEx = BB_Match( int Wander, LnA _BB, EEx--, _BB, _EEx--,
_BB_Match = _BB, LnA EE, LnA BB, EEx = _EEx = BB, EEx = _EE ) if (
ShaveDown ) { BB_Match( int gTopMatch( int Wander, LnA BB, LnA _EEx--,
_BB_Match = BB, LnA EEx--, _BB, LnA _EE ) eJ += !*F ; Loop( 1 +
Wander/99 ) eJ += !*F ; else return 0 ; else return TopMatch = _EEx =
_BB, LnA EE, LnA BB_Match =.
*PP < BB ? 0 : *PP < BB ) #define goUp( F, _BB ), goUp( F, _EEx, BBx,
_BBx, _EEx, _BB ? 0 : *PP < BB ), TokensMatch ) #define PinchUp (
goUp( F, _EEx, _BBx, _EEx, BB ), goUp( P, BBx, _BBx ), goUp( _F, EEx,
_EEx, _BB ), TokensMatch ) ( goUp( P = --PP ) #define PinchUp ( goUp(
_F, _BB ), goUp( _F, EEx, BBx ), TokensMatch ) #define goUp( _F, _BBx,
_BB ), TokensMatch ) #define PinchUp ( goUp( _F, EEx, _BB ), goUp(.
GBtmMatch = 1 + Wander, LnA BB, LnA _EE_Match = _EE ) if ( ShaveUp )
if ( ShaveUp ) { EE_Match = EE, LnA _EE_Match( int gBtmMatch = 1 +
Wander/99 ) { EE_Match( int gBtmMatch = _BB, LnA _BB, LnA BB, LnA BBx
= _BB, LnA EE, LnA EE_Match( int Wander, LnA _BB, LnA EE, _EE ) eJ +=
!*F ; Loop( 1 + Wander, LnA _BB, LnA EE, LnA _EE_Match = EE_Match =
EE_Match = _BBx = EE, _EE_Match = _BB, LnA BBx = EE_Match( int.
Gls: Globalobals: Falobals:s:.
While ( ++J <= eJ ) - 1, J = ( N ) - 1, J = ( N ) int eJ ) int eJ ) -
1, J = ( ++J <= eJ = ( ++J <= eJ = ( ++J <= eJ ) - 1, J = ( N ) - 1.
Wchar *LnP ; typedef wchar_t wchar ; typedef wchar_t wchar *LnP ;
typedef LnP ; typedef wchar ; typedef.
[toc] | [prev] | [next] | [standalone]
| From | moroney@world.std.spaamtrap.com (Michael Moroney) |
|---|---|
| Date | 2017-01-03 03:58 +0000 |
| Message-ID | <o4f7ht$g4p$2@pcls7.std.com> |
| In reply to | #611295 |
Gee, the code from the forged Relf looks better than the code from the real Jeff.
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2017-01-03 00:46 -0800 |
| Subject | I completely reWrote it, of course. |
| Message-ID | <Jeff-Relf.Me@Jan.3--0.46A.Seattle.2017> |
| In reply to | #611434 |
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 ) {
// Done scaning the top of LeftOlder and RightNewer, no matches.
BB_Match = 0 ; goto Btm ; }
if ( F && _S ) if ( !gTopMatch( BB_Fast, EE, _BB_Slow, _EE ) ) BB_Fast++ ; else goto Btm ;
if ( _F && S ) if ( !gTopMatch( BB_Slow, EE, _BB_Fast, _EE ) ) _BB_Fast++ ; else goto Btm ;
// Lower the top of LeftOlder and RightNewer, thus growing a pair of diffs.
if ( TopFlags, !( F && _S || _F && S ) ) BB_Slow += S, _BB_Slow += _S, ReSetBB_Fast ; goto Btm ;
Btm: if ( BtmMatch ) if ( TopMatch ) goto Done ; else goto Top ;
if ( Level = EE_Slow - EE_Fast, BtmFlags, BtmMatch = !S && !_S ) {
// Done scaning the bottom of LeftOlder and RightNewer, no matches.
EE_Match = 0 ; goto Top ; }
if ( F && _S ) if ( !gBtmMatch( EE_Fast, BB, _EE_Slow, _BB ) ) EE_Fast-- ; else goto Top ;
if ( _F && S ) if ( !gBtmMatch( EE_Slow, BB, _EE_Fast, _BB ) ) _EE_Fast-- ; else goto Top ;
// Raise the bottom of LeftOlder and RightNewer, thus growing a pair of diffs.
if ( BtmFlags, !( F && _S || _F && S ) ) EE_Slow -= S, _EE_Slow -= _S, ReSetEE_Fast ; goto Top ;
Done: BB_Match = BB_Match && EE_Match ? BB_Match : EE_Match ? ( _BB_Match = _EE_Match, EE_Match ) : ( _BB_Match = _EE, EE );
EE_Match = BB_Match && EE_Match ? EE_Match : BB_Match ? ( _EE_Match = _BB_Match, BB_Match ) : ( _EE_Match = _BB, BB ); }
Near Globals:
int Level, TopMatch, BtmMatch ; LnP F, _F ;
LnA BBx, EEx, _BBx, _EEx, BB_Match, EE_Match, _BB_Match, _EE_Match ;
#define TokensMatch ( F && _F && F[-1] == _F[-1] && Eq( F, _F ) )
#define ReSetBB_Fast ( BB_Fast = BB_Slow, _BB_Fast = _BB_Slow )
#define ReSetEE_Fast ( EE_Fast = EE_Slow, _EE_Fast = _EE_Slow )
#define MatchDwn ( _MatchDwn( F, PP, EE ), _MatchDwn( _F, _PP, _EE ), TopMatch = TokensMatch )
#define _MatchDwn( P, PP, EE ) ( P = ++PP >= EE ? 0 : *PP )
#define MatchUp ( _MatchUp( F, PP, BB ), _MatchUp( _F, _PP, _BB ), BtmMatch = TokensMatch )
#define _MatchUp( P, PP, BB ) ( P = --PP < BB ? 0 : *PP )
int gTopMatch( LnA PP, LnA EE, LnA _PP, LnA _EE ) { BB_Match = PP, _BB_Match = _PP, PP--, _PP-- ;
// For nearby comparisons, One Match ( not counting blank lines ) is good;
// more matches are needed when "zooming out" hundreds of lines.
Loop( 1 + Level/99 ) eJ += !MatchDwn ? -eJ : !*F ; return TopMatch ; }
int gBtmMatch( LnA PP, LnA BB, LnA _PP, LnA _BB ) { EE_Match = PP, _EE_Match = _PP ;
Loop( 1 + Level/99 ) eJ += !MatchUp ? -eJ : !*F ; return BtmMatch ; }
Pinch( LnA BB, LnA EE, LnA _BB, LnA _EE ) {
LnA PP = BB - 1, _PP = _BB - 1 ; while ( MatchDwn );
BBx = BB = PP, _BBx = _BB = _PP, PP = EE, _PP = _EE ;
while ( MatchUp ); EEx = ++PP, _EEx = ++_PP ; }
#define TopFlags ( S = BB_Slow <= Mid, _S = _BB_Slow <= _Mid, F = BB_Fast <= Mid, _F = _BB_Fast <= _Mid )
#define BtmFlags ( S = EE_Slow >= Mid, _S = _EE_Slow >= _Mid, F = EE_Fast >= Mid, _F = _EE_Fast >= _Mid )
Far Globals:
#define Loop( N ) int eJ = ( N ) - 1, J = -1 ; while ( ++J <= eJ )
typedef wchar_t wchar ; typedef wchar *LnP ; typedef LnP *LnA ;
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@..sour> |
|---|---|
| Date | 2017-01-03 08:51 +0000 |
| Subject | I completely reWrote it, of course. |
| Message-ID | <7D29485E.49E84ABC@Robinia.Shakespearei.Pallida> |
| In reply to | #611466 |
؛ ɐuן* duן ɟǝpǝdʎʇ ؛ duן* ɹɐɥɔʍ ɟǝpǝdʎʇ ؛ ɹɐɥɔʍ ʇ‾ɹɐɥɔʍ ɟǝpǝdʎʇ
( ɾǝ => ɾ++ ) ǝןıɥʍ ؛ Ɩ- = ɾ 'Ɩ - ( u ) = ɾǝ ʇuı ( u )dooן ǝuıɟǝp#
:sןɐqoןb ɹɐɟ
( pıɯ‾ =< ʇsɐɟ‾ǝǝ‾ = ɟ‾ 'pıɯ =< ʇsɐɟ‾ǝǝ = ɟ 'pıɯ‾ =< ʍoןs‾ǝǝ‾ = s‾ 'pıɯ =< ʍoןs‾ǝǝ = s ) sbɐןɟɯʇq ǝuıɟǝp#
( pıɯ‾ => ʇsɐɟ‾qq‾ = ɟ‾ 'pıɯ => ʇsɐɟ‾qq = ɟ 'pıɯ‾ => ʍoןs‾qq‾ = s‾ 'pıɯ => ʍoןs‾qq = s ) sbɐןɟdoʇ ǝuıɟǝp#
{ ؛ dd‾++ = xǝǝ‾ 'dd++ = xǝǝ ؛( dnɥɔʇɐɯ ) ǝןıɥʍ
؛ ǝǝ‾ = dd‾ 'ǝǝ = dd 'dd‾ = qq‾ = xqq‾ 'dd = qq = xqq
؛( uʍpɥɔʇɐɯ ) ǝןıɥʍ ؛ Ɩ - qq‾ = dd‾ 'Ɩ - qq = dd ɐuן
} ( ǝǝ‾ ɐuן 'qq‾ ɐuן 'ǝǝ ɐuן 'qq ɐuן )ɥɔuıd
{ ؛ ɥɔʇɐɯɯʇq uɹnʇǝɹ ؛ ɟ*¡ : ɾǝ- ¿ dnɥɔʇɐɯ¡ =+ ɾǝ ( 66/ןǝʌǝן + Ɩ )dooן
؛ dd‾ = ɥɔʇɐɯ‾ǝǝ‾ 'dd = ɥɔʇɐɯ‾ǝǝ } ( qq‾ ɐuן 'dd‾ ɐuן 'qq ɐuן 'dd ɐuן )ɥɔʇɐɯɯʇqb ʇuı
{ ؛ ɥɔʇɐɯdoʇ uɹnʇǝɹ ؛ ɟ*¡ : ɾǝ- ¿ uʍpɥɔʇɐɯ¡ =+ ɾǝ ( 66/ןǝʌǝן + Ɩ )dooן
˙sǝuıן ɟo spǝɹpunɥ „ʇno buıɯooz„ uǝɥʍ pǝpǝǝu ǝɹɐ sǝɥɔʇɐɯ ǝɹoɯ //
؛poob sı ( sǝuıן ʞuɐןq buıʇunoɔ ʇou ) ɥɔʇɐɯ ǝuo 'suosıɹɐdɯoɔ ʎqɹɐǝu ɹoɟ //
؛ --dd‾ '--dd 'dd‾ = ɥɔʇɐɯ‾qq‾ 'dd = ɥɔʇɐɯ‾qq } ( ǝǝ‾ ɐuן 'dd‾ ɐuן 'ǝǝ ɐuן 'dd ɐuן )ɥɔʇɐɯdoʇb ʇuı
( dd* : 0 ¿ qq > dd-- = d ) ( qq 'dd 'd )dnɥɔʇɐɯ‾ ǝuıɟǝp#
( ɥɔʇɐɯsuǝʞoʇ = ɥɔʇɐɯɯʇq '( qq‾ 'dd‾ 'ɟ‾ )dnɥɔʇɐɯ‾ '( qq 'dd 'ɟ )dnɥɔʇɐɯ‾ ) dnɥɔʇɐɯ ǝuıɟǝp#
( dd* : 0 ¿ ǝǝ =< dd++ = d ) ( ǝǝ 'dd 'd )uʍpɥɔʇɐɯ‾ ǝuıɟǝp#
( ɥɔʇɐɯsuǝʞoʇ = ɥɔʇɐɯdoʇ '( ǝǝ‾ 'dd‾ 'ɟ‾ )uʍpɥɔʇɐɯ‾ '( ǝǝ 'dd 'ɟ )uʍpɥɔʇɐɯ‾ ) uʍpɥɔʇɐɯ ǝuıɟǝp#
( ʍoןs‾ǝǝ‾ = ʇsɐɟ‾ǝǝ‾ 'ʍoןs‾ǝǝ = ʇsɐɟ‾ǝǝ ) ʇsɐɟ‾ǝǝʇǝsǝɹ ǝuıɟǝp#
( ʍoןs‾qq‾ = ʇsɐɟ‾qq‾ 'ʍoןs‾qq = ʇsɐɟ‾qq ) ʇsɐɟ‾qqʇǝsǝɹ ǝuıɟǝp#
( ( ɟ‾ 'ɟ )bǝ && [Ɩ-]ɟ‾ == [Ɩ-]ɟ && ɟ‾ && ɟ ) ɥɔʇɐɯsuǝʞoʇ ǝuıɟǝp#
؛ ɥɔʇɐɯ‾ǝǝ‾ 'ɥɔʇɐɯ‾qq‾ 'ɥɔʇɐɯ‾ǝǝ 'ɥɔʇɐɯ‾qq 'xǝǝ‾ 'xqq‾ 'xǝǝ 'xqq ɐuן
؛ ɟ‾ 'ɟ duן ؛ ɥɔʇɐɯɯʇq 'ɥɔʇɐɯdoʇ 'ןǝʌǝן ʇuı
:sןɐqoןb ɹɐǝu
{ ؛( qq 'qq‾ = ɥɔʇɐɯ‾ǝǝ‾ ) : ( ɥɔʇɐɯ‾qq 'ɥɔʇɐɯ‾qq‾ = ɥɔʇɐɯ‾ǝǝ‾ ) ¿ ɥɔʇɐɯ‾qq : ɥɔʇɐɯ‾ǝǝ ¿ ɥɔʇɐɯ‾ǝǝ && ɥɔʇɐɯ‾qq = ɥɔʇɐɯ‾ǝǝ
؛( ǝǝ 'ǝǝ‾ = ɥɔʇɐɯ‾qq‾ ) : ( ɥɔʇɐɯ‾ǝǝ 'ɥɔʇɐɯ‾ǝǝ‾ = ɥɔʇɐɯ‾qq‾ ) ¿ ɥɔʇɐɯ‾ǝǝ : ɥɔʇɐɯ‾qq ¿ ɥɔʇɐɯ‾ǝǝ && ɥɔʇɐɯ‾qq = ɥɔʇɐɯ‾qq :ǝuop
؛ doʇ oʇob ؛ ʇsɐɟ‾ǝǝʇǝsǝɹ 's‾ =- ʍoןs‾ǝǝ‾ 's =- ʍoןs‾ǝǝ ( ( s && ɟ‾ || s‾ && ɟ )¡ 'sbɐןɟɯʇq ) ɟı
˙sɟɟıp ɟo ɹıɐd ɐ buıʍoɹb snɥʇ 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo ɯoʇʇoq ǝɥʇ ǝsıɐɹ //
؛ doʇ oʇob ǝsןǝ ؛ --ʇsɐɟ‾ǝǝ‾ ( ( qq‾ 'ʇsɐɟ‾ǝǝ‾ 'qq 'ʍoןs‾ǝǝ )ɥɔʇɐɯɯʇqb¡ ) ɟı ( s && ɟ‾ ) ɟı
؛ doʇ oʇob ǝsןǝ ؛ --ʇsɐɟ‾ǝǝ ( ( qq‾ 'ʍoןs‾ǝǝ‾ 'qq 'ʇsɐɟ‾ǝǝ )ɥɔʇɐɯɯʇqb¡ ) ɟı ( s‾ && ɟ ) ɟı
{ ؛ doʇ oʇob ؛ 0 = ɥɔʇɐɯ‾ǝǝ
˙sǝɥɔʇɐɯ ou 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo ɯoʇʇoq ǝɥʇ buıuɐɔs ǝuop //
} ( s‾¡ && s¡ = ɥɔʇɐɯɯʇq 'sbɐןɟɯʇq 'ʇsɐɟ‾ǝǝ - ʍoןs‾ǝǝ = ןǝʌǝן ) ɟı
؛ doʇ oʇob ǝsןǝ ؛ ǝuop oʇob ( ɥɔʇɐɯdoʇ ) ɟı ( ɥɔʇɐɯɯʇq ) ɟı :ɯʇq
؛ ɯʇq oʇob ؛ ʇsɐɟ‾qqʇǝsǝɹ 's‾ =+ ʍoןs‾qq‾ 's =+ ʍoןs‾qq ( ( s && ɟ‾ || s‾ && ɟ )¡ 'sbɐןɟdoʇ ) ɟı
˙sɟɟıp ɟo ɹıɐd ɐ buıʍoɹb snɥʇ 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo doʇ ǝɥʇ ɹǝʍoן //
؛ ɯʇq oʇob ǝsןǝ ؛ ++ʇsɐɟ‾qq‾ ( ( ǝǝ‾ 'ʇsɐɟ‾qq‾ 'ǝǝ 'ʍoןs‾qq )ɥɔʇɐɯdoʇb¡ ) ɟı ( s && ɟ‾ ) ɟı
؛ ɯʇq oʇob ǝsןǝ ؛ ++ʇsɐɟ‾qq ( ( ǝǝ‾ 'ʍoןs‾qq‾ 'ǝǝ 'ʇsɐɟ‾qq )ɥɔʇɐɯdoʇb¡ ) ɟı ( s‾ && ɟ ) ɟı
{ ؛ ɯʇq oʇob ؛ 0 = ɥɔʇɐɯ‾qq
˙sǝɥɔʇɐɯ ou 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo doʇ ǝɥʇ buıuɐɔs ǝuop //
} ( s‾¡ && s¡ = ɥɔʇɐɯdoʇ 'sbɐןɟdoʇ 'ʍoןs‾qq - ʇsɐɟ‾qq = ןǝʌǝן ) ɟı
؛ ɯʇq oʇob ǝsןǝ ؛ ǝuop oʇob ( ɥɔʇɐɯɯʇq ) ɟı ( ɥɔʇɐɯdoʇ ) ɟı :doʇ
؛ ʇsɐɟ‾ǝǝʇǝsǝɹ 'ʇsɐɟ‾qqʇǝsǝɹ 'ǝǝ‾ = ʍoןs‾ǝǝ‾ 'ǝǝ = ʍoןs‾ǝǝ
؛ qq‾ = ʍoןs‾qq‾ 'qq = ʍoןs‾qq '0 = ɥɔʇɐɯɯʇq = ɥɔʇɐɯdoʇ
؛ ᄅ/( qq‾ - ǝǝ‾ ) + qq‾ = pıɯ‾ 'ᄅ/( qq - ǝǝ ) + qq = pıɯ 'ʇsɐɟ‾ǝǝ‾ '
ʇsɐɟ‾ǝǝ 'ʍoןs‾ǝǝ‾ 'ʍoןs‾ǝǝ 'ʇsɐɟ‾qq‾ 'ʇsɐɟ‾qq 'ʍoןs‾qq‾ 'ʍoןs‾qq ɐuן ؛ ʇ‾ 'ʇ duן
؛ ɟ‾ 'ɟ 's‾ 's 'ʌɹ ʇuı } ( ǝǝ‾ ɐuן 'qq‾ ɐuן 'ǝǝ ɐuן 'qq ɐuן )ןǝǝd pıoʌ
˙ǝןıɟ ɹǝʍǝuʇɥbıɹ ǝɥʇ ɯoɹɟ ǝɹɐ ǝǝ‾ puɐ qq‾ //
˙ǝןıɟ ɹǝpןoʇɟǝן ǝɥʇ ɯoɹɟ ǝɹɐ ǝǝ puɐ qq //
˙(sǝuıן sǝɥɔʇɐɯsıɯ) „sɟɟıp„ oʇ ʇuıod ǝǝ puɐ qq 'ʎpɐǝɹןɐ //
//
˙ʎɐɹɹɐ ǝɥʇ ɟo puǝ ǝɥʇ oʇ sʇuıod ǝǝ //
؛( sɹǝʇuıod ) sǝuıן ɟo ʎɐɹɹɐ ɔıɯɐuʎp ɐ ɟo ʇɹɐʇs ǝɥʇ oʇ ɹǝʇuıod ɐ sı qq //
//
˙sǝןıɟ ʇxǝʇ ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo //
sɯoʇʇoq puɐ sdoʇ ǝɥʇ ɯoɹɟ sɟɟıp ɟɟo sןǝǝd 'ʍoןǝq '()ןǝǝd //
ɯʇɥ˙x/ǝɯ˙ɟןǝɹ-ɟɟǝɾ//:dʇʇɥ :sbuıʇʇǝs/dןǝɥ //
bud˙ɟɟıp/ǝɯ˙ɟןǝɹ-ɟɟǝɾ//:dʇʇɥ :ʇoɥsuǝǝɹɔs //
:s,ʇı 'ʎןʇuǝɹɹnɔ
˙ʎq sǝob ǝɯıʇ sɐ 'uıɐbɐ ʇı ǝbuɐɥɔ oʇ ǝɹns ɯ,ı
؛ǝsɹnoɔ ɟo 'ʇı ǝʇoɹʍǝɹ ʎןǝʇǝןdɯoɔ ı 'uǝɥʇ ǝɔuıs
˙ǝɯ‾ sdןǝɥ ʇı ʇnq 'ʎǝɥʇ pןnoɥs ɹou
'pǝʇsod ı ǝpoɔ ++ɔ ǝɥʇ ʇnoqɐ ʇıɥs ɐ sǝʌıb ǝuo ou
˙ɟɟǝɾ ןɐǝɹ ǝɥʇ ɯoɹɟ ǝpoɔ ǝɥʇ <
uɐɥʇ ɹǝʇʇǝq sʞooן ɟןǝɹ pǝbɹoɟ ǝɥʇ ɯoɹɟ ǝpoɔ ǝɥʇ 'ǝǝb <
:ǝʇoɹʍ ( ʎǝuoɹoɯןǝɐɥɔıɯ ) noʎ
[toc] | [prev] | [next] | [standalone]
| From | Double-A <double-a3@hush.com> |
|---|---|
| Date | 2017-01-05 16:12 -0800 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <45cfbca7-d655-408e-80a5-8c52e7b9f139@googlegroups.com> |
| In reply to | #611467 |
On Tuesday, January 3, 2017 at 12:51:59 AM UTC-8, Jeff-Relf.Me wrote:
> ؛ ɐuן* duן ɟǝpǝdʎʇ ؛ duן* ɹɐɥɔʍ ɟǝpǝdʎʇ ؛ ɹɐɥɔʍ ʇ‾ɹɐɥɔʍ ɟǝpǝdʎʇ
>
> ( ɾǝ => ɾ++ ) ǝןıɥʍ ؛ Ɩ- = ɾ 'Ɩ - ( u ) = ɾǝ ʇuı ( u )dooן ǝuıɟǝp#
>
> :sןɐqoןb ɹɐɟ
>
> ( pıɯ‾ =< ʇsɐɟ‾ǝǝ‾ = ɟ‾ 'pıɯ =< ʇsɐɟ‾ǝǝ = ɟ 'pıɯ‾ =< ʍoןs‾ǝǝ‾ = s‾ 'pıɯ =< ʍoןs‾ǝǝ = s ) sbɐןɟɯʇq ǝuıɟǝp#
> ( pıɯ‾ => ʇsɐɟ‾qq‾ = ɟ‾ 'pıɯ => ʇsɐɟ‾qq = ɟ 'pıɯ‾ => ʍoןs‾qq‾ = s‾ 'pıɯ => ʍoןs‾qq = s ) sbɐןɟdoʇ ǝuıɟǝp#
>
> { ؛ dd‾++ = xǝǝ‾ 'dd++ = xǝǝ ؛( dnɥɔʇɐɯ ) ǝןıɥʍ
> ؛ ǝǝ‾ = dd‾ 'ǝǝ = dd 'dd‾ = qq‾ = xqq‾ 'dd = qq = xqq
> ؛( uʍpɥɔʇɐɯ ) ǝןıɥʍ ؛ Ɩ - qq‾ = dd‾ 'Ɩ - qq = dd ɐuן
> } ( ǝǝ‾ ɐuן 'qq‾ ɐuן 'ǝǝ ɐuן 'qq ɐuן )ɥɔuıd
>
> { ؛ ɥɔʇɐɯɯʇq uɹnʇǝɹ ؛ ɟ*¡ : ɾǝ- ¿ dnɥɔʇɐɯ¡ =+ ɾǝ ( 66/ןǝʌǝן + Ɩ )dooן
> ؛ dd‾ = ɥɔʇɐɯ‾ǝǝ‾ 'dd = ɥɔʇɐɯ‾ǝǝ } ( qq‾ ɐuן 'dd‾ ɐuן 'qq ɐuן 'dd ɐuן )ɥɔʇɐɯɯʇqb ʇuı
>
> { ؛ ɥɔʇɐɯdoʇ uɹnʇǝɹ ؛ ɟ*¡ : ɾǝ- ¿ uʍpɥɔʇɐɯ¡ =+ ɾǝ ( 66/ןǝʌǝן + Ɩ )dooן
> ˙sǝuıן ɟo spǝɹpunɥ „ʇno buıɯooz„ uǝɥʍ pǝpǝǝu ǝɹɐ sǝɥɔʇɐɯ ǝɹoɯ //
> ؛poob sı ( sǝuıן ʞuɐןq buıʇunoɔ ʇou ) ɥɔʇɐɯ ǝuo 'suosıɹɐdɯoɔ ʎqɹɐǝu ɹoɟ //
>
> ؛ --dd‾ '--dd 'dd‾ = ɥɔʇɐɯ‾qq‾ 'dd = ɥɔʇɐɯ‾qq } ( ǝǝ‾ ɐuן 'dd‾ ɐuן 'ǝǝ ɐuן 'dd ɐuן )ɥɔʇɐɯdoʇb ʇuı
>
> ( dd* : 0 ¿ qq > dd-- = d ) ( qq 'dd 'd )dnɥɔʇɐɯ‾ ǝuıɟǝp#
> ( ɥɔʇɐɯsuǝʞoʇ = ɥɔʇɐɯɯʇq '( qq‾ 'dd‾ 'ɟ‾ )dnɥɔʇɐɯ‾ '( qq 'dd 'ɟ )dnɥɔʇɐɯ‾ ) dnɥɔʇɐɯ ǝuıɟǝp#
>
> ( dd* : 0 ¿ ǝǝ =< dd++ = d ) ( ǝǝ 'dd 'd )uʍpɥɔʇɐɯ‾ ǝuıɟǝp#
> ( ɥɔʇɐɯsuǝʞoʇ = ɥɔʇɐɯdoʇ '( ǝǝ‾ 'dd‾ 'ɟ‾ )uʍpɥɔʇɐɯ‾ '( ǝǝ 'dd 'ɟ )uʍpɥɔʇɐɯ‾ ) uʍpɥɔʇɐɯ ǝuıɟǝp#
>
> ( ʍoןs‾ǝǝ‾ = ʇsɐɟ‾ǝǝ‾ 'ʍoןs‾ǝǝ = ʇsɐɟ‾ǝǝ ) ʇsɐɟ‾ǝǝʇǝsǝɹ ǝuıɟǝp#
> ( ʍoןs‾qq‾ = ʇsɐɟ‾qq‾ 'ʍoןs‾qq = ʇsɐɟ‾qq ) ʇsɐɟ‾qqʇǝsǝɹ ǝuıɟǝp#
> ( ( ɟ‾ 'ɟ )bǝ && [Ɩ-]ɟ‾ == [Ɩ-]ɟ && ɟ‾ && ɟ ) ɥɔʇɐɯsuǝʞoʇ ǝuıɟǝp#
>
> ؛ ɥɔʇɐɯ‾ǝǝ‾ 'ɥɔʇɐɯ‾qq‾ 'ɥɔʇɐɯ‾ǝǝ 'ɥɔʇɐɯ‾qq 'xǝǝ‾ 'xqq‾ 'xǝǝ 'xqq ɐuן
> ؛ ɟ‾ 'ɟ duן ؛ ɥɔʇɐɯɯʇq 'ɥɔʇɐɯdoʇ 'ןǝʌǝן ʇuı
>
> :sןɐqoןb ɹɐǝu
>
>
> { ؛( qq 'qq‾ = ɥɔʇɐɯ‾ǝǝ‾ ) : ( ɥɔʇɐɯ‾qq 'ɥɔʇɐɯ‾qq‾ = ɥɔʇɐɯ‾ǝǝ‾ ) ¿ ɥɔʇɐɯ‾qq : ɥɔʇɐɯ‾ǝǝ ¿ ɥɔʇɐɯ‾ǝǝ && ɥɔʇɐɯ‾qq = ɥɔʇɐɯ‾ǝǝ
> ؛( ǝǝ 'ǝǝ‾ = ɥɔʇɐɯ‾qq‾ ) : ( ɥɔʇɐɯ‾ǝǝ 'ɥɔʇɐɯ‾ǝǝ‾ = ɥɔʇɐɯ‾qq‾ ) ¿ ɥɔʇɐɯ‾ǝǝ : ɥɔʇɐɯ‾qq ¿ ɥɔʇɐɯ‾ǝǝ && ɥɔʇɐɯ‾qq = ɥɔʇɐɯ‾qq :ǝuop
>
> ؛ doʇ oʇob ؛ ʇsɐɟ‾ǝǝʇǝsǝɹ 's‾ =- ʍoןs‾ǝǝ‾ 's =- ʍoןs‾ǝǝ ( ( s && ɟ‾ || s‾ && ɟ )¡ 'sbɐןɟɯʇq ) ɟı
> ˙sɟɟıp ɟo ɹıɐd ɐ buıʍoɹb snɥʇ 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo ɯoʇʇoq ǝɥʇ ǝsıɐɹ //
>
> ؛ doʇ oʇob ǝsןǝ ؛ --ʇsɐɟ‾ǝǝ‾ ( ( qq‾ 'ʇsɐɟ‾ǝǝ‾ 'qq 'ʍoןs‾ǝǝ )ɥɔʇɐɯɯʇqb¡ ) ɟı ( s && ɟ‾ ) ɟı
> ؛ doʇ oʇob ǝsןǝ ؛ --ʇsɐɟ‾ǝǝ ( ( qq‾ 'ʍoןs‾ǝǝ‾ 'qq 'ʇsɐɟ‾ǝǝ )ɥɔʇɐɯɯʇqb¡ ) ɟı ( s‾ && ɟ ) ɟı
>
> { ؛ doʇ oʇob ؛ 0 = ɥɔʇɐɯ‾ǝǝ
> ˙sǝɥɔʇɐɯ ou 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo ɯoʇʇoq ǝɥʇ buıuɐɔs ǝuop //
>
> } ( s‾¡ && s¡ = ɥɔʇɐɯɯʇq 'sbɐןɟɯʇq 'ʇsɐɟ‾ǝǝ - ʍoןs‾ǝǝ = ןǝʌǝן ) ɟı
> ؛ doʇ oʇob ǝsןǝ ؛ ǝuop oʇob ( ɥɔʇɐɯdoʇ ) ɟı ( ɥɔʇɐɯɯʇq ) ɟı :ɯʇq
>
> ؛ ɯʇq oʇob ؛ ʇsɐɟ‾qqʇǝsǝɹ 's‾ =+ ʍoןs‾qq‾ 's =+ ʍoןs‾qq ( ( s && ɟ‾ || s‾ && ɟ )¡ 'sbɐןɟdoʇ ) ɟı
> ˙sɟɟıp ɟo ɹıɐd ɐ buıʍoɹb snɥʇ 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo doʇ ǝɥʇ ɹǝʍoן //
>
> ؛ ɯʇq oʇob ǝsןǝ ؛ ++ʇsɐɟ‾qq‾ ( ( ǝǝ‾ 'ʇsɐɟ‾qq‾ 'ǝǝ 'ʍoןs‾qq )ɥɔʇɐɯdoʇb¡ ) ɟı ( s && ɟ‾ ) ɟı
> ؛ ɯʇq oʇob ǝsןǝ ؛ ++ʇsɐɟ‾qq ( ( ǝǝ‾ 'ʍoןs‾qq‾ 'ǝǝ 'ʇsɐɟ‾qq )ɥɔʇɐɯdoʇb¡ ) ɟı ( s‾ && ɟ ) ɟı
>
> { ؛ ɯʇq oʇob ؛ 0 = ɥɔʇɐɯ‾qq
> ˙sǝɥɔʇɐɯ ou 'ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo doʇ ǝɥʇ buıuɐɔs ǝuop //
>
> } ( s‾¡ && s¡ = ɥɔʇɐɯdoʇ 'sbɐןɟdoʇ 'ʍoןs‾qq - ʇsɐɟ‾qq = ןǝʌǝן ) ɟı
> ؛ ɯʇq oʇob ǝsןǝ ؛ ǝuop oʇob ( ɥɔʇɐɯɯʇq ) ɟı ( ɥɔʇɐɯdoʇ ) ɟı :doʇ
>
> ؛ ʇsɐɟ‾ǝǝʇǝsǝɹ 'ʇsɐɟ‾qqʇǝsǝɹ 'ǝǝ‾ = ʍoןs‾ǝǝ‾ 'ǝǝ = ʍoןs‾ǝǝ
> ؛ qq‾ = ʍoןs‾qq‾ 'qq = ʍoןs‾qq '0 = ɥɔʇɐɯɯʇq = ɥɔʇɐɯdoʇ
> ؛ ᄅ/( qq‾ - ǝǝ‾ ) + qq‾ = pıɯ‾ 'ᄅ/( qq - ǝǝ ) + qq = pıɯ 'ʇsɐɟ‾ǝǝ‾ '
> ʇsɐɟ‾ǝǝ 'ʍoןs‾ǝǝ‾ 'ʍoןs‾ǝǝ 'ʇsɐɟ‾qq‾ 'ʇsɐɟ‾qq 'ʍoןs‾qq‾ 'ʍoןs‾qq ɐuן ؛ ʇ‾ 'ʇ duן
> ؛ ɟ‾ 'ɟ 's‾ 's 'ʌɹ ʇuı } ( ǝǝ‾ ɐuן 'qq‾ ɐuן 'ǝǝ ɐuן 'qq ɐuן )ןǝǝd pıoʌ
>
> ˙ǝןıɟ ɹǝʍǝuʇɥbıɹ ǝɥʇ ɯoɹɟ ǝɹɐ ǝǝ‾ puɐ qq‾ //
> ˙ǝןıɟ ɹǝpןoʇɟǝן ǝɥʇ ɯoɹɟ ǝɹɐ ǝǝ puɐ qq //
> ˙(sǝuıן sǝɥɔʇɐɯsıɯ) „sɟɟıp„ oʇ ʇuıod ǝǝ puɐ qq 'ʎpɐǝɹןɐ //
> //
> ˙ʎɐɹɹɐ ǝɥʇ ɟo puǝ ǝɥʇ oʇ sʇuıod ǝǝ //
> ؛( sɹǝʇuıod ) sǝuıן ɟo ʎɐɹɹɐ ɔıɯɐuʎp ɐ ɟo ʇɹɐʇs ǝɥʇ oʇ ɹǝʇuıod ɐ sı qq //
> //
> ˙sǝןıɟ ʇxǝʇ ɹǝʍǝuʇɥbıɹ puɐ ɹǝpןoʇɟǝן ɟo //
> sɯoʇʇoq puɐ sdoʇ ǝɥʇ ɯoɹɟ sɟɟıp ɟɟo sןǝǝd 'ʍoןǝq '()ןǝǝd //
>
> ɯʇɥ˙x/ǝɯ˙ɟןǝɹ-ɟɟǝɾ//:dʇʇɥ :sbuıʇʇǝs/dןǝɥ //
> bud˙ɟɟıp/ǝɯ˙ɟןǝɹ-ɟɟǝɾ//:dʇʇɥ :ʇoɥsuǝǝɹɔs //
>
> :s,ʇı 'ʎןʇuǝɹɹnɔ
>
> ˙ʎq sǝob ǝɯıʇ sɐ 'uıɐbɐ ʇı ǝbuɐɥɔ oʇ ǝɹns ɯ,ı
> ؛ǝsɹnoɔ ɟo 'ʇı ǝʇoɹʍǝɹ ʎןǝʇǝןdɯoɔ ı 'uǝɥʇ ǝɔuıs
>
> ˙ǝɯ‾ sdןǝɥ ʇı ʇnq 'ʎǝɥʇ pןnoɥs ɹou
> 'pǝʇsod ı ǝpoɔ ++ɔ ǝɥʇ ʇnoqɐ ʇıɥs ɐ sǝʌıb ǝuo ou
>
> ˙ɟɟǝɾ ןɐǝɹ ǝɥʇ ɯoɹɟ ǝpoɔ ǝɥʇ <
> uɐɥʇ ɹǝʇʇǝq sʞooן ɟןǝɹ pǝbɹoɟ ǝɥʇ ɯoɹɟ ǝpoɔ ǝɥʇ 'ǝǝb <
> :ǝʇoɹʍ ( ʎǝuoɹoɯןǝɐɥɔıɯ ) noʎ
I once wrote a program to reverse lines of characters. There actually was a practical use of it in reproducing decks of punch cards (and ancient form of storing data) without the system recognizing system commands. Later IBM introduce an assembly instruction to do it in one command!
Double-A
[toc] | [prev] | [next] | [standalone]
| From | Peter Köhlmann <peter-koehlmann@t-online.de> |
|---|---|
| Date | 2017-01-03 12:13 +0100 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <o4g0ub$nmq$1@dont-email.me> |
| In reply to | #611466 |
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!
[toc] | [prev] | [next] | [standalone]
| From | Melzzzzz <mel@zzzzz.com> |
|---|---|
| Date | 2017-01-03 12:28 +0100 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <20170103122847.45f37efb@maxa-pc> |
| In reply to | #611470 |
On Tue, 03 Jan 2017 12:13:42 +0100
Peter Köhlmann <peter-koehlmann@t-online.de> 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!
I think that he is insane...
--
press any key to continue or any other to quit...
[toc] | [prev] | [next] | [standalone]
| From | chrisv <chrisv@nospam.invalid> |
|---|---|
| Date | 2017-01-03 07:32 -0600 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <vg9n6c5k4viehgoo44h414k1o13qfsoirt@4ax.com> |
| In reply to | #611470 |
Peter Köhlmann wrote:
> The worst "programmer" of all time babbled:
>>
>> 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!
If "Ezekiel" was here, and you said that the above code was crap, he
would demand "facts and a code analysis". LOL
The kreep even claimed that it was "ignorant" to say that Relf's
statements eschewing the importance of compliler warnings were
"stupid".
I couldn't make this stuff up!
Ezekreep was a trolling fsckwit, if ever there was one. Apparently,
he thought that he could beat us with his lies.
--
"For some reason the mindless droids here equate anything open source
with somehow being technically superior." - trolling fsckwit
"Ezekiel", lying shamelessly
[toc] | [prev] | [next] | [standalone]
| From | GreyCloud <mist@cumulus.com> |
|---|---|
| Date | 2017-01-03 12:16 -0700 |
| Subject | Ezekiel lives in your head RENT FREE!! LOL!!! |
| Message-ID | <o4gt7t$t5b$13@dont-email.me> |
| In reply to | #611481 |
On 01/03/17 06:32, chrisv wrote:
> Peter Köhlmann wrote:
>
>> The worst "programmer" of all time babbled:
>>>
>>> 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!
>
> If "Ezekiel" was here, and you said that the above code was crap, he
> would demand "facts and a code analysis". LOL
>
> The kreep even claimed that it was "ignorant" to say that Relf's
> statements eschewing the importance of compliler warnings were
> "stupid".
>
> I couldn't make this stuff up!
>
> Ezekreep was a trolling fsckwit, if ever there was one. Apparently,
> he thought that he could beat us with his lies.
>
[toc] | [prev] | [next] | [standalone]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2017-01-03 13:00 -0800 |
| Subject | With "warnings as errors", turn off these warnings. |
| Message-ID | <Jeff-Relf.Me@Jan.3--1.00P.Seattle.2017> |
| In reply to | #611481 |
You two ( ChrisV and Peter Köhlmann ) keep telling us:
Turn on _all warnings; all else is _foolish/_noobish.
With "warnings as errors", turn off these warnings:
C4100: unreferenced parameter.
C4101: unreferenced local variable.
C4189: local variable is initialized but not referenced.
Variables gets comment out, at times, when debugging.
UnUsed code is informative, and might be needed again.
Other C++ Coding Rules:
http://Jeff-Relf.Me/C++CodingRules.HTM
[toc] | [prev] | [next] | [standalone]
| From | GreyCloud <mist@cumulus.com> |
|---|---|
| Date | 2017-01-03 12:16 -0700 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <o4gt6q$t5b$12@dont-email.me> |
| In reply to | #611470 |
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]
| From | red floyd <dont.bother@its.invalid> |
|---|---|
| Date | 2017-01-03 12:30 -0800 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <o4h1if$ho8$1@dont-email.me> |
| In reply to | #611503 |
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]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2017-01-16 11:06 -0800 |
| Subject | If you're retarded then, yes, _Loop() is "undefined". |
| Message-ID | <Jeff-Relf.Me@Jan.16--11.06A.Seattle.2017> |
| In reply to | #611516 |
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]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2017-01-04 13:33 +0000 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <2R6bA.141713$iI2.2839@fx07.iad> |
| In reply to | #611503 |
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]
| From | chrisv <chrisv@nospam.invalid> |
|---|---|
| Date | 2017-01-04 07:45 -0600 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <vrup6cp8gegehcqkbnnfi4gkf05tf1qtda@4ax.com> |
| In reply to | #611632 |
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]
| From | scott@slp53.sl.home (Scott Lurndal) |
|---|---|
| Date | 2017-01-04 14:54 +0000 |
| Subject | Re: I completely reWrote it, of course. |
| Message-ID | <T08bA.190083$mI2.177601@fx08.iad> |
| In reply to | #611633 |
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]
| From | Jeff-Relf.Me <@.> |
|---|---|
| Date | 2017-01-04 10:17 -0800 |
| Subject | The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). |
| Message-ID | <Jeff-Relf.Me@Jan.4--10.17A.Seattle.2017> |
| In reply to | #611640 |
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]
| From | Peter Köhlmann <peter-koehlmann@t-online.de> |
|---|---|
| Date | 2017-01-04 19:19 +0100 |
| Subject | Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). |
| Message-ID | <o4je96$ufm$2@dont-email.me> |
| In reply to | #611665 |
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]
| From | noTthaTguY <abu.kuanysh05@gmail.com> |
|---|---|
| Date | 2017-01-04 16:33 -0800 |
| Subject | Re: The Longest Common Sequence ( NonContiguous ) algorithm ( recursive ). |
| Message-ID | <7975bbde-5ef2-4023-ad16-f70e1d87b747@googlegroups.com> |
| In reply to | #611666 |
any way, most folks use those little what-you-call'ems, the makers, what ever language they use a lot
[toc] | [prev] | [next] | [standalone]
Page 1 of 4 [1] 2 3 4 Next page →
Back to top | Article view | sci.physics
csiph-web