Macaulay2 » Documentation
Packages » Macaulay2Doc :: intersection
next | previous | forward | backward | up | index | toc

intersection -- compute an intersection

Description

When a more efficient algorithm is available for computing the intersection of all inputs simultaneously rather than iteratively, for instance for intersecting Modules, a specialized function that takes a list or sequence may be installed on (symbol intersect, Type).

i1 : code lookup(symbol intersect, Module)

o1 = ../../m2/option.m2:15:14-18:8: --source code:
       (opts,f) -> args -> (
            -- Common code for functions created with >> to process options and arguments.
            uncurry(f, override (opts,args))
            )
     | symbol  class            value                                                location of symbol
     | ------  -----            -----                                                ------------------          
     | f       FunctionClosure  FunctionClosure[../../m2/intersect.m2:86:42-86:108]  ../../m2/option.m2:15:8-15:9
     | opts    OptionTable      OptionTable{MinimalGenerators => true}               ../../m2/option.m2:15:3-15:7
     |                                      Strategy => null                         
     | -- function f:
     | ../../m2/intersect.m2:86:42-86:108: --source code:
     | Module.intersect = moduleIntersectOpts >> opts -> L -> intersectHelper(L, (intersect, Module, Module), opts)
     | -- option table opts:
     | OptionTable{MinimalGenerators => true}
     |             Strategy => null

See also

Ways to use intersection:

For the programmer

The object intersection is a method function with options.