>>23-kun I am not >>19. Nevertheless, I'd love to help, but if help came, then everyone is going to want help. The thread has peacefully ended. Ended, it has peacefully.
struct Might look something like this..? plus/minus a lot probably,,
struct libEntity{
libEntity *E, *R, *L; //could be left & right (circular perhaps?), e is up/down?(maybe?)
};
struct entityPair{
libEntry *E, *R;}; //two linked objects? or two pieces of an object? E & R..?
if ( R ) //Got an E.R
{
Result = E->L; //Result E.L ?
R->L = Result; //Set E.R.L as result
}
else //Got no E.R
{
if ( P->R != E )
debugfail(254, "cglib/src/cylibdataentry.cpp");
//skip off to somewhere if P.R !=E
Result = E->L;
P->R = Result; //Same as if got an E.R
if ( R ) //Got an E.R
{
Result = E->L; //Result E.L ?
R->L = Result; //Set E.R.L as result
}
else //Got no E.R
{
if ( P->R != E )
debugfail(254, "cglib/src/cylibdataentry.cpp");
//skip off to somewhere if P.R !=E
Result = E->L;
P->R = Result; //Same as if got an E.R
>>22
What do you mean, "peacefully"? People here are still alive!
Name:
Anonymous2011-09-28 18:26
You know, I'm tempted to say it's part of the code of a self-balancing tree, maybe a red-black tree or a splay tree.
I'm a bit too drunk to be arsed to figure out exactly which step this does right now.
Name:
!!kCq+A64Losi56ze2011-09-28 19:57
>>1
Oh oh, I know what the codes does. Too bad all niggers and jews on here that work shirt hourly jobs don't know.
Name:
Anonymous2011-09-28 20:15
SLACKWARESUPREMACYSLACKWARESUPREMACY
Name:
Anonymous2011-09-28 20:18
>>43
You are too stupid to notice that
L = E->L;
if ( L )
{
L->R = E->R;
does list unlinking. But if I name the vars...
P = E->Prev;
if ( P )
{
P->Next = E->Next;
...now even niggers will understand the code.
Name:
Anonymous2011-09-28 20:21
>>42
Drunk out your mind? How can you still be a good programmer with your brain floating in alcohol?