Represents a JAS module over a solvable polynomial ring.
Method to create solvable sub-modules.
Solvable module constructor.
# File examples/jas.rb, line 4337 def initialize(modstr="",ring=nil,cols=0) if ring == nil sr = StringReader.new( modstr ); tok = RingFactoryTokenizer.new(sr); pfac = tok.nextSolvablePolynomialRing(); #tok = GenPolynomialTokenizer.new(sr); #@mset = tok.nextSolvableSubModuleSet(); #if @mset.cols >= 0 # @cols = @mset.cols; #end @ring = pfac; else if ring.is_a? Ring @ring = ring.ring else @ring = ring; end end @mset = ModuleList.new(@ring,nil); if cols < 0 cols = 0; end @cols = cols; end
Create an element from a string.
# File examples/jas.rb, line 4379 def element(mods) if not mods.is_a? String begin if @ring == mods.ring return RingElem.new(mods); end rescue Exception => e # pass end mods = str(mods); end ii = SolvableSubModule.new( "( " + mods + " )"); list = ii.mset.list; if list.size > 0 return RingElem.new( list[0] ); end end
Generated with the Darkfish Rdoc Generator 2.