free java projects with source code

LinkedHashMap source code analysis of Java Collection series, linkedhashmap source code In this article, we started to analyze the source code of LinkedHashMap. LinkedHashMap inherits H

[Java Collection source code analysis] TreeMap source code analysis Reprinted please indicate the source: http://blog.csdn.net/ns_code/article/details/36421085 Preface This article does not intend to extend the style of the previo

Recently, we need to build a Java Server. Since Google App Engine cannot be used in China, we finally found jhost, which claims to provide free Java host space, which is officially described as"Jhost (www.jhost.cn) provides a free and free website creation platform, supports

Java list source code analysis, list source code analysis Three Data Structure linked lists, trees, and graphs. As one of them, the sequence table is the longest used in programming. The List interface is the implementation of sequence tables in

Recordaccess method here. Suppose that the collation of the elements in the list is sorted according to the order in which they were inserted. This method does nothing,//if the collation of the elements in the list is sorted according to the order of the visits, then E is moved to the end of the list. Public V Get (Object key) { entryGet entry first. Assuming not NULL, the same call to the Recordaccess method, which has been said very clearly, here is not much explanation.7, finally s

summaryThis article on the analysis of TreeMap a little bit more than the previous articles, treemap with no hashmap so much. We have a macro to compare me and compare it.1, TreeMap is based on key to sort, its ordering and positioning need to rely on the comparison or overwrite comparable interface. It also eliminates the need for key to overwrite the Hashcode method and the Equals method to eliminate the repeated key. The key of HashMap is to ensure that there are no repeated keys by coverin

JAVA concurrent API source code parsing: Atomic class, api source code The JAVA. util. concurrent. atomic package of java APIs provides a series of classes that do not need to be synchr

From the source code analysis java Collection [HashMap], the source code javahashmap As we know, Map stores key-value pairs. Its basic unit is to implement Node static class Node You can see its function by looking at the definition. It stores an object next to the next no

styleTechnical Architecture Diagram:650) this.width=650; "src=" Https://static.oschina.net/uploads/space/2017/1023/213011_I6wL_3613013.jpg "height=" "Width=" 852 "/>Code structure diagram:650) this.width=650; "src=" Https://static.oschina.net/uploads/space/2017/1023/212903_HOgh_3613013.jpg "height=" "Width=" 873 "/>"App Interface:650) this.width=650; "src=" Https://static.oschina.net/uploads/space/2017/1023/220515_lPon_3613013.jpg "height=" 583 "widt

Java Collection: HashMap source code analysis, hashmap source code1. HashMap Overview HashMap is implemented based on the Map interface of the hash table. This implementation provides all optional ing operations and allows the use of null values and null keys. (Except for not synchronizing data and allowing null, The H

Source code analysis of javaslist in Java Collection series, and javaslist source code In the previous article, we analyzed the underlying implementation of ArrayList and learned that the underlying implementation of ArrayList is based on arrays. Therefore, it has the charac

[Java concurrent programming] 22. Exchanger source code parsing and exchanger source code Exchanger is a two-way data transmission. Two threads exchange data at a synchronization point. The first thread will wait for the second thread to execute exchangeSynchronousQueue is a

storage structure was consistent, and red-black trees were added to optimize after JDK1.8.Advantages and disadvantages of hash tableThe hash table is an optimized storage idea, and the specific storage elements are still other data structures.A well-designed hash table that combines the advantages of both arrays and lists provides good performance in both insertion and lookup.Poorly designed hash tables are likely to have more hash collisions, resulting in a chain list that is too long, making

I think there are three core points in the source code reading: technical foundation + strong curiosity + patience. Speaking of the technical foundation, let me give you an example. If you have never learned Java or any programming language such as C ++, you should start with core Java. it is very difficult for you to

-C/c++/java source code beautification tool.Astyle than indent There are many sets of style definition: ANSI Java Linux ... You do not have to remember the complex indentation specific options. After downloading the source code