A test for todo and fixme patterns

MatcherTest.java

import java.security.SecureRandom;
import java.util.regex.Pattern;

public class MatcherTest {
  private static final String ALPHABET = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ-_";
  private static final SecureRandom RANDOM = new SecureRandom();

  private static String generate(int count) {
    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < count; ++i) {
      sb.append(ALPHABET.charAt(RANDOM.nextInt(ALPHABET.length())));
    }
    return sb.toString();
  }

  public static void main(String[] args) {
    String text = generate(20_000_000);

    long load = System.currentTimeMillis();
    single(text);
    System.out.println("composite " + (System.currentTimeMillis() - load));

    long load2 = System.currentTimeMillis();
    two(text);
    System.out.println("separate  " + (System.currentTimeMillis() - load2));

  }

  private static void single(String text) {
    Pattern pattern = Pattern.compile("\\b(todo|fixme)\\b.*");
    for (int i = 0; i < 20; i++) {
      pattern.matcher(text).find();
    }
  }

  private static void two(String text) {
    Pattern todo = Pattern.compile("\\btodo\\b.*");
    Pattern fixme = Pattern.compile("\\bfixme\\b.*");
    for (int i = 0; i < 20; i++) {
      fixme.matcher(text).find();
      todo.matcher(text).find();
    }
  }
}

composite 3120
separate 6301