Comments for Karussell

Comment on Dell Latitude E6400 – The Perfect Linux Notebook? Or is Ubuntu The Perfect Linux? by thanks

thanks — Sat, 20 Apr 2013 16:01:20 +0000

Thanks for the info. Thanks for updating!!!

Comment on Running Shortest-Path Algorithms on the German Road Network within a 1.5GB JVM by karussell

karussell — Tue, 16 Apr 2013 05:52:48 +0000

Thanks, should be updated now.

Comment on Running Shortest-Path Algorithms on the German Road Network within a 1.5GB JVM by Paul

Paul — Mon, 15 Apr 2013 15:46:40 +0000

Very interesting post but all the links to the code on Github come back with a 404 error

Comment on Snacktory – Yet another Readability clone. This time in Java. by Siqi

Siqi — Fri, 05 Apr 2013 16:32:46 +0000

Hello, I’m trying to get major text from articles but I got a string without new line characters. Is there a way to extract the text while retaining all new line characters? Otherwise there will be only one single paragraphe per article…

Comment on Maven2. Phases vs. Goals by manmohan

manmohan — Fri, 08 Mar 2013 21:28:26 +0000

install is the phase in maven. Run is the goal of the plug in.

Comment on Code Quality Tools in Java by Alexander Rubinov

Alexander Rubinov — Sun, 03 Feb 2013 21:42:18 +0000

Hello, there is a new open source quality tool called CODERU (http://coderu.org , developed by me to support my current project) that uses quite other approach as FindBugs or PMD. While FindBugs and PMD have a focus on the method and algorithm level, CODERU addresses structural quality on package and therefor classes dependency level. CODERU force you and your teem member to write layered and component oriented code by follow predefined coding rules. The rules are simple, but prevent arising a complex design problems. The CODERU-rules rely on reserved package names and the allowed dependency rules between them expressed in a general way. Unlike other tool forcing you to define allowed or disallowed individual package dependencies CODERU is based on a fixed set of general rules. The dependencies between packages need not be defined explicitly. For more information visit a tool home page . Ciao, Alexander

Comment on Longest Common Substring Algorithm in Java by karussell

karussell — Thu, 24 Jan 2013 09:16:49 +0000

This works for long strings as well but you’ll just need a different int storage … of course, arrays are limited to 2gb lengths … BTW: to find common substrings for large text could be better done with lucene

Comment on Longest Common Substring Algorithm in Java by Javier

Javier — Wed, 23 Jan 2013 22:03:50 +0000

This doesn’t work for really long strings. I am trying to compare strings of size in the million characters and the line “int[][] num = new int[str1.length()][str2.length()];” tries to make an array so huge that it runs out of memory. Saying that each string is 1m characters, the array size would be 1,000,000,000,000…

Comment on Use cases of faceted search for Apache Solr by hass

hass — Tue, 15 Jan 2013 17:17:18 +0000

Hi,
When I do facet=true&facet.field=manu. It gives me list but each int name is just one word. Like in your example i get Canon seperate and USA seperate. How can i get both of them together in one int name?

Comment on Memory Efficient Java – Mission Impossible? by karussell

karussell — Fri, 04 Jan 2013 13:03:14 +0000

Thanks Peter, I already use the off heap technic with good results in my graphhopper project to access a lot memory also for memory restricted environments like Android.