BinaryGrayCode.cpp

Go to the documentation of this file.

 
 
// MIT License
//
// Copyright (c) 2023 Ian Parberry
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
 
#include <iostream>
 
#include "BinaryGrayCode.h"
 
 
void CBinaryGrayCode::Initialize(){ 
  for(size_t i=0; i<=m_nWidth+2; i++){
    m_nBit[i] = 0; //all zeros
    m_nStack[i] = i + 1; //recursion stack initial conditions
  } //for
} //initialize
 
 
size_t CBinaryGrayCode::Next(){
  const size_t i = m_nStack[0]; //bit to change
 
  m_nStack[0] = 1; 
  m_nBit[i] ^= 1; //change bit
  m_nStack[i - 1] = m_nStack[i];
  m_nStack[i] = i + 1;
 
  return i - 1; //return bit changed
} //Next
 
 
void CBinaryGrayCode::Print(){
  Initialize();
  size_t i = Next(); //current index
 
  while(i < m_nWidth){ //while not finished
    std::cout << i << std::endl;
    i = Next(); //next index
  } //while
} //Print