def __init__(self,
major=0,
minor=0,
patch=0,
version=None,
root=[],
infixes=[]):
self.__version = gen_ver(major, minor, patch, version)
self.__root = root
self.__infixes = infixes
def __init__(self,
major=0,
minor=0,
patch=0,
version=None,
pos={},
value=None):
self.__version = gen_ver(major, minor, patch, version)
self.__pos = pos
self.__value = value
def __init__(self,
ver_major=0,
ver_minor=0,
ver_patch=0,
min_length=0,
max_length=0,
version=None):
self.__version = gen_ver(ver_major, ver_minor, ver_patch, version)
self.__length = tuple([min_length, max_length])
tmp = self.__finite_state_machine()
self.__fsm = tmp[0]
self.__fsm_start = tmp[1]
self.__cat = self.__categories()
self.__repl_map = self.__replacment_map()
def reset_current_version( major=0, minor=0, patch=0, version=None ):
v = gen_ver(major, minor, patch, version)
return __versions.current(v)
# accomidate resets (they call into *THE_CURRENT_VERSION_OBJECT*!!)
# the PRE-GENERATED LISTS will not be updated at all..
#
def get_current():
return __versions.current()
def get_current_version():
return __versions.current().version()
def reset_current_version( major=0, minor=0, patch=0, version=None ):
v = gen_ver(major, minor, patch, version)
return __versions.current(v)
import ver_1_5_1
__versions.current(gen_ver(1,5,1))
########################################################
#
#
# The Backwards Compatability Functions
#
#
def gen_():
# setting up the Finite State Machine for parsing...
# for parse string "(S)(C2)C1(C1)(C1)"
# will be using:
# 1 for C1
# 2 for C2
# 3 for S