package org.apache.lucene.search;

/**
 * Licensed to the Apache Software Foundation (ASF) under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The ASF licenses this file to You under the Apache License, Version 2.0
 * (the "License"); you may not use this file except in compliance with
 * the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

import java.text.DecimalFormat;
import java.text.DecimalFormatSymbols;
import java.text.NumberFormat;
import java.util.Locale;
import java.util.Random;

import org.apache.lucene.document.Document;
import org.apache.lucene.document.Field;
import org.apache.lucene.index.IndexReader;
import org.apache.lucene.index.RandomIndexWriter;
import org.apache.lucene.index.Term;
import org.apache.lucene.store.Directory;
import org.apache.lucene.util.LuceneTestCase;

/**
 * Create an index with terms from 0000-9999.
 * Generates random wildcards according to patterns,
 * and validates the correct number of hits are returned.
 */
public class TestWildcardRandom extends LuceneTestCase {
  private Searcher searcher;
  private IndexReader reader;
  private Random random;
  private Directory dir;
  
  @Override
  protected void setUp() throws Exception {
    super.setUp();
    random = newRandom();
    dir = newDirectory(random);
    RandomIndexWriter writer = new RandomIndexWriter(random, dir);
    
    Document doc = new Document();
    Field field = new Field("field", "", Field.Store.NO, Field.Index.ANALYZED);
    doc.add(field);
    
    NumberFormat df = new DecimalFormat("0000", new DecimalFormatSymbols(Locale.ENGLISH));
    for (int i = 0; i < 10000; i++) {
      field.setValue(df.format(i));
      writer.addDocument(doc);
    }
    
    reader = writer.getReader();
    searcher = new IndexSearcher(reader);
    writer.close();
  }
  
  private char N() {
    return (char) (0x30 + random.nextInt(10));
  }
  
  private String fillPattern(String wildcardPattern) {
    StringBuilder sb = new StringBuilder();
    for (int i = 0; i < wildcardPattern.length(); i++) {
      switch(wildcardPattern.charAt(i)) {
        case 'N':
          sb.append(N());
          break;
        default:
          sb.append(wildcardPattern.charAt(i));
      }
    }
    return sb.toString();
  }
  
  private void assertPatternHits(String pattern, int numHits) throws Exception {
    // TODO: run with different rewrites
    Query wq = new WildcardQuery(new Term("field", fillPattern(pattern)));
    TopDocs docs = searcher.search(wq, 25);
    assertEquals("Incorrect hits for pattern: " + pattern, numHits, docs.totalHits);
  }

  @Override
  protected void tearDown() throws Exception {
    searcher.close();
    reader.close();
    dir.close();
    super.tearDown();
  }
  
  public void testWildcards() throws Exception {;
    int num = 100 * RANDOM_MULTIPLIER;
    for (int i = 0; i < num; i++) {
      assertPatternHits("NNNN", 1);
      assertPatternHits("?NNN", 10);
      assertPatternHits("N?NN", 10);
      assertPatternHits("NN?N", 10);
      assertPatternHits("NNN?", 10);
    }
    
    num = 10 * RANDOM_MULTIPLIER;
    for (int i = 0; i < num; i++) {
      assertPatternHits("??NN", 100);
      assertPatternHits("N??N", 100);
      assertPatternHits("NN??", 100);
      assertPatternHits("???N", 1000);
      assertPatternHits("N???", 1000);
      assertPatternHits("????", 10000);
      
      assertPatternHits("NNN*", 10);
      assertPatternHits("NN*", 100);
      assertPatternHits("N*", 1000);
      assertPatternHits("*", 10000);
      
      assertPatternHits("*NNN", 10);
      assertPatternHits("*NN", 100);
      assertPatternHits("*N", 1000);
      
      assertPatternHits("N*NN", 10);
      assertPatternHits("NN*N", 10);
      
      // combo of ? and * operators
      assertPatternHits("?NN*", 100);
      assertPatternHits("N?N*", 100);
      assertPatternHits("NN?*", 100);
      assertPatternHits("?N?*", 1000);
      assertPatternHits("N??*", 1000);
      
      assertPatternHits("*NN?", 100);
      assertPatternHits("*N??", 1000);
      assertPatternHits("*???", 10000);
      assertPatternHits("*?N?", 1000);
      assertPatternHits("*??N", 1000);
    }
  }
}