kh'      !"#$%&0'()*+CStandard Tone Row. This is the traditional Tone Row, a collection  of all the elements [0..11], based on 12-TET. As with , G the most significant information in this type of set is the ordering B of the elements. Since this is always a complete set, this set  always has a length of 12. ,General Tone Row. A Tone Row! is a collection of all possible  Pitch Class Set  within a given   . Since it B contains all elements, the significant information in this type  of set is the ordering of the . This set always has  a length equal to its  . -;Standard Pitch Class Set. This represents the traditional = definition of a pitch class set, based on 12-TET, with the ! pitch classes numbered C = 0, C#/Db = 1, D = 2, and so on < up to B = 11. This set can have anywhere from zero to 12 3 members (the empty set vs. the chromatic scale). .AGeneral Pitch Class Set. This represents a Pitch Class Set that  can have a  - of any positive integer value, representing @ the number of equivalent pitch classes in a given system; for C example, 19-TET would be a modulus 19 set. The members of a the @ set can be as few as zero and as many as all possible values. /@Inclusive Pitch Class Sets, or Tone Rows, have all the possible   permitted by their  . The most important * characteristic of a Tone Row is not its  , but the  ordering of its . Transposes the ! of a Tone Row so that the first  element is n. $Selective Pitch Class Sets can have  in a range of values  permitted by their  '. They can have as few as 0 (the empty " set) or as many as all. The set   operation only makes  sense for   sets. =Returns a new PcSet which is the complement of the original:  it contains all the  which the original does not. AThe broadest class of Pitch Class Set. All members of this class  have a   which restricts their  in some way. They  also have 5, a method for lifting integer list functions to act  on set elements. The  & corresponds to the underlying system A of equivalent pitch classes, for example, 12-TET = modulus 12. !Determines the range of possible  of the set, : from 0 to (m-1). If m = 0, the set can only be empty. +Returns the elements of the set as a list. =Maps an integer list function across the members of the set, : and returns the results in a new set of the same type. DConstructor for General Pitch Class Sets. This constructor accepts  any Int value for   , and any [Int] values for an input  list. Zero  ) always returns an empty set; a negative   > is always taken as positive (since the number represent the absolute " size of the equivalence class). EConstructor for Standard Pitch Class Sets. This constructor accepts  any [Int] values for elements. The   is always 12 (12-TET). AConstructor for General Tone Rows. This constructor accepts any Int  value for   , and any [Int]! values for an input list. Zero   ) always returns an empty set; a negative   is always  taken as positive (see ). If the input list of  is  incomplete, the remaining % are filled in at the end, in order. BConstructor for Standard Tone Rows. This constructor accepts any [Int] ! values for an input list. The   is always 12 (12-TET). If the  input list of  is incomplete, the remaining  are filled  in at the end, in order. Returns a new  % which is the original transposed by n. Returns a new   which is the standard inverse of the original, 3 that is, about an axis containing pitch class 0. 4Inversion around an axis specified by pitch classes x and y. * This inverts the set in such a way that x becomes y and y  becomes x. Returns a new  , in which the elements have been transposed % so that the first element is zero. Returns a new  - with the elements of the original reversed. Returns a new   with the elements shifted n places to the left.  Returns a    ' in which the elements of the original I have been sorted in ascending order. (Note this is restricted to Sets, E as sorting a Tone Row produces only an ascending chromatic scale.)  Returns a    , in which the elements of the original have  been put into  normal form-. This can be defined as an ascending order M in which the elements fit into the smallest overall interval. In the event I of a tie, the arrangement with the closest leftward packing is chosen.  Returns a    ' in which the elements of the original  have been put into  reduced form!. This can be thought of as the  6 form, transposed so that the first element starts on .  Returns a    ' in which the elements of the original  have been put into  prime form$. A prime form is able to generate H all the members of its set family through the some combination of the  operations , , and simple permutation. $Returns the number of elements in a    . Binary Value. For a given    , this returns a  unique9 number relating to the elements of the set -- a measure  of the leftward packing& of the sorted set (overall closeness  of each element to zero). (Ascending Vector. If the elements of a     are C taken to be in strictly ascending order, the ascending vector is 0 the interval difference between each element. !GCommon Tone Vector: finds the number of common tones for each possible  value of n in the operation  n . . Returns a list 5 where element 0 is the number of common tones with n=0, element 1 is  with n=1, and so on. "AInterval Vector. Each element of the interval vector represents B the number of intervals in the set for that particular interval = class. Element 0 measures the number of 1-interval leaps; @ element 1 measures the number of 2-interval leaps, and so on,  up to half of the modulus m. #1Returns a new Tone Row in which the elements are Prograde = (in their original order) and transposed so that the first  element is n. $1Returns a new Tone Row in which the elements are  Retrograde @ (reversed compared to their original order) and transposed so  that the first element is n. %7Returns a new Tone Row in which the elements have been Inverted  (see .) and transposed so that the first element is n. &6Returns a new Tone Row in which the elements are both  Retrograde  and Inverted., and transposed so that the first element is n. 0123#  !"#$%&#    !"#$%&#     !"#$%&4      !"#$%&'()**+,-  ./012gpcsets-0.9.0.0Data.PcSets.SvgData.PcSets.NotesData.PcSets.CompactData.PcSets.Catalog Data.PcSetstestStdRowGenRowStdSetGenSet Inclusive reconcile Selective complementPcSetmoduluselementspMapgensetstdsetgenrowstdrow transposeinvertinvertXYzero retrograderotatesortnormalreducedprime cardinality binaryValueaveccvecivecrowProwRrowIrowRI Candidateidxnformrform interview sortFunctionbestPackpcsArrangements