DATA STRUCTURE - Persistent Data structure

In computing, a persistent data structure is a data structure that always preserves the previous version of itself when it is modified.

https://en.wikipedia.org/wiki/Persistent_data_structure

DATA STURCTURE - Singly and Dobly linked list

Basic explanation Singly and Dobly Linked list https://en.wikipedia.org/wiki/Linked_list

Dobly Linked list  https://en.wikipedia.org/wiki/Doubly_linked_list

JavaScript - collection method explaned

http://www.thatjsdude.com/interview/linkedList.html

GIT - a good tutorial

https://www.atlassian.com/git/tutorials/setting-up-a-repository

CSS - CSS3 tricks

http://habrahabr.ru/post/265451/
http://fox-hover.co.uk/basic-hover-pack/

JAVA - Out of Memory Errors by Incorrect Implementation of Equal and Hashcode, link

The relationship between the hashcode and equals methods and memory problems is not obvious at first. But we only need to think about hashmaps to make it more clear. An object's hashcode is used to insert and find objects in hashmaps. However, the hashcode is not unique, which is a why it only selects a bucket that can potentially contain multiple objects. Because of this, the equals method is used to make sure that we find the correct object. If the hashcode method is wrong (which can lead to a different result for otherwise-equal objects), we will never find an object in a hashmap. The consequence is often that the application inserts an object again and again.

Although the growing collection can easily be identified by most tools, the root cause is not obvious in a heap dump. I have seen this case over and over through the years, and one extreme case led the customer to run his JVMs with 40 GB of memory. The JVM still needed to be restarted once a day to avoid out-of-memory errors. We fixed the problem and now the application runs quite stable at 800 MB!

A heap dump — even if complete information on the objects is available — rarely helps in this case. One simply would have to analyze too many objects to identify the problem. The best approach is to be proactive and automatically unit-test comparative operators. A few free frameworks (such as EqualsVerifier) ensure that the equals and hashcode methods conform to the contract.

Use EqualsVerifier for Java UnitTests

It is taken from here http://www.dynatrace.com/en/javabook/other-java-memory-issues.html

MongoDB - docs for java, links

https://docs.mongodb.org/getting-started/java/

DOCKER: install on Windows

http://docs.docker.com/windows/step_one/

GWT register close listener on Window Javascript

http://www.itanswerz.com/42842/differentiate-browser-tab-close-and-refresh-to-detect-multiple-instances-of-application

GWT - Guava example Function, Predicate, Collections2 etc

http://blog.zenika.com/index.php?post/2011/10/04/Guava-par-l-exemple-(2/3)-%3A-les-collections

GWT - GWTQuery presentation 2015 link

http://gwtquery.github.io/gwt.create-slides/gwtcreate2015/gwtcreate2015.html
http://www.arcbees.com/

GWT chose framework (link)

Here is the alternative version of Select component:
http://jdramaix.github.io/gwtchosen/