|
Reposting + cross-posting and inexistent question, only a small code dump without sense...
|
|
|
|
|
You really need to spend some (or rather a lot of) time here[^].
One of these days I'm going to think of a really clever signature.
|
|
|
|
|
A new line wil be be printed in the output if the value in num is negative or equals to 0.
|
|
|
|
|
I need a java code for a simple lan voice chat program.....can ny1 help?
|
|
|
|
|
Yes, Google can help. There are lots of samples around for those who care to look.
And, for future reference, please read the guidelines[^], especially point 2.
One of these days I'm going to think of a really clever signature.
modified 5-Sep-12 9:04am.
|
|
|
|
|
Your link points to unrelated thingy.
|
|
|
|
|
Thanks, all fixed.
One of these days I'm going to think of a really clever signature.
|
|
|
|
|
1. Nobody will give you code (we made a GIMMECODE tag for that, which we use to alert other members of bad quality posts).
2. Txtspk is not welcome.
3. Use Google.
4. Don't repost.
5. don't shout (all capital letters).
OK, you've been here for less than one month, but you've come in using the big door (all the first three observed in your post  ).
Please read carefully the posting guidelines (each forum has them on top) and try not to make this kind of errors again.
Codeproject is a NICE (yes, it seems impossible now) community, that loves to help, that is really helpful and that you will be able to take plenty of profit of it and who knows if you will also help others to get their problems solved.
We expect specific questions with code samples and explanations on what is going wrong and how to reproduce the problem with the code snippet that you should provide... With that and a well formed question you'll be surprised on the amount of positive and good answers you'll get.
Now we will act like we've not seen anything here, but you should definitely observe those small rules, if you don't do that I'm afraid that the voting system will get you out of this big family...
Good luck!
|
|
|
|
|
can't i get a simple code of voice transfer.....without any graphics or anything..?
|
|
|
|
|
Not with your completely unclear specifications...
We don't like giving the code directly, but you could try at least to post what you need clearly.
|
|
|
|
|
ok I'll be clear.....I need to know how can we send a messege from one computer to another using lan
|
|
|
|
|
use Columba, a java based mail client that will allow you to send messages from one computer to another using lan.
See... it was not clear enough.
|
|
|
|
|
sir,
I want to java code for android phone camera give continuous snapshot
|
|
|
|
|
Then you have come to the wrong place. Try doing some research into Android camera features using Google or your favourite search engine.
One of these days I'm going to think of a really clever signature.
|
|
|
|
|
|
Asking for code is not how things work around here. You should try to code something for your task at hand, and when you run into a tough spot with it, ask questions then. If you want code without putting any effort into it, you might be better off with rent-a-coder or any of those other type of sites.
"Any sort of work in VB6 is bound to provide several WTF moments." - Christian Graus
|
|
|
|
|
I am using an ActiveX which is refered using <object> tag in my JavaScript code. This javascript is used in a Java based web application. When user browse this page first time, my ActiveX get downloaded from server and installed on client machine. I want to show a progressbar when IE downloading ActiveX. Please suggest what apporach I can use to implement this. I am new to Java world but using C/C++ since long time.
Manish Agarwal
manish.k.agarwal @ gmail DOT com
|
|
|
|
|
1. This is in the wrong forum. It is not a Java question, but rather a JavaScript question.
2. Why are you targeting IE with ActiveX from a web application written in Java?
Strange! 
"With sufficient thrust, pigs fly just fine."
Ross Callon, The Twelve Networking Truths, RFC1925
|
|
|
|
|
|
This is not the place for messages like this; please read the Forum Guidelines[^].
One of these days I'm going to think of a really clever signature.
|
|
|
|
|
Joshhua123 wrote: fastest responces
Perhaps you are expecting too much from people that volunteer their time.
Why is common sense not common?
Never argue with an idiot. They will drag you down to their level where they are an expert.
Sometimes it takes a lot of work to be lazy
Please stand in front of my pistol, smile and wait for the flash - JSOP 2012
|
|
|
|
|
... and today's lesson kids is about how not to cross-post a question.
Panic, Chaos, Destruction. My work here is done.
Drink. Get drunk. Fall over - P O'H
OK, I will win to day or my name isn't Ethel Crudacre! - DD Ethel Crudacre
I cannot live by bread alone. Bacon and ketchup are needed as well. - Trollslayer
Have a bit more patience with newbies. Of course some of them act dumb - they're often *students*, for heaven's sake - Terry Pratchett
|
|
|
|
|
If it helps anyone, the problem was that the texture size wasn't a power of two, which caused them problem, support for textures which aren't n^2 in openGL 2.1
The used one was openGL 1.1
|
|
|
|
|
The code below returns the least frequent AGE or rarest age in the name/age map below;
{Alyssa=22, Char=25, Dan=25, Jeff=20, Kasey=20, Kim=20, Mogran=25, Ryan=25, Stef=22}
which is stef=22 as it shows up twice where others show up 3 times in the map collection. I cannot understand the code starting at line 11 on. I'd appreciate any help.
public static int rarestAge(Map<string, integer=""> map) {
if (map == null || map.isEmpty()) {
throw new IllegalArgumentException();
}
Map<integer, integer=""> map2 = new TreeMap<integer, integer="">();
for (String name : map.keySet()) {
int age = map.get(name);
if (map2.containsKey(age)) {
map2.put(age, map2.get(age) + 1);
} else {
map2.put(age, 1);
}
}
int count3 = map.size() + 1;
int rarest = -1;
for (int age : map2.keySet()) {
int count = map2.get(age);
// line 11...I cannot understand the code below;
if (count < count3) {
count3 = count;
rarest = age;
}
}
return rarest;
}
|
|
|
|
|
It loops thru all the keys of the map (i.e. the ages). For each value, it asks: how often was that age found (int count = map2.get(age);)? If it was found less often than the current minimum (count3), the new value is the current minimum.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
please look