Class JAS::SolvableModule
In: examples/jas.rb
Parent: CommutativeModule

Represents a JAS module over a solvable polynomial ring.

Method to create solvable sub-modules.

Methods

element   new   submodul   to_s  

Attributes

cols  [R] 
mset  [R] 
ring  [R] 

Public Class methods

Solvable module constructor.

[Source]

      # File examples/jas.rb, line 3033
3033:     def initialize(modstr="",ring=nil,cols=0)
3034:         if ring == nil
3035:            sr = StringReader.new( modstr );
3036:            tok = GenPolynomialTokenizer.new(sr);
3037:            @mset = tok.nextSolvableSubModuleSet();
3038:            if @mset.cols >= 0
3039:                @cols = @mset.cols;
3040:            end
3041:         else
3042:            @mset = ModuleList.new(ring.ring,nil);
3043:            @cols = cols;
3044:         end
3045:         @ring = @mset.ring;
3046:     end

Public Instance methods

Create an element from a string.

[Source]

      # File examples/jas.rb, line 3065
3065:     def element(mods)
3066:         if not mods.is_a? String 
3067:            begin
3068:               if @ring == mods.ring 
3069:                  return RingElem.new(mods);
3070:               end
3071:            rescue Exception => e
3072:               # pass
3073:            end
3074:            mods = str(mods);
3075:         end
3076:         ii = SolvableSubModule.new( "( " + mods + " )");
3077:         list = ii.mset.list;
3078:         if list.size > 0
3079:             return RingElem.new( list[0] );
3080:         end
3081:     end

Create a solvable sub-module.

[Source]

      # File examples/jas.rb, line 3058
3058:     def submodul(modstr="",list=nil)
3059:         return SolvableSubModule.new(self,modstr,list);
3060:     end

Create a string representation.

[Source]

      # File examples/jas.rb, line 3051
3051:     def to_s()
3052:         return @mset.toScript();
3053:     end

[Validate]