Skip to content

Update exorList.cpp #1

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ImSChan wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Update exorList.cpp #1

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
e678ec9
Update exorList.cpp
ImSChan Oct 4, 2023
4b93ff6
Update exorList.cpp
ImSChan Oct 4, 2023
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 8 additions & 8 deletions exorList.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -127,9 +127,9 @@ int IteratorCubePairNext();
////////////////////////////////////////////////////////////////////////
// the cube storage

// cube storage allocation/delocation
// cube storage allocation/deallocation
int AllocateCubeSets( int nVarsIn, int nVarsOut );
void DelocateCubeSets();
void DeallocateCubeSets();

// insert/extract a cube into/from the storage
void CubeInsert( Cube* p );
Expand All @@ -146,9 +146,9 @@ Cube* IterCubeSetNext();
////////////////////////////////////////////////////////////////////////
// cube adjacency queques

// adjacency queque allocation/delocation procedures
// adjacency queque allocation/deallocation procedures
int AllocateQueques( int nPlaces );
void DelocateQueques();
void DeallocateQueques();

// conditional adding cube pairs to queques
// reset temporarily stored new range of cube pairs
Expand Down Expand Up @@ -786,7 +786,7 @@ void UndoRecentChanges()
//static Cube* s_List;

///////////////////////////////////////////////////////////////////
/// Memory Allocation/Delocation ///
/// Memory Allocation/deallocation ///
///////////////////////////////////////////////////////////////////

int AllocateCubeSets( int nVarsIn, int nVarsOut )
Expand All @@ -813,7 +813,7 @@ int AllocateCubeSets( int nVarsIn, int nVarsOut )
return 4;
}

void DelocateCubeSets()
void DeallocateCubeSets()
{
}

Expand Down Expand Up @@ -1106,7 +1106,7 @@ int IteratorCubePairNext()
}

//////////////////////////////////////////////////////////////////////
// Allocation/Delocation //
// Allocation/deallocation //
//////////////////////////////////////////////////////////////////////

int AllocateQueques( int nPlaces )
Expand Down Expand Up @@ -1136,7 +1136,7 @@ int AllocateQueques( int nPlaces )
return nPlaces * (sizeof(Cube*) + sizeof(Cube*) + 2*sizeof(byte) );
}

void DelocateQueques()
void DeallocateQueques()
{
int i;
for ( i = 0; i < 3; i++ )
Expand Down