Numerology: need help with array

[Adam Klein]

Trying to do numerology.

It's staying to the FIRST part of the array "asj" and just counts it for every letter typed in. (10 letters, 10 counts of asj, meaning 10 is the answer, and then 1 + 0 = 1... wrong answer....................)

How do I make the letters get looked at with EACH Letter being its own number... (Like 1 is asj, 2 is bkt, 3 is clu , and so on!)

/**
 *  Numerology.java
 *  @author Adam 
 * Helped by Mike 
 *  Starting point for CMPSC 22, Assign06, half way through Chapter 6
 *  Requires the use of methods and an array
 *  Reference:  http://www.handresearch.com/numerology/name-numerology.htm
 *  Reference2: http://www.numberquest.com/return_free_name_meaning.php
 */

import java.util.*;

public class Numerology 
{ 
  /**
   * Entry point.  Prompts for a name, calls calcDestiny, displays result
   * @param args holds command line arguments
   */
  public static void main(String[] args) 
  {   
    int destiny = 0;
    System.out.println("Adam's Numerological calculator");
    
    Scanner keyboard = new Scanner(System.in);    
    
    System.out.println("Please enter a name to analyze:");
    String name = keyboard.nextLine();
    
    destiny = calcDestiny(name);
    System.out.println("The destiny number for " + name + " is: " + destiny);
  } // end main
  
  /**
   * Calculate the Pythagorean destiny value of a name
   * @param  in -- The name to calculate
   * @return int -- The destiny value (1-9, 11 or 22)
   */
  public static int calcDestiny(String in)
  {
    int dval = 0;
    int numDigits;
    String nameLC = in.toLowerCase();
    
    dval = calcRawDestiny(nameLC);
    
    // Add up the values of the digits
    numDigits = countDigits(dval);
    while (numDigits > 1)
    {
      System.out.println("switching on dval of " + dval);  // debug line
      switch (numDigits)
      {
        case 2: if ( (dval == 11) || (dval == 22) ) return dval;
        dval =                                dval/10       + dval % 10; break;
        case 3: dval =              dval/100       + (dval/10) % 10 + dval % 10; break;              
        case 4: dval = dval/1000 + (dval/100) % 10 + (dval/10) % 10 + dval % 10; break;
        default: System.out.println("Too many digits (" + numDigits + ")!");
      }
      numDigits = countDigits(dval);
    }        
    return dval;    
  } // end calcDestiny
  
  /**
   * Determine the raw number (1 - 9999) for a name String
   * @param  name -- The name to use for calculation
   * @return int -- The raw total for all letters
   */
  public static int calcRawDestiny(String name)
  {
    // setup variables and constants for the task including the array of letter values
    String[] letterNumber = {"ajs","bkt","clu","dmv","enw","fox","gpy","hqz","ir"};
    int numerologicalValue=0;   
    char letter;
    String letterGroup = "";
    for (int i = 0; i < name.length(); i++) // for every letter in the word
    {
      letter = name.charAt(i);
      //look for letter group containing letter.
      for(int lookIndex = 0; lookIndex < letterNumber.length; lookIndex++)
      {
        letterGroup = letterNumber[lookIndex];
        //System.out.println(letterGroup);
        if(letterGroup.contains((CharSequence)letter))  
        {
          numerologicalValue+=lookIndex+1;
          System.out.println("For letter " + letter + " found in group " + letterNumber[lookIndex]);
        }
      }
    }
    return numerologicalValue;
  }
  
  /**
   * Determine the number of digits for a number between 0 and 9999
   * @param val -- The number to determine the number of digits
   * @return int -- The number of digits (1 through 4)
   */
  public static int countDigits(int val)
  {
    if (val > 999)
      return 4;
    else if (val > 99)
      return 3;
    else if (val > 9)
      return 2;
    else
      return 1;
    
  } // end countDigits
}

[Adam Klein]

I can also say that you only need to look at this code...

public static int calcRawDestiny(String name)
  {
    // setup variables and constants for the task including the array of letter values
    String[] letterNumber = {"ajs","bkt","clu","dmv","enw","fox","gpy","hqz","ir"};
    int numerologicalValue=0;   
    char letter;
    String letterGroup = "";
    for (int i = 0; i < name.length(); i++) // for every letter in the word
    {
      letter = name.charAt(i);
      //look for letter group containing letter.
      for(int lookIndex = 0; lookIndex < letterNumber.length; lookIndex++)
      {
        letterGroup = letterNumber[lookIndex];
        //System.out.println(letterGroup);
        if(letterGroup.charAt(letter))
        {
          numerologicalValue+=lookIndex+1;
          System.out.println("For letter " + letter + " found in group " + letterNumber[lookIndex]);
        }
      }
    }
    return numerologicalValue;
  }

[Bin Smith]

Hello!

How can this line compile :

if(letterGroup.charAt(letter))  
        {  

It does not compile for me.

Please explain what exactly you wanna to achieve.

[Adam Klein]

Actually, since it was a while ago, I asked around my class and I finally got it done....
Thanks for trying!