/*license*\
   XBN-Java: Copyright (C) 2014, Jeff Epstein (aliteralmind __DASH__ github __AT__ yahoo __DOT__ com)

   This software is dual-licensed under the:
   - Lesser General Public License (LGPL) version 3.0 or, at your option, any later version;
   - Apache Software License (ASL) version 2.0.

   Either license may be applied at your discretion. More information may be found at
   - http://en.wikipedia.org/wiki/Multi-licensing.

   The text of both licenses is available in the root directory of this project, under the names "LICENSE_lgpl-3.0.txt" and "LICENSE_asl-2.0.txt". The latest copies may be downloaded at:
   - LGPL 3.0: https://www.gnu.org/licenses/lgpl-3.0.txt
   - ASL 2.0: http://www.apache.org/licenses/LICENSE-2.0.txt
\*license*/
package  com.github.xbn.examples.array;
   import  java.util.Arrays;
   import  com.github.xbn.array.BinarySearcher;
/**
   <p>Use {@code com.github.xbn.array.}{@link com.github.xbn.array.BinarySearcher BinarySearcher} to find the index at which a string exists in an ordered array (or where to insert it).</p>

   <p>{@code java com.github.xbn.examples.array.BinarySearcherXmpl}</p>

 * @since  0.1.0
 * @author  Copyright (C) 2014, Jeff Epstein ({@code aliteralmind __DASH__ github __AT__ yahoo __DOT__ com}), dual-licensed under the LGPL (version 3.0 or later) or the ASL (version 2.0). See source code for details. <a href="http://xbnjava.aliteralmind.com">{@code http://xbnjava.aliteralmind.com}</a>, <a href="https://github.com/aliteralmind/xbnjava">{@code https://github.com/aliteralmind/xbnjava}</a>

 **/
public class BinarySearcherXmpl  {
   public static final void main(String[] ignored)  {
      test("abc");
      test("abcd");
      test("ghi");
      test("kl");
   }
   private static final void test(String searching_for)  {
      String[] asToSearch = {"abc", "def", "ghi", "jkl", "mno"};

      System.out.println("Searching for \"" + searching_for + "\" in " + Arrays.toString(asToSearch));

      BinarySearcher bs = new BinarySearcher(true).containerLength(asToSearch.length);

      while(!bs.isDone())  {
         String sPossibility = asToSearch[bs.getIndexMiddle()];

         int iCompare = searching_for.compareTo(sPossibility);
         if(iCompare == 0)  {
            System.out.println("   Found at index " + bs.getIndexMiddle());
            return;
         }

         bs.resetIteration(iCompare < 0);
      }

      System.out.println("   Not found. Can be INSERTED at index " + bs.getIndexInsertAt() + ".");
   }
}