Search Results

Search found 33141 results on 1326 pages for 'java opts'.

Page 307/1326 | < Previous Page | 303 304 305 306 307 308 309 310 311 312 313 314  | Next Page >

• What is an Enterprise Java Bean really?

  - by HDave

  On the Tomcat FAQ it says: "Tomcat is not an EJB server. Tomcat is not a full J2EE server." But if I: use Spring to supply an application context annotate my entities with JPA annotations (and use Hibernate as a JPA provider) configure C3P0 as a connection pooling data source annotate my service methods with @Transactional (and use Atomikos as JTA provider) Use JAXB for marshalling and unmarshalling and possibly add my own JNDI capability then don't I effectively have a JEE application server? And then aren't my beans EJBs? Or is there some other defining characteristic? What is it that a JEE compliant app server gives you that you can't easily/readily get from Tomcat with some 3rd party subsystems?

  Read the article

• Dynamic, reflective SignalHandler in Java

  - by pilcrow

  How do I install signal handling logic iff sun.misc.Signal is available? Background First generation of my code looked something like this: class MyApp { public static void main(String[] args) { ... Signal.handle(term_sig, new SignalHandler() { public void handle(Signal sig) { ... } }); ... } } I believe I understand how to reflectively test for and use signal handlers -- Class.forName("sun.misc.Signal"), reflectively call Signal.handle, and so forth. My impulse was simply to instantiate another anonymous inner class with the dynamically obtained SignalHandler class, but I think that's just wishful syntax.

  Read the article

• How to find the largest square in the number (Java)

  - by Ypsilon IV

  Hello everyone, I want to find the largest square in the number, but I am stuck at some point. I would really appreciate some suggestions. This is what I've done so far: I take the number on the input, factorize into prime numbers, and put the sequence of prime numbers to ArrayList. Numbers are sorted, in a sense, thus the numbers in the sequence are increasing. For example, 996 is 2 2 3 83 1000 is 2 2 2 5 5 5 100000 is 2 2 2 2 2 5 5 5 5 5 My idea now is to count number of occurrences of each elements in the sequence, so if the number of occurrences is divisible by two, then this is the square. In this way, I can get another sequence, where the right most element divisible by two is the largest square. What is the most efficient way to count occurrences in the ArrayList? Or is there any better way to find the largest square? Many thanks in advance!

  Read the article

• Java: Are these 2 codes the same?

  - by Kevin Duke

  for (Player p : players) { p.addCard(deck.dealCard()); p.addCard(deck.dealCard()); } and for (int i = 0; i < players.size() ; i++) { Player p = players.get(i); p.addCard(deck.dealCard()); p.addCard(deck.dealCard()); } The second code yeilds a null pointer exception, what can be done to make the bottom one equivalent ?

  Read the article

• Update music file details - Java.

  - by Desorder

  Hi all, Well, I'm a music fan guy, and now with my 18000 music collection, it's getting very hard to maintain. So, I would like to ask I could of question to help to write an app to maintain it for me. 1- How can I access a music file and read details of it? I mean, I would like to write some code and passing the directory, my app would read all the music files (understand mp3 files) and with that I would like to access details like title, artist, length and so on... 2- Is there a public source that I could access and update my file? A webservice somewhere that I could connect, query some information based on song name, or artist or whatever. I would like to achieve a final result of given a directory, my app would read the file, collect some information and query the source for a complete list of detail and update my file. Thank you guys for any help...

  Read the article

• Why doesn't Java Map extends Collection?

  - by polygenelubricants

  I was surprised by the fact that Map<?,?> is not a Collection<?>. I thought it'd make a LOT of sense if it was declared as such: public interface Map<K,V> extends Collection<Map.Entry<K,V>> After all, a Map<K,V> is a collection of Map.Entry<K,V>, isn't it? So is there a good reason why it's not implemented as such?

  Read the article

• Do the Java platform libraries support https

  - by Zombies

  All I need to to do is to connect via https. Must I use commons client for this?

  Read the article

• Java - 'continue' loop iteration after certain timeout period

  - by Matt

  Is there a way to exit ('continue;') a loop iteration after a certain timeout period? I have a loop that will run gathering data from the web and then use this data to make a calculation. The data become obsolete after about 1 to 2 seconds so if the loop iteration takes longer than 1 second then i want it to 'continue' to the next iteration. Sometimes gathering the data can take time but sometimes the calculation can take longer than 1 second so a HTTP timeout won't work for what i need. Also, while doing the calculation the thread i am using is blocked so i cannot check System.currentTimeMillis(); Is there a way to use another Thread to check the time and force the original for loop to continue.

  Read the article

