counting

Is it possible to get the number of cases in a switch case in C without manually adding a counter variable which is incremented in each case? As I commented earlier, I think you want a dispatch table rather than a switch statement. Here's a little example. Say you got this: int find_the_case(); void do_something(); void do_something_different(); void do_something_completly_different(); void do_default(); int main(int argc, char *argv[]) { int c = find_the_case(); switch(c){ case 0: do_something(); break; case 1: do_something_different(); break; case 5: do_something_completly_different(); break

I've points for a big triangle lets call it a, b, c. (a = (x, y) and so on). Now I want to count the number of integral points inside the area enclosed by this triangle, so I first looked at Pick's theorem. The second approach that I considered was generating a list of points bounded by max, min of the triangle, and then checking if each point lies inside the triangle. I used the Barycentric coordinates method to do this. It works however my triangle is pretty huge and my program is basically a brute force across points. How do I improve on this algorithm? My code can be found here: https:/

I need to take a string of mixed Asian characters (for now, assume only Chinese kanji or Japanese kanji/hiragana/katakana) and "Alphanumeric" (i.e., Enlgish, French), and count it in the following way: 1) count each Asian CHARACTER as 1; 2) count each Alphanumeric WORD as 1; a few examples: 株式会社myCompany = 4 chars + 1 word = 5 total 株式会社マイコ = 7 chars my only idea so far is to use: var wordArray=val.split(/\w+/); and then check each element to see if its contents are alphanumeric (so count as 1) or not (so take the array length). But I don't feel that's really very clever at all and the text