int_vector Class Reference

#include <int_vector.h>

Collaboration diagram for int_vector:

[legend]

List of all members.

Public Member Functions
	int_vector ()
	int_vector (const int_vector &)
	int_vector (const std::vector< int > &)
	~int_vector ()
int	size () const
int	resize (int _size)
int &	operator[] (int k_vertex)
int	operator[] (int k_vertex) const
int_vector &	operator= (const int_vector &)
int	add_unique (int k_index)
int	add (int k_vertex)
int	add (const std::vector< int > &_int_list)
int	exists (int index_to_find) const
	check if the index exist.
Private Attributes
std::vector< int >	int_list
Friends
bool	operator== (const int_vector &cont_1, const int_vector &cont_2)
bool	operator!= (const int_vector &cont_1, const int_vector &cont_2)

---

Detailed Description

Definition at line 43 of file int_vector.h.

---

Constructor & Destructor Documentation

int_vector::int_vector

(

)

Definition at line 23 of file int_vector.cpp.

References int_list.

                      :
int_list()
{
  int_list.resize(0);
}

int_vector::int_vector

(

const int_vector &

_V

)

Definition at line 29 of file int_vector.cpp.

References int_list.

00029                                           :
00030   int_list()
00031 {
00032   int_list.resize(_V.int_list.size());
00033   for(int k=0;k<int(int_list.size());int_list[k]=_V.int_list[k],k++);
00034 }
int_vector::int_vector(const std::vector<int>& _V):

int_vector::int_vector

(

const std::vector< int > &

_V

)

Definition at line 35 of file int_vector.cpp.

References int_list.

                                              :
  int_list()
{
  int_list.resize(_V.size());
  for(int k=0;k<int(int_list.size());int_list[k]=_V[k],k++);  
}

int_vector::~int_vector

(

)

Definition at line 42 of file int_vector.cpp.

References int_list.

{
  int_list.resize(0);
}

---

Member Function Documentation

int int_vector::size

(

)

const

Definition at line 47 of file int_vector.cpp.

References int_list.

Referenced by Mesh_object::build_normal_intermediate(), Mesh_object::build_normal_per_vertex(), exists(), Mesh_object::Laplacien_smooth(), and operator==().

{
  return int_list.size();
}

Here is the caller graph for this function:

int int_vector::resize

(

int

_size

)

Definition at line 52 of file int_vector.cpp.

References int_list.

Referenced by Mesh_object::fast_subdivide_barycenter_mid_edge(), and Mesh_object::fast_subdivide_mixed_mid_edge().

{
  if(_size>=0)
    {
      int_list.resize(_size);
      return(0);
    }
  else
    {printf("error in resize in int_vector, size[%d] is not correct\n",_size);exit(-1);}

  return(-1);
}

Here is the caller graph for this function:

int & int_vector::operator[]

(

int

k_vertex

)

Definition at line 65 of file int_vector.cpp.

References int_list.

{
  if(k_vertex<0 || k_vertex>=int(int_list.size()))
    {printf("Error in operator [] in int_vector, k_vertex [%d] is not correct because int_list.size()=[%d] \n",k_vertex,int_list.size());exit(-1);}
  return int_list[k_vertex];
}  

int int_vector::operator[]

(

int

k_vertex

)

const

Definition at line 71 of file int_vector.cpp.

References int_list.

{
  if(k_vertex<0 || k_vertex>=int(int_list.size()))
    {printf("Error in operator [] in int_vector, k_vertex [%d] is not correct because int_list.size()=[%d] \n",k_vertex,int_list.size());exit(-1);}
  return int_list[k_vertex];
}  

int_vector & int_vector::operator=

(

const int_vector &

_V

)

Definition at line 79 of file int_vector.cpp.

References int_list.

{
  int_list.resize(_V.int_list.size());
  for(int k=0;k<int(_V.int_list.size());k++)
    int_list[k] = _V.int_list[k];
  return *this;
}

int int_vector::add_unique

(

int

k_index

)

Definition at line 88 of file int_vector.cpp.

References int_list.

{
  int k=0;
  for(k=0;k<int(int_list.size());k++)//go through the entire list
    if(int_list[k]==k_index)//if already exists
      return(-1);

  int_list.push_back(k_index);//in the other case, add the vertex number
  return 0;
}

int int_vector::add

(

int

k_vertex

)

Definition at line 99 of file int_vector.cpp.

References int_list.

{
  int_list.push_back(k_vertex);
  return(0);
}

int int_vector::add

(

const std::vector< int > &

_int_list

)

Definition at line 105 of file int_vector.cpp.

{
  int k=0;
  for(k=0;k<int(_int_list.size());k++)
    add(_int_list[k]);
  return 0;
}

int int_vector::exists

(

int

index_to_find

)

const

check if the index exist.

If the index already exists, returns its index Else return -1

Definition at line 113 of file int_vector.cpp.

References int_list, and size().

{
  int k=0;
  int N=size();
  for(k=0;k<N;k++)
    if(index_to_find==int_list[k])
      return k;
  return -1;
}

Here is the call graph for this function:

---

Friends And Related Function Documentation

bool operator==	(	const int_vector &	cont_1,
		const int_vector &	cont_2
	)			[friend]

Definition at line 123 of file int_vector.cpp.

{
  if(cont_1.size()!=cont_2.size())
    return 0;
  for(int k=0;k<cont_1.size();k++)
    if(cont_1[k]!=cont_2[k])
      return 0;
  return 1;
}

bool operator!=	(	const int_vector &	cont_1,
		const int_vector &	cont_2
	)			[friend]

Definition at line 132 of file int_vector.cpp.

{
  if(cont_1==cont_2)
    return 0;
  return 1;
}

---

Member Data Documentation

std::vector<int> int_vector::int_list [private]

Definition at line 72 of file int_vector.h.

Referenced by add(), add_unique(), exists(), int_vector(), operator=(), operator[](), resize(), size(), and ~int_vector().

---

The documentation for this class was generated from the following files:

• header/int_vector.h
• src/int_vector.cpp