File: length-doc.m2

package info (click to toggle)
macaulay2 1.21%2Bds-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 133,096 kB
  • sloc: cpp: 110,377; ansic: 16,306; javascript: 4,193; makefile: 3,821; sh: 3,580; lisp: 764; yacc: 590; xml: 177; python: 140; perl: 114; lex: 65; awk: 3
file content (33 lines) | stat: -rw-r--r-- 868 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
document {
    Key => length,
    Headline => "length of an object"
    }

document {
    Key => (length, Dictionary),
    Headline => "length of a dictionary",
    Usage => "n = length d",
    Inputs => { "d" },
    Outputs => { "n" => { "the number of entries in ", TT "d" } }
    }

document {
    Key => (length, VisibleList),
    Headline => "length of a visible list",
    Usage => "n = length x",
    Inputs => { "x" },
    Outputs => { "n" => { "the number of entries in ", TT "x" } }
    }

document {
    Key => (length, GradedModule),
    Headline => "length of a graded module",
    "The length of a graded module is the difference between the largest and
    smallest indices of occupied spots.  Chain complexes are graded modules,
    so this function applies to them, too.",
    EXAMPLE {
	"R = QQ[x..z];",
	"C = res coker vars R",
	"length C"
	}
    }