Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion how to compile mathematical operations using indy efficiently
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Jochen Theodorou  
View profile  
 More options Feb 8 2012, 4:49 pm
From: Jochen Theodorou <blackd...@gmx.org>
Date: Wed, 08 Feb 2012 22:49:55 +0100
Local: Wed, Feb 8 2012 4:49 pm
Subject: how to compile mathematical operations using indy efficiently
Hi,

soon I want to look at a simple x+y. But those x+y can have various
types and I don't think that for the case of having int for x and y it
is really good to have a method like this:

static int plus(Integer x, Integer y){return x+y;}

and I wonder further if I should really provide methods for all
combinations of byte, char, int, short even though they are more or less
handled as int in bytecode. Counting all versions I would have some 49
methods.

What do you guys advise to do here?

bye Jochen

--
Jochen "blackdrag" Theodorou - Groovy Project Tech Lead
blog: http://blackdragsview.blogspot.com/
german groovy discussion newsgroup: de.comp.lang.misc
For Groovy programming sources visit http://groovy-lang.org


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.