• Best Redis library for Java

  - by muriloq

  The official Redis homepage lists JDBC-Redis and JRedis. What are the advantages / disadvantages of each ? Are there any other options ?

  Read the article

• delete item from array in java

  - by davit-datuashvili

  hello can anybody tell me what is wrong here? i want delete item from array but it shows me error ArrayIndexOutBound exception public class delete{ public static void main(String[]args){ int i; //delete item from array int k[]=new int[]{77,99,44,11,00,55,66,33,10}; //delete 55 int searchkey=55; int nums=k.length; for ( i=0;i<nums;i++) if (k[i]==searchkey) break; for (int t=i;t<nums;t++) k[t]=k[t+1]; nums--; for (int m=0;m<nums;m++){ System.out.println(k[m]); } } }

  Read the article

• Java: JGraphT: Iterate through nodes

  - by Rosarch

  I'm trying to iterate through all nodes, so I can print them out for graphviz. What is the best way to do that using the JGraphT library? public static void main(String[] args) { UndirectedGraph<String, DefaultEdge> g = new SimpleWeightedGraph<String, DefaultEdge>(DefaultEdge.class); String odp = "ODP"; String cck = "CCK"; String mfe = "MFE"; g.addVertex(odp); g.addVertex(cck); g.addVertex(mfe); g.addEdge(odp, cck); g.addEdge(odp, mfe); } Also, how do I add edge weights? Edit: This seems to work pretty well. But is there a better way? Set<DefaultEdge> edges = g.edgeSet(); for (DefaultEdge e : edges) { gv.addln(String.format("\"%s\" -> \"%s\"", g.getEdgeSource(e), g.getEdgeTarget(e))); }

  Read the article

• Java regex to get part number

  - by Blankman

  I have HTML that I need to extract a part number from, the HTML looks like: javascript:selectItem('ABC123 1', '..... I need to get the ABC123 from the above. My code snippet: Patterp p = Pattern.Compile("?????"); Matcher m = p.matcher(html); if(m.find()) partNumber = m.group(1).trim(); BTW, in the pattern, how do I escape for the character ( I now for quotes I do \" thanks allot!

  Read the article

• what is the kind of spaces in java?

  - by androidbase Praveen

  what is difference of below operators for spaces? \t, \n, \x0B, \f and \r.

  Read the article

• Statically checking a Java app for link errors

  - by monorailkitty

  I have a scenario where I have code written against version 1 of a library but I want to ship version 2 of the library instead. The code has shipped and is therefore not changeable. I'm concerned that it might try to access classes or members of the library that existed in v1 but have been removed in v2. I figured it would be possible to write a tool to do a simple check to see if the code will link against the newer version of the library. I appreciate that the code may still be very broken even if the code links. I am thinking about this from the other side - if the code won't link then I can be sure there is a problem. As far as I can see, I need to run through the bytecode checking for references, method calls and field accesses to library classes then use reflection to check whether the class/member exists. I have three-fold question: (1) Does such a tool exist already? (2) I have a niggling feeling it is much more complicated that I imagine and that I have missed something major - is that the case? (3) Do you know of a handy library that would allow me to inspect the bytecode such that I can find the method calls, references etc.? Thanks!

  Read the article

• check if a line is valid or not in Java

  - by Adnan

  I would like to perform checking on the following: VALID LINES; /**/ some code */ some code /** dsfsdkf sd**/ NOT VALID LINES; /**/ //some code */ /***/ //somecode So basically if there is a line of code outside a comment it is valid, otherwise not. What would be the best way to tackle this kind of validation? Note: For */ I assume that the /* has been opened some lines before.

  Read the article

• Java- screen capture behind the application.

  - by Auxiliary

  Is there a way to capture the screen but without the app itself getting shown. I know how to minimize or make a frame invisible but this has to be done real fast cos it's going to happen alot in each second (at least once every second). I want it to look something like the magnifier in Windows Vista/7. (The app can see behind itself.) Thanks in advance.

  Read the article

• Java Custom exception throw behaves differently between different Projects

  - by Pablo

  I am attempting to call the following in my code: public void checkParticleLightRestriction(Particle parent) throws LightException { if ( parent == null ) { throw new LightException("quantum-particle-restrict.23", this); } In one Project the exception is thrown and the effect is similar to calling "return" whereby I am returned back to the point immediately succeeding where this method was called. However in another Project I get thrown completed out of the current package and to a point way prior to the point preceeding this method. It likes instead of being kicked out of a bar I am being deported all the way out of the country. My option are the wrap the throw in a try / catch but I am wondering why this difference in behaviour beween the 2 projects ?

  Read the article

• Java Split not working as expected

  - by daaabears

  I am trying to use a simple split to break up the following string: 00-00000 My expression is: ^([0-9][0-9])(-)([0-9])([0-9])([0-9])([0-9])([0-9]) And my usage is: String s = "00-00000"; String pattern = "^([0-9][0-9])(-)([0-9])([0-9])([0-9])([0-9])([0-9])"; String[] parts = s.split(pattern); If I play around with the Pattern and Matcher classes I can see that my pattern does match and the matcher tells me my groupCount is 7 which is correct. But when I try and split them I have no luck.

  Read the article

• Java: JButton actionListener explantation

  - by MrDoctorProfessorTyler

  I am extremely confused as to how a JButton works. I have read over the oracle documents of the JButton, but I have failed to see how a JButton can have an actionlistener added to it. I have really always wondered how things like JFrames and all that can have things like .addMouseListener and all that. Can anyone explain how a JButton can have an actionListener added to it like the .addActionListener(...) syntax?

  Read the article

• Java - What's the most efficient way of removing a set of elements from an Array[]

  - by fraido

  I've something like this Object[] myObjects = ...(initialized in some way)... int[] elemToRemove = new int[]{3,4,6,8,...} What's the most efficient way of removing the elements of index position 3,4,6,8... from myObjects ? I'd like to implement an efficient Utility method with a signature like public Object[] removeElements(Object[] object, int[] elementsToRemove) {...} The Object[] that is returned should be a new Object of size myObjects.length - elemToRemove.length

  Read the article

• Output Parameter in java

  - by soclose

  Hi, could u give me a sample code of using output parameter in function? I tried to google it but just found it in function. I'd like to use this output value in another function. I will use this code in Android.

  Read the article

• Java: Reflection against casting when you know superclass

  - by Ema

  I don't know exactly how to define my doubt so please be patient if the question has already been asked. Let's say I have to dinamically instantiate an object. This object will surely be instance of a subclass of a known, immutable class A. I can obtain dinamically the specific implementation class. Would it be better to use reflection exactly as if I didn't know anything about the target class, or would it be preferrable/possible to do something like: A obj = (Class.forName("com.package.Sub-A")) new A(); where Sub-A extends A ? The purpose would be to avoid reflection overhead times... Thank you in advance.

  Read the article

• Java side scrolling game on android

  - by hanesjw

  I'm trying to make an easy side scrolling game just to learn the ropes of game programming on android. I came up with a solution of how to make it but I don't really think it is the most elegant solution. I wanted to get some different ideas on how to implement my game, as I really have no other solution right now. Here is a quick explanation of how it works.. I basically have blocks or objects fall from the top of the screen. The blocks are defined from a pre-defined string I create using a custom 'map-editor'. I create all the blocks at compile time, position them on or off the screen and simply increment their coordinates with each iteration of the gameloop. It is actually done a little bit better then that, but that gives a short easy explanation on the basic idea. I heard from a few people that instead of incrementing each block position, have the blocks stay there and simply change the viewable area. That makes sense, but I have no idea how to do it. Can anyone share some ideas or links on how I can implement something like this? I know my current solution isn't the greatest. Thanks!

  Read the article

• Java Recursion Triangle Standing on Tip

  - by user1629075

  I was wondering how to create triangle out of asterisks on its tip rather than on its base. I have the code for making it stand on its base: public static String printTriangle (int count) { if( count <= 0 ) return ""; String p = printTriangle(count - 1); p = p + "*"; System.out.print(p); System.out.print("\n"); return p; } But then I'm stuck on how to have the greatest number of stars on the top, and then the next least, and so on. I was thinking something along the terms of having (count - p) to have the input of rows be subtracted from the amount of decrease, but then i was confused by this idea because p is string. EDIT: I tried changing the position of printTriangle(count - 1) using my original method without iterations and got 1 star per each line; how can I fix this? public class triangles { public static void main(String[] args) { printTriangle(5); } public static String printTriangle (int count) { if( count <= 0 ) return ""; String p = ""; p = p + "*"; System.out.print(p); System.out.print("\n"); p = printTriangle(count - 1); return p; } }

  Read the article

• Web Form based login in Java

  - by BrunoLM

  How can I block access to the site if a user is not logged in? Under web.xml Security I checked Form authentication then I selected Login and Error page, but I don't know how to block the access and redirect the user to the login page. Do I need a filter? If so, how can I get the login url I specified? And how should I call the validation method? I saw in some examples this code <form method=post action="j_security_check"> <input type="text" name="j_username" /> <input type="password" name="j_password" /> </form> What does it do?

  Read the article

< Previous Page | 303 304 305 306 307 308 309 310 311 312 313 314  | Next Page >