Alternative approach for the following task

[shylaja]

Hi
I need a alternative approach for the following code segment.
I have a task where a particular string has to be checked if it is one among the following values
(byte,boolean,string,char,int,float,doublee);
I have used if else logic to check that value and the code is as follows
if(!names.equalsIgnoreCase("byte&quot){
if(!names.equalsIgnoreCase("boolean&quot){
if(!names.equalsIgnoreCase("char&quot){
if(!names.equalsIgnoreCase("int&quot){
if(!names.equalsIgnoreCase("double&quot){
if(!names.equalsIgnoreCase("float&quot){
if(!names.equalsIgnoreCase("short&quot){
if(!names.equalsIgnoreCase("long&quot){
return true;

}
}

}
}
}
}
}
}
Can any other alternative way can be used to code this , so that the code becomes simpler .

Thanks in advance
shylaja

 

[palbano]

class Findit{
	protected static java.util.Hashtable _types = new java.util.Hashtable();
	static protected String[] _stypes = {
		"byte","char","int","short","long","double","float","boolean" };
		
	static{
		for(int n=0; n<_stypes.length; n++)
			_types.put( _stypes[n], _stypes[n]);
	}
	
	public static boolean find(String type){
		String ltype = type.toLowerCase();
		return _types.containsKey(ltype);
	}
	
	public static void unitTest(){
		String test[] = {&quot;int&quot;,&quot;integer&quot;,&quot;Short&quot;,&quot;bool&quot;,&quot;douBle&quot;};
		for(int n=0; n<test.length; n++)
			System.out.println( test[n] + &quot; found: &quot; + Findit.find(test[n]));
	}
}

That was fun B-)
-pete

 

[JackMH]

A similar approach to Pete's but perhaps a shade simpler:

static String [] keywords =
{"boolean", "byte", "char", "double", float",
"int", "long", "short"}; // MUST be ordered alphabetically

int i; // Index

i = java.util.Arrays.binarySearch(keywords, names.toLowerCase());

if (i >= 0)
{
switch (i)
{
case 0: // "boolean"
...
break;

case 1: // "byte"
...
break;

case 2: // "char"
...
break;

etc ...
} // end Switch
} // end if
else
{
// Not found
}

 

[shylaja]

Hi
I tried out both the approaches .Both the approaches was helpful.

Thanks
Shylaja