#include<memory.h>
#include<unicode/BitArray.h>
BitArray::BitArray(int size){
  array = 0;
  this->size = size/8/4+1;
  if (size % 8 == 0 && size/8%4 == 0) this->size--;
}
BitArray::~BitArray(){
  if (array && int(array) != 1) delete[] array;
}
void BitArray::createArray(bool set){
  array = new int[size];
  memset(array, set?0xFF:0, size*sizeof(int));
}
void BitArray::setBit(int pos){
  if (!array) createArray();
  if (int(array) == 1) return;
  array[pos>>5] |= 1 << (pos&0x1f);
}
void BitArray::clearBit(int pos){
  if (!array) return;
  if (int(array) == 1) createArray(true);
  array[pos>>5] &= ~(1 << (pos&0x1f));
}
void BitArray::addRange(int s, int e){
  if (int(array) == 1) return;
  if (!array) createArray();
  int cs = s>>5;
  if (s&0x1f){
    int fillbytes = 0xFFFFFFFF << (s&0x1f);
    if ((e>>5) == (s>>5)) fillbytes &= 0xFFFFFFFF >> (0x1F - e&0x1F);
    array[cs] |= fillbytes;
    cs++;
  };
  int ce = e>>5;
  if (s>>5 != ce && (e&0x1f) != 0x1f){
    array[ce] |= 0xFFFFFFFF >> (0x1F - e&0x1F);
    ce--;
  };
  for(int idx = cs; idx <= ce; idx++)
    array[idx] = 0xFFFFFFFF;
  if (cs == 0 && ce == size-1){
    delete[] array;
    array = (int*)1;
  };
}
void BitArray::clearRange(int s, int e){
  if (!array) return;
  if (int(array) == 1) createArray(true);
  int cs = s>>5;
  if (s&0x1f){
    int fillbytes = 0xFFFFFFFF << (s&0x1f);
    if ((e&0x1F) == (s&0x1F)) fillbytes &= 0xFFFFFFFF >> (0x1F - e&0x1F);
    array[cs] &= ~fillbytes;
    cs++;
  };
  int ce = e>>5;
  if (s>>5 != ce && (e&0x1f) != 0x1f){
    array[ce] &= ~(0xFFFFFFFF >> (0x1F-(e&0x1F)));
    ce--;
  };
  for(int idx = cs; idx <= ce; idx++)
    array[idx] = 0x0;
  if (cs == 0 && ce == size-1){
    delete[] array;
    array = (int*)0;
  };
}
void BitArray::addBitArray(BitArray* ba){
  if (int(array) == 1) return;
  if (!ba || !ba->array) return;
  if (int(ba->array) == 1){
    array = (int*)1;
    return;
  };
  if (!array) createArray();
  for(int i = 0; i < size; i++)
    array[i] |= ba->array[i];
}
void BitArray::clearBitArray(BitArray* ba){
  if (array == null) return;
  if (ba == null || ba->array == null) return;
  if (int(array) == 1) createArray(true);
  if (int(ba->array) == 1){
    if (array != null) delete[] array;
    array = 0;
    return;
  };
  for(int i = 0; i < size; i++)
    array[i] &= ~ba->array[i];
}
void BitArray::intersectBitArray(BitArray*ba){
  if (array == null) return;
  if (ba == null || ba->array == null){
    delete[] array;
    array = 0;
    return;
  };
  if (int(ba->array) == 1) return;
  if (int(array) == 1) createArray(true);
  for(int i = 0; i < size; i++)
    array[i] &= ba->array[i];
}
void BitArray::addBitArray(char *bits, int size){
  if (int(array) == 1) return;
  if (!array) createArray();
  for(int i = 0; i < size && i < this->size*4;i++)
    ((char*)array)[i] |= bits[i];
}
void BitArray::clearBitArray(char *bits, int size){
  if (!array) return;
  if (int(array) == 1) createArray(true);
  for(int i = 0; i < size && i < this->size*4;i++)
    ((char*)array)[i] &= ~bits[i];
}
bool BitArray::getBit(int pos){
  if (!array) return false;
  if (int(array) == 1) return true;
  return (array[pos>>5] & (1<<(pos&0x1f))) != 0;
}
/* ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is the Colorer Library.
 *
 * The Initial Developer of the Original Code is
 * Cail Lomecb <cail@nm.ru>.
 * Portions created by the Initial Developer are Copyright (C) 1999-2003
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU General Public License Version 2 or later (the "GPL"), or
 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the MPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the MPL, the GPL or the LGPL.
 *
 * ***** END LICENSE BLOCK ***** */