«

Hi,
I am creating a structure / class having data type like

{
DOUBLE x;
DOUBLE y;
DOUBLE z;
}POINT3D;

now my data is stored in a file..so i need to create buffer to read
this points one by one...how i suppose to allocate memory for this
using NEW..i DONT want to create predefined fixed length array for this
as i dont know how many points are there in a file but i want to
allocate memory as i get next set of point. Can i use vector<> for such
type ? or is there any way to dynamically allocate memory to create
infinite or expandable array ? plz help
thanx in advance.

Akshay

wrote:
> now my data is stored in a file..so i need to create buffer to read
> this points one by one...how i suppose to allocate memory for this
> using NEW..i DONT want to create predefined fixed length array for this
> as i dont know how many points are there in a file but i want to
> allocate memory as i get next set of point. Can i use vector<> for such
> type ? or is there any way to dynamically allocate memory to create
> infinite or expandable array ? plz help
> thanx in advance.
Use vector<>, IMHO the best way to do it. You can expand it, erase
elements, sort when you want - without much work.

--
the code is my strength
SirMike

Hi,
Can anyone give me short example for this...I am using Vc++ 6.0.. how
to use vector to declare such type of array of structure / class ..
thanx
Akshay




SirMike <sirmike@****_SPAMMERSpoczta.onet.pl> wrote in message news:<cuv0h0$avr$>...
> wrote:
> > now my data is stored in a file..so i need to create buffer to read
> > this points one by one...how i suppose to allocate memory for this
> > using NEW..i DONT want to create predefined fixed length array for this
> > as i dont know how many points are there in a file but i want to
> > allocate memory as i get next set of point. Can i use vector<> for such
> > type ? or is there any way to dynamically allocate memory to create
> > infinite or expandable array ? plz help
> > thanx in advance.
> Use vector<>, IMHO the best way to do it. You can expand it, erase
> elements, sort when you want - without much work.