MatchCollection クラスとは何？わかりやすく解説 Weblio辞書

.NET Framework クラスライブラリリファレンス

索引トップ用語の索引ランキング

MatchCollection クラス

正規表現パターンを入力文字列に繰り返し適用したときに、パターンに一致した一連の対象を表します。

名前空間: System.Text.RegularExpressions
アセンブリ: System (system.dll 内)
構文

Visual Basic (宣言)

<SerializableAttribute> _
Public Class MatchCollection
    Implements ICollection, IEnumerable

Visual Basic (使用法)

Dim instance As MatchCollection

[SerializableAttribute] 
public class MatchCollection : ICollection,
 IEnumerable

C++

[SerializableAttribute] 
public ref class MatchCollection : ICollection,
 IEnumerable

/** @attribute SerializableAttribute() */ 
public class MatchCollection implements ICollection,
 IEnumerable

JScript

SerializableAttribute 
public class MatchCollection implements ICollection,
 IEnumerable

解説

このコレクションは変更不可 (読み取り専用) で、パブリックコンストラクタはありません。インスタンスは Matches メソッドを通じて返されます。

使用例

MatchCollection クラスを使用し、Match インスタンスのセットを問い合わせるコード例を次に示します。

using System;
using System.Text.RegularExpressions;

public class Test
{

    public static void Main
 ()
    {

        // Define a regular expression for repeated words.
        Regex rx = new Regex(@"\b(?<word>\w+)\s+(\k<word>)\b"
,
          RegexOptions.Compiled | RegexOptions.IgnoreCase);

        // Define a test string.        
        string text = "The the quick brown fox  fox jumped
 over the lazy dog dog.";
        
        // Find matches.
        MatchCollection matches = rx.Matches(text);

        // Report the number of matches found.
        Console.WriteLine("{0} matches found.", matches.Count);

        // Report on each match.
        foreach (Match match in matches)
        {
            string word = match.Groups["word"].Value;
            int index = match.Index;
            Console.WriteLine("{0} repeated at position {1}", word, index);
   
        }
        
    }
    
}

C++

#using <System.dll>

using namespace System;
using namespace System::Text::RegularExpressions;
int main()
{
   // Define a regular expression for repeated words.
   Regex^ rx = gcnew Regex( "\\b(?<word>\\w+)\\s+(\\k<word>)\\b",static_cast<RegexOptions>(RegexOptions::Compiled
 | RegexOptions::IgnoreCase) );

   // Define a test string.        
   String^ text = "The the quick brown fox  fox jumped over the lazy dog dog.";

   // Find matches.
   MatchCollection^ matches = rx->Matches( text );

   // Report the number of matches found.
   Console::WriteLine( "{0} matches found.", matches->Count );

   // Report on each match.
   for each (Match^ match in matches)
   {
      String^ word = match->Groups["word"]->Value;
      int index = match->Index;
      Console::WriteLine("{0} repeated at position {1}", word, index);
   
   }
}

import System.*;
import System.Text.RegularExpressions.*;

public class Test
{
    public static void main(String[]
 args)
    {
        // Define a regular expression for repeated words.
        Regex rx = new Regex("\\b(?<word>\\w+)\\s+(\\k<word>)\\b",
 
            RegexOptions.Compiled | RegexOptions.IgnoreCase);

        // Define a test string.        
        String text = "The the quick brown fox  fox jumped over the "
            + "lazy dog dog.";

        // Find matches.
        MatchCollection matches = rx.Matches(text);

        // Report the number of matches found.
        Console.WriteLine("{0} matches found.", (Int32)matches.get_Count());

        // Report on each match.
        for (int iCtr = 0; iCtr < matches.get_Count();
 iCtr++) {
            Match match = matches.get_Item(iCtr);
            String word = match.get_Groups().get_Item("word").get_Value();
            int index = match.get_Index();
            Console.WriteLine("{0} repeated at position {1}", word, 
                (Int32)index);
        }
    } //main       
} //Test