Java2007-09-14
store() and load() example in Java
One of the most useful aspects of Properties is that the information contained in a Properties object can be easily stored to or loaded from disk with the store() and load() method
Read tutorialAdvertisement
THE TUTORIAL LIBRARY
All tutorials
All topicsJava 388PHP 147VB.net 120C++ 111C 110Interview 108JSP 87Javascript 83Linux 63python 53Ruby 51Struts 47J2ME 47macos 38Asp.net 36Office365 35React-Native 33Trends 33JDBC 31Android 31Certification 29Hibernate 26data-science 21JSF 19Csharp 18MySQL 17Error 14Cocoa 14Perl 13Java Beans 12EJB 12Cloud 11WebServices 10node.js 9Ajax 7HTML5 7iPhone 6Git 6AI 6Photoshop 5Reviews 5xml 5Apache 4SAP 3NoSQL 1ELKStack 1Azure 1
Java2007-09-14
Properties example in Java
Properties is a subclass of Hashtable. It is used to maintain lists of values in which the key is a String and the value is also a String. The Properties class is used by many othe
Read tutorialJava2007-09-14
Hashtable example in Java
Hashtable was part of the original java.util and is a concrete implementation of a Dictionary. However, Java 2 reengineered Hashtable so that it also implements the Map interface.
Read tutorialJava2007-09-14
Stack example in Java - push(), pop(), empty(), search()
Stack is a subclass of Vector that implements a standard last-in, first-out stack. Stack only defines the default constructor, which creates an empty stack. Stack includes all the
Read tutorialJava2007-09-14
Vector example in Java
Vector implements a dynamic array. It is similar to ArrayList, but with two differences: Vector is synchronized, and it contains many legacy methods that are not part of the collec
Read tutorialJava2007-09-14
Arrays example in Java - asList(), binarySearch(), fill(), sort(), equals()
Java 2 added a new class to java.util called Arrays. This class provides various methods that are useful when working with arrays. Although these methods technically aren't part of
Read tutorialAdvertisement
Java2007-09-14
compare() example in Java
The following is an example that demonstrates the power of a custom comparator. It implements the compare() method so that it operates in reverse of normal. Thus, it causes a tree
Read tutorialJava2007-09-14
TreeMap example in Java
The TreeMap class implements the Map interface by using a tree. A TreeMap provides an efficient means of storing key/value pairs in sorted order, and allows rapid retrieval. You sh
Read tutorialJava2007-09-14
HashMap example in Java
The HashMap class uses a hash table to implement the Map interface. This allows the execution time of basic operations, such as get() and put(), to remain constant even for large s
Read tutorialJava2007-09-14
iterator() and hasNext() in Java
Before you can access a collection through an iterator, you must obtain one. Each of thecollection classes provides an iterator() method that returns an iterator to the start of th
Read tutorialJava2007-09-14
The TreeSet Class in Java
TreeSet provides an implementation of the Set interface that uses a tree for storage. Objects are stored in sorted, ascending order. Access and retrieval times are quite fast, whic
Read tutorialC++2007-09-14
What Is a Reference in C++?
A reference is an alias; when you create a reference, you initialize it with the name of another object, the target. From that moment on, the reference acts as an alternative name
Read tutorialThe future is yours to build.
One example today. A better developer tomorrow.