Java2007-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 tutorialAdvertisement
THE TUTORIAL LIBRARY
All tutorials
All topicsJava 392PHP 151VB.net 120C++ 111C 110Interview 108JSP 87Javascript 83Linux 66python 56Ruby 51Struts 47J2ME 47macos 38Asp.net 36Office365 35Trends 33React-Native 33JDBC 31Android 31Certification 29Hibernate 26data-science 24JSF 19Csharp 18MySQL 17Cocoa 14Error 14Perl 13node.js 13AI 12EJB 12Java Beans 12Cloud 11WebServices 10Git 9Ajax 7HTML5 7iPhone 6Photoshop 5Reviews 5xml 5Apache 4SAP 3NoSQL 1ELKStack 1Azure 1
Java2007-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 tutorialJava2007-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 tutorialAdvertisement
Java2007-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 tutorialC++2007-09-14
const Pointers in C++
You can use the keyword const for pointers before the type, after the type, or in both places. For example, all of the following are legal declarations:
Read tutorialC++2007-09-14
Stray or Dangling Pointers in C++
One source of bugs that are nasty and difficult to find is stray pointers. A stray pointer is created when you call delete on a pointer--thereby freeing the memory that it points t
Read tutorialC++2007-09-14
this Pointer in C++
Every class member function has a hidden parameter: the this pointer. this points to the individual object. Therefore, in each call to GetAge() or SetAge(), the this pointer for th
Read tutorialC++2007-09-14
Dot (.) vs Arrow (->) to access data members in C++
Normally you can access data members and functions by using the dot (.) operator for Cat objects created locally. To access the Cat object on the free store, you must dereference t
Read tutorialThe future is yours to build.
One example today. A better developer tomorrow.