****
|
________This_immutable_class_is_one_of_the_most_fundamental_exact_number
___classes.__It_has_the_value_domain_from_0_to_some_maximum_value_determined
___by_the_machine_representation_provided.___All_arithmetic_on_values_of_this
___class_is_unsigned,_whether_involving_overflow_detection_or_modular
___operations.__This_class_inherits_from_AVAL{BIT}._The_number_of_bits
___in_the_representation_is_identical_to_NUM_BITS::Num_Bits.
___NOTE_The_Sather_language_requires_that_Num_Bits_be_at_least_32_to_ensure
________portability_of_INT_literals_up_to_this_size.
________Many_of_the_operations_are_specified_to_raise_exceptions_on_overflow.
___They_are,_however,_only_guaranteed_to_do_this_if_checking_is_enabled!
___Enabling_checking,_however,_may_affect_performance._Certain_machines_with
___appropriate_hardware_may_perform_these_checks_even_when_checking_is_not
___enabled.
___References_:
________Keith_O._Geddes,_Stephen_R._Czapor,_and_George_Labahn,_"Algorithms
________for_Computer_Algebra",_Kluwer_Academic_Publishers,_Boston,_1992.
|