Brought up to date with the private repository (feea4c7)

This commit is contained in:
S committed 2026-10-14 20:57:33 +03:00
1 parent 1aa738d692
commit 1b1df1ae48
7925 files changed
+2617237 -20

No files matched your search

@@ -0,0 +1,65 @@
package com.sbi.bit
{
public class BitField
{
private var _bitField:uint;
public function BitField(param1:uint = 0)
{
super();
_bitField = param1;
}
public function updateBitField(param1:uint, param2:BitWiseOperator) : void
{
switch(param2)
{
case BitWiseOperator.AND:
_bitField &= param1;
break;
case BitWiseOperator.OR:
_bitField |= param1;
break;
case BitWiseOperator.XOR:
_bitField ^= param1;
break;
case BitWiseOperator.NOT:
_bitField = ~_bitField;
}
}
public function setBit(param1:uint, param2:Boolean) : Boolean
{
if(param1 < 0 || param1 > 31)
{
throw new Error("Attempted to set bit outside of normal range. bit=" + param1);
}
var _loc3_:uint = _bitField;
if(param2)
{
_bitField |= 1 << param1;
}
else
{
_bitField &= ~(1 << param1);
}
return _loc3_ != _bitField;
}
public function isBitSet(param1:uint) : Boolean
{
if(param1 < 0 || param1 > 31)
{
throw new Error("Attempted to read bit outside of normal range. bit=" + param1);
}
return (_bitField & 1 << param1) != 0;
}
public function getInt() : uint
{
return _bitField;
}
}
}
@@ -0,0 +1,146 @@
package com.sbi.bit
{
public class BitUtility
{
public function BitUtility()
{
super();
}
public static function isBitSetForNumber(param1:int, param2:Number) : Boolean
{
if(param2 == -1)
{
return false;
}
if((param2 >> param1 & 1) == 1)
{
return true;
}
return false;
}
public static function leftShiftNumbers(param1:int) : Number
{
var _loc2_:Boolean = false;
if(param1 == 31)
{
param1--;
_loc2_ = true;
}
var _loc3_:Number = 1 << param1;
if(_loc2_)
{
_loc3_ *= 2;
}
if(param1 > 31)
{
_loc3_ = Number("0x" + _loc3_.toString(16) + "00000000");
}
return _loc3_;
}
public static function rightShiftNumber(param1:Number) : Number
{
var _loc2_:String = null;
var _loc3_:String = null;
var _loc4_:String = null;
if(param1 > 4294967295)
{
_loc2_ = param1.toString(2);
_loc3_ = _loc2_.substr(0,_loc2_.length - 32);
_loc4_ = _loc2_.substr(_loc2_.length - 32);
_loc4_ = _loc3_.charAt(_loc3_.length - 1) + _loc4_.substr(0,_loc4_.length - 1);
_loc3_ = _loc3_.substr(0,_loc3_.length - 1);
if(_loc3_ == "")
{
_loc3_ = "0";
}
return Number("0x" + _loc3_ + "00000000") + parseInt(_loc4_,2);
}
return param1 >>> 1;
}
public static function bitwiseAnd(param1:Number, param2:Number) : Number
{
var _loc3_:String = null;
var _loc9_:* = 0;
var _loc6_:* = 0;
var _loc8_:* = 0;
var _loc4_:* = 0;
var _loc7_:* = 0;
var _loc5_:Number = NaN;
if(param1 < 1073741824 && param2 < 1073741824)
{
return param1 & param2;
}
_loc3_ = param1.toString(2);
_loc9_ = uint(_loc3_.length > 32 ? parseInt(_loc3_.substr(0,_loc3_.length - 32),2) : 0);
_loc6_ = uint(parseInt(_loc3_.substr(_loc3_.length > 32 ? _loc3_.length - 32 : 0),2));
_loc3_ = param2.toString(2);
_loc8_ = uint(_loc3_.length > 32 ? parseInt(_loc3_.substr(0,_loc3_.length - 32),2) : 0);
_loc4_ = uint(parseInt(_loc3_.substr(_loc3_.length > 32 ? _loc3_.length - 32 : 0),2));
_loc7_ = uint(_loc6_ & _loc4_);
_loc5_ = Number("0x" + (_loc9_ & _loc8_).toString(16) + "00000000");
return _loc7_ + _loc5_;
}
public static function bitwiseOr(param1:Number, param2:Number) : Number
{
var _loc3_:String = null;
var _loc9_:* = 0;
var _loc6_:* = 0;
var _loc8_:* = 0;
var _loc4_:* = 0;
var _loc7_:* = 0;
var _loc5_:Number = NaN;
if(param1 < 1073741824 && param2 < 1073741824)
{
return param1 | param2;
}
_loc3_ = param1.toString(2);
_loc9_ = uint(_loc3_.length > 32 ? parseInt(_loc3_.substr(0,_loc3_.length - 32),2) : 0);
_loc6_ = uint(parseInt(_loc3_.substr(_loc3_.length > 32 ? _loc3_.length - 32 : 0),2));
_loc3_ = param2.toString(2);
_loc8_ = uint(_loc3_.length > 32 ? parseInt(_loc3_.substr(0,_loc3_.length - 32),2) : 0);
_loc4_ = uint(parseInt(_loc3_.substr(_loc3_.length > 32 ? _loc3_.length - 32 : 0),2));
_loc7_ = uint(_loc6_ | _loc4_);
_loc5_ = Number("0x" + (_loc9_ | _loc8_).toString(16) + "00000000");
return _loc7_ + _loc5_;
}
public static function bitwiseNot(param1:Number) : Number
{
var _loc3_:String = param1.toString(2);
var _loc6_:uint = _loc3_.length > 32 ? parseInt(_loc3_.substr(0,_loc3_.length - 32),2) : 0;
var _loc4_:uint = parseInt(_loc3_.substr(_loc3_.length > 32 ? _loc3_.length - 32 : 0),2);
_loc6_ = uint(~_loc6_);
_loc4_ = uint(~_loc4_);
var _loc2_:String = _loc6_.toString(2).substr(11);
var _loc5_:String = _loc4_.toString(2);
return parseInt(_loc2_ + _loc5_,2);
}
public static function numberOfBitsSet(param1:Number) : int
{
var _loc3_:int = 0;
if(param1 == 0 || param1 <= 0)
{
return 0;
}
var _loc2_:int = 0;
_loc3_ = 0;
while(_loc3_ < 64)
{
if(bitwiseAnd(param1,leftShiftNumbers(_loc3_)) != 0)
{
_loc2_++;
}
_loc3_++;
}
return _loc2_;
}
}
}
@@ -0,0 +1,23 @@
package com.sbi.bit
{
public class BitWiseOperator
{
public static const AND:BitWiseOperator = new BitWiseOperator("&");
public static const OR:BitWiseOperator = new BitWiseOperator("|");
public static const XOR:BitWiseOperator = new BitWiseOperator("^");
public static const NOT:BitWiseOperator = new BitWiseOperator("~");
private var _op:String;
public function BitWiseOperator(param1:String)
{
super();
_op = param1;
}
}
}
@@ -0,0 +1,141 @@
package com.sbi.bit
{
public class ScalableBitField
{
private static const MAX_ARRAY_SIZE:uint = 8;
private static const NUM_BITS_PER_BITFIELD:uint = 32;
private var _bitFields:Vector.<BitField>;
public function ScalableBitField(param1:String)
{
var _loc3_:* = 0;
super();
_bitFields = new Vector.<BitField>();
var _loc2_:Array = param1.split(",");
_loc3_ = 0;
while(_loc3_ < _loc2_.length)
{
_bitFields[_loc3_] = new BitField(_loc2_[_loc3_]);
_loc3_++;
}
trim();
}
public function updateBitField(param1:ScalableBitField, param2:BitWiseOperator) : void
{
var _loc5_:* = 0;
var _loc4_:* = 0;
if(param2 == BitWiseOperator.NOT)
{
_loc5_ = 0;
while(_loc5_ < _bitFields.length)
{
_bitFields[_loc5_].updateBitField(0,param2);
_loc5_++;
}
trim();
return;
}
if(param1 == null)
{
throw new Error("Attempted to update bit field with null changes: op:" + param2);
}
var _loc3_:uint = param1._bitFields.length;
if(_loc3_ > _bitFields.length)
{
resizeBitFields(_loc3_);
}
_loc5_ = 0;
while(_loc5_ < _bitFields.length)
{
_loc4_ = uint(_loc5_ < _loc3_ ? param1._bitFields[_loc5_].getInt() : 0);
_bitFields[_loc5_].updateBitField(_loc4_,param2);
_loc5_++;
}
trim();
}
public function setBit(param1:uint, param2:Boolean) : Boolean
{
if(param1 < 0)
{
throw new Error("ERROR: Attempted to set a negative bit index. bit=" + param1);
}
var _loc3_:uint = getArrayIndexForBit(param1);
if(_loc3_ >= _bitFields.length)
{
if(!param2)
{
return false;
}
resizeBitFields(_loc3_ + 1);
}
var _loc4_:Boolean = _bitFields[_loc3_].setBit(getTranslatedBit(param1),param2);
if(!param2 && _loc4_)
{
trim();
}
return _loc4_;
}
public function isBitSet(param1:uint) : Boolean
{
if(param1 < 0)
{
throw new Error("Attempted to check a negative bit index. bit=" + param1);
}
var _loc2_:uint = getArrayIndexForBit(param1);
return _loc2_ >= _bitFields.length ? false : _bitFields[_loc2_].isBitSet(getTranslatedBit(param1));
}
private function getArrayIndexForBit(param1:uint) : uint
{
return param1 / 32;
}
private function getTranslatedBit(param1:uint) : uint
{
return param1 % 32;
}
private function trim() : void
{
var _loc2_:uint = _bitFields.length - 1;
while(_loc2_ > 0 && _bitFields[_loc2_].getInt() == 0)
{
_loc2_--;
}
var _loc1_:uint = _loc2_ + 1;
if(_loc1_ != _bitFields.length)
{
resizeBitFields(_loc1_);
}
}
private function resizeBitFields(param1:uint) : void
{
var _loc2_:* = 0;
if(param1 > 8)
{
throw new Error("Blocking operation that requires more than 8 elements: " + param1);
}
if(param1 < _bitFields.length)
{
_bitFields.splice(param1,_bitFields.length);
}
else if(param1 > _bitFields.length)
{
_loc2_ = _bitFields.length;
while(_loc2_ < param1)
{
_bitFields[_loc2_] = new BitField(0);
_loc2_++;
}
}
}
}
}