free java projects with source code

expansion of the original twice times.Iteratorsprivate abstract class HashIteratorIn fact, the implementation of the iterator in the collection implementation of the class are similar, as long as you see one on it. This also records the number of changes expectedmodcount, that is, after the iterator is created, it is not possible to iterate during the modecount++ such operations, or appear fail-fastSerialization and deserialization-saving and reading the state of HashMapprivate void WriteObject

memory, will not cause fragmentation.Selection of arrays and linked listsFrom the above analysis, the difference between the array and the linked list affects us the most: The array is quickly found by location, and the linked list is easy to delete Arrays are fixed size and linked lists can be expanded and scaled down at any time Linked list each element occupies slightly more memory than the array Arrays and linked lists are generally more common in queries, and take a lo

Java recommended readings and source code readingJiangsu Wuxi Miuxiaodong1. Java Language BasicsWhen it comes to basic Java language Learning books, you will definitely recommend Bruce Eckel's "Thinking in Java". It is a very prof

and native code execution in many Projects. The decison is made for the performance/memory/factors. For example, the interpreter in Cruby under 1.9 is AST interpreter this does not generate. However, it generates bytecode since V1.9 for the performance purpose. Similarly, the jruby+truffle take the idea of early Cruby. The interpreter walks on the AST tree and then truffle (Graal) compiles the

successfully. If the Java command does not execute successfully, add an entry in path (add a new item after the value of the previous path), as follows: D:/program files/java/jdk1.6.0_17 If the Javac command does not execute successfully, add another entry in path, as follows: D:/program Files/java/jdk1.6.0_17/bin The

Reprint Please specify Source: http://blog.csdn.net/tang9140/article/details/43445511This article mainly describes how to use the Xmemcached client to interact with the memcached server. Through the Xmemcached API call and memcached set/get command comparison and tracking xmemcached source code, so that we have a deeper understanding of the Xmemcached API, to und

The difference between the source code, the reverse code, and the supplementary code in Java >>>> and the reverse code. When I analyzed the HashMap hash algorithm two days ago, I met the >>and >> symbols. At that time, I checked t

The problem is: the path to the keyboard input file, find content, and replace content to find and replace the contents of the file for the specified path. ” Long time no write interface, today familiar with the interface of the writing and listener operation. The problem is not very difficult in itself, and the focus should be on the handling of various possible errors during file processing. So write code needs to be very careful, and the error is h

time of the task. Let's look at the source code: Package Nov; import Java. util. date; import Java. util. timer; import Java. util. timertask;/***** Execution result: The execution time of this task is Thu Nov 29 10:39:38 CST 2012. The execution time of this task is Th

Java concurrency series [6] ---- Semaphore source code analysis, java ---- semaphore Semaphore is a common class in the JUC package. It is an application in the AQS sharing mode and allows multiple threads to operate on shared resources at the same time, in addition, it can effectively control the number of concurrent

For example, to count the workload of a Java programmer writing code in one day (for example, the number of lines of valid code, the number of blank lines, and the number of lines of comments), this tool may serve as a reference. Idea: because the content of each Java source

;linkedlist,add (e e), because of the existence of node last, O (1), add (int, E), need to traverse the depth of int first, In fact, the increment is the process of re-assignment, not the process of traversal, but also O (1), but actually a round down, also reduced to O (n);Delete: Arraylist,o (n), need to system.arraycopy;linkedlist, only see Delete, O (1), but in any case can not ignore the performance of the search consumption, and eventually reduced to O (n);Change: ArrayList, specify the po

Original: Java Swing development of short and concise Tetris game source code download, only 300 lines of codeSource code: Http://www.zuidaima.com/share/1550463495146496.htmJava Swing development of short and short Tetris game source cod