C# Set.AddAll方法代码示例

        /// <summary>
        /// Create a SemanticHeadFinder
        /// </summary>
        /// <param name="tlp">
        /// The TreebankLanguagePack, used by the superclass to get basic category of constituents
        /// </param>
        /// <param name="noCopulaHead">
        /// If true, a copular verb (be, seem, appear, stay, remain, resemble, become)
        /// is not treated as head when it has an AdjP or NP complement.  If false,
        /// a copula verb is still always treated as a head.  But it will still
        /// be treated as an auxiliary in periphrastic tenses with a VP complement.
        /// </param>
        public SemanticHeadFinder(AbstractTreebankLanguagePack tlp, bool noCopulaHead) : base(tlp)
        {
            RuleChanges();

            // make a distinction between auxiliaries and copula verbs to
            // get the NP has semantic head in sentences like "Bill is an honest man".  (Added "sha" for "shan't" May 2009
            verbalAuxiliaries = new Util.HashSet<string>(Auxiliaries);

            passiveAuxiliaries = new Util.HashSet<string>(BeGetVerbs);

            //copula verbs having an NP complement
            copulars = new Util.HashSet<string>();
            if (noCopulaHead)
            {
                copulars.AddAll(CopulaVerbs);
            }

            // TODO: reverse the polarity of noCopulaHead
            this.makeCopulaHead = !noCopulaHead;

            verbalTags = new Util.HashSet<string>(VerbTags);
            unambiguousAuxiliaryTags = new Util.HashSet<string>(UnambiguousAuxTags);
        }

 public TregexPattern ChildrenDisj()
 {
     var children = new List<TregexPattern>();
     // When we keep track of the known variables to assert that
     // variables are not redefined, or that links are only set to known
     // variables, we want to separate those done in different parts of the
     // disjunction.  Variables set in one part won't be set in the next
     // part if it gets there, since disjunctions exit once known.
     var originalKnownVariables = new Set<string>(knownVariables);
     // However, we want to keep track of all the known variables, so that after
     // the disjunction is over, we know them all.
     var allKnownVariables = new Set<string>(knownVariables);
     TregexPattern child = ChildrenConj();
     children.Add(child);
     allKnownVariables.AddAll(knownVariables);
     //label_3:
     while (true)
     {
         if (Jj_2_2(2))
         {
             ;
         }
         else
         {
             //break label_3;
             break;
         }
         knownVariables = new Set<string>(originalKnownVariables);
         Jj_consume_token(12);
         child = ChildrenConj();
         children.Add(child);
         allKnownVariables.AddAll(knownVariables);
     }
     knownVariables = allKnownVariables;
     if (children.Count == 1)
     {
         return child;
     }
     else
     {
         return new CoordinationPattern(children, false);
     }
 }