10 More Discussions You Might Find Interesting
1. Programming
Hello All,
I am a learner in C++. I was testing my inheritance knowledge with following piece of code.
#include <iostream>
using namespace std;
class base
{
public :
void display()
{
cout << "In base display()" << endl;
}
void display(int k)
{... (2 Replies)
Discussion started by: anand.shah
2 Replies
2. Programming
I have the two class definition as follows.
class A { public: int a; };
class B : virtual public A{ };
The size of class A is shown as 4, and size of class B is shown as 16. Why is this effect ?. (2 Replies)
Discussion started by: techmonk
2 Replies
3. UNIX for Advanced & Expert Users
Hi all!
I am trying to register a device in an existing device class, but I am
having trouble getting the pointer to an existing class.
I can create a class in a module, get the pointer to it and then use
it to register the device with:
*cl = class_create(THIS_MODULE, className);... (0 Replies)
Discussion started by: hdaniel@ualg.pt
0 Replies
4. UNIX for Dummies Questions & Answers
Hi all,
can some one help me out
file 1 i have
06/01 3:14 d378299
06/01 8:10 d642036
06/01 10:51 d600441
06/01 10:52 d600441
06/01 11:11 d607339
06/01 11:49 d398706
something like this and in file named list i have ( there is space btwn 06/01 and 11:49 and d398706)
d607339... (5 Replies)
Discussion started by: zozoo
5 Replies
5. Programming
Hi,
I believe the next code is wrong:
class Egg {
Egg e;
int i;
Egg(int ii=0) : i(ii) {}
};
because you would end up with an endless definition (memory allocation) of Egg objects, thus int i.
Ok, so God Eckel proposes for a singleton:
class Egg {
static Egg e;
int... (5 Replies)
Discussion started by: xavipoes
5 Replies
6. Shell Programming and Scripting
I have a sorted list (python) and I want to insert a string if it matches the pattern in list.
Example :
Sorted List
Above list is in sorted order. I need to insert a name in sorted order and also if the name already exist then it should be inserted before the existing... (1 Reply)
Discussion started by: pratapsingh
1 Replies
7. Shell Programming and Scripting
Hello I am trying to develop a shell script that takes a text file such as this...
E-mail@ Soc.Sec.No. *--------Name-----------* Class *School.Curriculum.Major.* Campus.Phone
JCC2380 XXX-XX-XXXX CAREY, JULIE C JR-II BISS CPSC BS INFO TECH 412/779-9445
JAC1936 XXX-XX-XXXX... (7 Replies)
Discussion started by: crimputt
7 Replies
8. Programming
Hi, i have a question about C++. Is it possible to declare a class with a member ot the same class? For example, a linked list or i want to convert this C code to C++ class (Elemento)
typedef struct elemento
{
char name;
char value;
List<struct elemento> ltElementos;
... (7 Replies)
Discussion started by: pogdorica
7 Replies
9. UNIX for Dummies Questions & Answers
im just trying to have some fun and kill some time writing a c++ program that has a person type in a car make and model then gives them a year and a price. or something like that. i always have problems getting it goin but once the ball is rolling im usually pretty good. anyone wanna help me out? ... (1 Reply)
Discussion started by: rickym2626
1 Replies
10. Shell Programming and Scripting
Hi Friends
How to list of all files in a particular directory structure, with out listing a particular file extn.
I mean to say in a folder structure I have many files ..I want to list them with out *.class files.
Please help
Thanks
Joy (3 Replies)
Discussion started by: itsjoy2u
3 Replies
Vector(7rheolef) rheolef-6.1 Vector(7rheolef)
NAME
Vector - STL vector<T> with reference counting
DESCRIPTION
The class implement a reference counting wrapper for
the STL vector<T> container class, with shallow copies.
See also:
@quotation The Standard Template Library, by Alexander Stephanov and Meng Lee.
@end quotation
This class provides the full vector<T>
interface specification
an could be used instead of vector<T>.
NOTE
The write accessors
T& operator[](size_type)
as in v[i]
may checks the reference count for each access.
For a loop, a better usage is:
Vector<T>::iterator i = v.begin();
Vector<T>::iterator last = v.end();
while (i != last) { ...}
and the reference count check step occurs only two time,
when accessing via begin() and end().
Thus, in order to encourage users to do it, we declare private
theses member functions. A synonym of operator[] is at.
IMPLEMENTATION
template<class T>
class Vector : private smart_pointer<vector_rep<T> > {
public:
// typedefs:
typedef iterator;
typedef const_iterator;
typedef pointer;
typedef reference;
typedef const_reference;
typedef size_type;
typedef difference_type;
typedef value_type;
typedef reverse_iterator;
typedef const_reverse_iterator;
// allocation/deallocation:
explicit Vector (size_type n = 0, const T& value = T ());
Vector (const_iterator first, const_iterator last);
void reserve (size_type n);
void swap (Vector<T>& x) ;
// accessors:
iterator begin ();
const_iterator begin () const;
iterator end ();
const_iterator end () const;
reverse_iterator rbegin();
const_reverse_iterator rbegin() const;
reverse_iterator rend();
const_reverse_iterator rend() const;
size_type size () const;
size_type max_size () const;
size_type capacity () const;
bool empty () const;
void resize (size_type sz, T v = T ()); // non-standard ?
private:
const_reference operator[] (size_type n) const;
reference operator[] (size_type n);
public:
const_reference at (size_type n) const; // non-standard ?
reference at (size_type n);
reference front ();
const_reference front () const;
reference back ();
const_reference back () const;
// insert/erase:
void push_back (const T& x);
iterator insert (iterator position, const T& x = T ());
void insert (iterator position, size_type n, const T& x);
void insert (iterator position, const_iterator first, const_iterator last);
void pop_back ();
void erase (iterator position);
void erase (iterator first, iterator last);
};
rheolef-6.1 rheolef-6.1 Vector(7rheolef)