Search Results

Search found 46894 results on 1876 pages for 'java native interface'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 1031/1876 | < Previous Page | 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038  | Next Page >

  • How to find selected node in Tree?

    - by badgirl
    Hello. I have dynamic tree (moreover nodes can have children). Every node has some action. When I right click on some node, it offers me some actions. One action, for example createChildNode creates child node, which in turn creates MyObject2. MyObject2 must be created with assistance of MyOject1, which was created in parent node(that one where I right click for actions ). How to get that object from selected node? That objects in nodes are putted to lookups.singleton(MyObjectX)

    Read the article

  • Service Discovery in J2ME

    - by thiagolee
    Hello, I have an application to run on a cell phone equipped with Wi-Fi and an application on a desktop which I want to communicate with. The problem is that I want to find in a Local Area Network the IP and port of the machine who has my service running. I can guarantee that there will be at maximum only one machine running it. I searched a lot for a way to do this but I ended up with nothing. I read something about WebServices, but it didn't seen to be what I wanted, what I want is really simple. I actually found a solution for it, but it can't be ported to J2ME. Anyone can help? Thanks.

    Read the article

  • trying to switch beginning of an array with another

    - by user1874574
    I have a problem where i am trying to swap two arrays so that they switch beginnings. example: array 1 = (1,2,3,4,5,6,7,8) and array 2 = (11,12,13,14,15,16,17,18) i want to end up with the first array being (11,12,13,14,5,6,7,8) and i want the second array to be (1,2,3,4,15,16,17,18) but for some reason i end up with 1=(11,12,13,14,5,6,7,8) and 2=(11,12,13,14,15,16,17,18) my code is provided below, what am i doing wrong? public static void Mutate(Genetic lowest, Genetic secondLowest) { int halfway = (lowest.getPopulation().length)/2; int[] one = lowest.getPopulation(); int[] two = secondLowest.getPopulation(); int[] temp = secondLowest.getPopulation(); int[] temp2 = lowest.getPopulation(); for(int i = 0; i < halfway; i++){ temp[i] = one[i]; } lowest.setPopulation(temp); for(int i = 0; i < lowest.getPopulation().length; i++){ System.out.print(temp[i]); } System.out.println(); for(int i = 0; i < halfway; i++){ temp2[i] = two[i]; } for(int i = 0; i < lowest.getPopulation().length; i++){ System.out.print(temp2[i]); } }

    Read the article

  • Simple servlet or filter to process form

    - by David
    Is there a simple framework for processing form submissions via a servlet? For my needs, a framework like STRUTS seems like over kill. My ideal processor would be a servlet that converts form elements into a bean object, possibly using typing information in the form to help with the conversion. Does something like this exist or is there another solution out there geared toward simpler needs? Thanks!

    Read the article

  • Netbeans platform tutorials

    - by James P.
    I mostly use Eclipse but have mentionned Netbeans on my cv. Are there any good concise and up-to-date tutorials apart from the official ones that could bring me up to speed on how to use the platform efficiently (shortcuts, debugging, views ...)? This excludes programming tutorials as I don't really need them unless there's a special manipulation involved.

    Read the article

  • plain old system.out question

    - by mac
    I was looking at someone's code and saw that he repeatedly declared PrintStream out = System.out; and later called out.println("blah"); I actually thought this was kind of neat. Is this a common practice? Was he just being fancy?

    Read the article

  • Why is this removing all elements from my LinkedList?

    - by Brian
    Why is my remove method removing every element from my Doubly Linked List? If I take out that if/else statements then I can successfully remove middle elements, but elements at the head or tail of the list still remain. However, I added the if/else statements to take care of elements at the head and tail, unfortunately this method now removes every element in my list. What am I do wrong? public void remove(int n) { LinkEntry<E> remove_this = new LinkEntry<E>(); //if nothing comes before remove_this, set the head to equal the element after remove_this if (remove_this.previous == null) head = remove_this.next; //otherwise set the element before remove_this equal to the element after remove_this else remove_this.previous.next = remove_this.next; //if nothing comes after remove_this, set the tail equal to the element before remove_this if (remove_this.next == null) tail = remove_this.previous; //otherwise set the next element's previous pointer to the element before remove_this else remove_this.next.previous = remove_this.previous; //if remove_this is located in the middle of the list, enter this loop until it is //found, then remove it, closing the gap afterwards. int i = 0; for (remove_this = head; remove_this != null; remove_this = remove_this.next) { //if i == n, stop and delete 'remove_this' from the list if (i == n) { //set the previous element's next to the element that comes after remove_this remove_this.previous.next = remove_this.next; //set the element after remove_this' previous pointer to the element before remove_this remove_this.next.previous = remove_this.previous; break; } //if i != n, keep iterating through the list i++; } }

    Read the article

  • Is it possible to use JSF+Facelets with HTML 4/5?

    - by Bytecode Ninja
    Facelets relies on XML namespaces to work with XHTML. How are HTML 4, and as far as I know, HTML 5 do not support namespaces. Also HTML 5 has some new elements that are not available in XHTML. Even HTML 4 and XHTML have some differences regarding elements and attributes they support. The question is: Is it possible to render HTML 4/5 documents using Facelets? If so, how?

    Read the article

  • When should I define an hash code function for my types?

    - by devoured elysium
    Is there any other reason for implementing an hash code function for my types other than allowing for good use of hash tables? Let's say I am designing some types that I intend to use internally. I know that types are "internal" to the system, and I also know I will never use those types in hash tables. In spite of this, I decide I will have to redefine the equals() method. Theory says I should also redefine the hash code method, but I can't see any reason why, in this case, I should do it. Can anyone point me out any other reason? This question can be rephrased to : in which situations should we implement a hash code method in our types. PS : I am not asking how to implement one. I am asking when.

    Read the article

  • How to determine page generation time with Struts 2 ?

    - by Samuel_xL
    I'm using Struts 2 and I'd like to determine the page generation time without an external profiler. I can easily profile the actions execute() method, but I don't know how to include the time spent before (in dispatchers, interceptors...) and after (time taken by the servlet corresponding to the view ("jsp time")). Is there simple way to do this ? And if there isn't, how could I, at least, profile the "jsp time" (maybe a tag I'm not aware of ?) ? I think it would be accurate enough to just take in account action time + jsp time. Thanks.

    Read the article

  • What is the security risk of object reflection?

    - by Legend
    So after a few hours of workaround the limitation of Reflection being currently disabled on the Google App Engine, I was wondering if someone could help me understand why object reflection can be a threat. Is it because I can inspect the private variables of a class or are there any other deeper reasons?

    Read the article

  • Ordered Data Structure that allows to efficiently remove duplicate items

    - by devoured elysium
    I need a data structure that Must be ordered (adding elements a, b and c to an empty structure, will make them be at positions 0, 1 and 2). Allows to add repeated items. This is, I can have a list with a, b, c, a, b. Allows removing all ocurrences of a given item (if I do something like delete(1), it will delete all ocurrences of 1 in the structure). I can't really pick what the best data structure could be in here. I thought at first about something like a List(the problem is having an O(n) operation when removing items), but maybe I'm missing something? What about trees/heaps? Hashtables/maps? I'll have to assume I'll do as much adding as removing with this data structure. Thanks

    Read the article

  • One log4j.xml - many scripts

    - by psed
    One of my utility jar files is used by different nix scripts, located in different categories. Problem: unable to initialize log4j framework (unable to find log4j.xml). Solution, that allows to configure logger correctly while launching jar classes by different scripts - usage of env vars and force configuring using DOMConfigurtor.configure(pathToConfXml) method. is it possible to avoid path hardcoding and configure logger inside of a script? Appreciate all your help. Thanks.

    Read the article

  • How do I setup Eclipse to stop on the line an exception occured?

    - by Chris Persichetti
    Hi, How can I setup Eclipse to stop at the point an exception occurred. I have an Eclipse breakpoint setup to break on an exception. In the code example below, the problem I'm having is Eclipse tries to open the Integer source code. Is there any way to just have debugger break at the point shown in my code example? If I move down the stack trace, I will get to this line, it'd be nice if there's a way to do this without the "Source not found" window coming up. This can be done in Visual Studio, so it's driving me crazy not being able to find a way to do this in Eclipse. package com.test; public class QuickTest { public static void main(String[] args) { try { test(); } catch(NumberFormatException e) { System.out.println(e.getMessage()); } } private static void test() { String str = "notAnumber"; Integer.parseInt(str);//<----I want debugger to stop here } }

    Read the article

  • HashMap.containsValue - What's the point?

    - by Frederik
    I've got a HashMap and I need to fetch an item by its integer value. I notice there's a containsValue() function, but it would appear I still have to iterate through the map to find the correct index anyway. My question is; why use containsValue() if I'm required to traverse it afterwards? Also, am I missing the point completely? ;-)

    Read the article

  • DataOutputStream, does it lose some bits

    - by user308806
    hello, I'm writing a client server application, but I don't receive the same bytes at the client side when they are sent from the server side. At the server side I used .write(bytes[]) method. At the client side, I used .readFully(byte[]) method. Do you have any idea ?

    Read the article

  • Arrays (toString) not output correctly

    - by DiscoDude
    Hello, Actually this tread is continuing from the other one. There wasn't enough characters to continue there. Anyway. the problem is that the output is "1(10) 2(23) 3(29)". Even though I could return string for the array values (10,23,29) and used string reference as 1, 2 and 3. My question is it possible to return index values 1,2,3 and as well as array values. Am I making an sense. Here is what I have done... // int[] groups = {10, 23, 29}; in the constructor String tempA = ""; String tempB = " "; int[] temp = new int[4]; int length = groups.length; for (int j = 0; j < length; j++) { temp[j] = groups[j]; tempB = tempB + "("+goups+")"; } groups = temp; Arrays.sort(coingroups); for(int i = 1; i < groups.length;i++) { tempA = tempA+" "+(i)+ "("+groups[i]+")"; } return tempA;

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038  | Next Page >