When are Constructors Called?

http://www.geeksforgeeks.org/when-are-constructors-called/



When are the constructors called for different types of objects like global, local, static local, dynamic?

1) Global objects: For a global object, constructor is called before main() is called. For example, see the following program and output:

#include<iostream>
using namespace std;
 
class Test
{
public :
   Test();
};
 
Test::Test()  {
     cout << "Constructor Called \n" ;
}
 
Test t1;
 
int main() {
     cout << "main() started\n" ;
     return 0;
}
/* OUTPUT:
       Constructor Called
       main() started
*/

2) Function or Block Scope ( automatic variables and constants ) For a non-static local object, constructor is called when execution reaches point where object is declared. For example, see the following program and output:

using namespace std;
 
class Test
{
public :
   Test();
};
 
Test::Test()  {
     cout << "Constructor Called \n" ;
}
 
void fun() {
   Test t1;
}
 
int main() {
     cout << "Before fun() called\n" ;
     fun();
     cout << "After fun() called\n" ;
     return 0;
}
/* OUTPUT:
        Before fun() called
        Constructor Called
        After fun() called
*/

For a local static object, the first time (and only the first time) execution reaches point where object is declared. For example, output of the following program is:

#include<iostream>
using namespace std;
 
class Test
{
public :
   Test();
};
 
Test::Test()  {
     cout << "Constructor Called \n" ;
}
 
void fun() {
   static Test t1;
}
 
int main() {
     cout << "Before fun() called\n" ;
     fun();
     cout << "After fun() called\n" ;
     fun();  //constructor is not called this time.
     return 0;
}
/* OUTPUT
        Before fun() called
        Constructor Called
        After fun() called
*/

3) Class Scope: When an object is created, compiler makes sure that constructors for all of its subobjects (its member and inherited objects) are called. If members have default constructurs or constructor without parameter then these constrctors are called automatically, otherwise parameterized constructors can be called usingInitializer List. For example, see PROGRAM 1 and PROGRAM 2 and their output.

// PROGRAM 1: Constrcuctor without any parameter
#include<iostream>
using namespace std;
 
class A
{
public :
   A();
};
 
A::A() {
     cout << "A's Constructor Called \n" ;
}
 
class B
{
   A t1;
public :
   B();
};
 
B::B() {
     cout << "B's Constructor Called \n" ;
}
 
int main() {
     B b;
     return 0;
}
/* OUTPUT:
       A's Constructor Called
       B's Constructor Called
*/
// PROGRAM 2: Constrcuctor with parameter (using initializer list)
#include <iostream>
using namespace std;
 
class A
{
public :
     int i;
     A( int );
};
 
A::A( int arg)
{
     i = arg;
     cout << "A's Constructor called: Value of i: " << i << endl;
}
 
// Class B contains object of A
class B
{
     A a;
public :
     B( int );
};
 
B::B( int x):a(x)
{
     cout << "B's Constructor called" ;
}
 
int main()
{
     B obj(10);
     return 0;
}
/* OUTPUT
        A's Constructor called: Value of i: 10
        B's Constructor called
*/

4) Dynamic objects: For a dynamically allocated object, constructor is invoked by new operator. For example, see the following program and output.

#include<iostream>
 
using namespace std;
 
class Test
{
public :
   Test();
};
 
Test::Test()  {
     cout << "Constructor Called \n" ;
}
 
int main()
{
     cout << "Before new called\n" ;
     Test *t1 = new Test;
     cout << "After new called\n" ;
     return 0;
}
/* OUTPUT
       Before new called
       Constructor Called
       After new called
*/

References:
http://web.cs.wpi.edu/~cs2303/c10/Protected/Lectures-C10/Week5_MoreClasses.ppt

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

The goal of task 1 The goal of this exercise is to implement a Stack data structure. The implementation must pass all the tests included in the exercise. Time complexity requirements: capacity(): O(1). push(): O(1), except for when reallocation must be done: O(n). pop(): O(1). peek(): O(1). size(): O(1). isEmpty(): O(1). toString(): O(n). clear(): O(1). When implementing clear() you may decide yourself if you want to keep the current capacity or will the capacity be the default capacity of a queue. Note that the method toString() in this and later execises must be implemented using Java StringBuilder, not by using the String by modifying and appending to a String object. When handling large amounts of data elements, with String, this is hundreds of times slower than using StringBuilder. This has already been implemented for you. Prerequisites You have all the tools installed and working. This was tested in the 00-init exercise of the course. If you haven't done that yet, do it now. Instructions An overview of the classes in this exercise is shown in the UML class diagram below. Note that in this task, you only work with the StackImplementation class. The class ParenthesisTChecker.java and StackFactory.createCharacterStack() are not needed until you start working with the additional tasks. If you want to, you may crete your own main app file, for example in src/main/java/oy/tol/tra/Main.java, where you may implement your own main() method to experiment with your stack implementation. However, the main goal of the exercise is to pass all the unit tests. Do not implement main() method to data structure classes or test classes! Before delivery, remove all main functions an any unnrcessary test code. UML class diagram You should implement the interface StackInterface in the StackImplementation.java which is already created for you and located in this project's src/main/java/oy/tol/tra/ directory! Note that the StackImplementation uses E template parameter for the StackInterface: public class StackImplementation<E> implements StackInterface<E> { So the stack is a generic (template) class. Make sure to read the StackInterface documentation (the comments in the code) carefully so that your implementation follows the interface documentation. Obviously you need to know how stacks work in general, so check out the course lectures and other material on stack data structures. In this exercise, you use the Java plain array as the internal data structure for holding the elements: private Object [] itemArray; Since all Java classes inherit from Object, we can create an array of Objects for the elements. In the StackImplemention, constructors, follow the code comments and allocate the array of elements, in addition to other things you need to implement: itemArray = new Object[capacity]; Make sure to implement reallocating more room in the StackImplementation internal array if array is already full, when push() is called! After you have implemented your stack class methods, you can see that it is already instantiated for you in StackFactory.createIntegerStack(). After this, you are ready to test your implementation.
03-08
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值