d_path_vec Class Reference

The array containing the furthest D-path end-points, for each value of K. MAX_D is the maximum value of the D-Path. That is, M+N if M is the size of the first input string, and N is the size of the second. More...

#include <abg-diff-utils.h>

Inheritance diagram for d_path_vec:

Public Member Functions
	d_path_vec (unsigned size1, unsigned size2)
	Constructor of the d_path_vec. More...
unsigned	a_size () const
std::vector< int >::reference	at (long long index)
std::vector< int >::const_reference	at (long long index) const
unsigned	b_size () const
unsigned	max_d () const
unsigned	offset () const
std::vector< int >::reference	operator[] (int index)
std::vector< int >::const_reference	operator[] (int index) const

Detailed Description

The array containing the furthest D-path end-points, for each value of K. MAX_D is the maximum value of the D-Path. That is, M+N if M is the size of the first input string, and N is the size of the second.

Definition at line 454 of file abg-diff-utils.h.

Constructor & Destructor Documentation

d_path_vec()

d_path_vec ( unsigned  size1, unsigned  size2  )

inline

Constructor of the d_path_vec.

For forward vectors, the underlying vector allocates 2 * [MAX_D+1]. space, so that one can address elements in the index range [-MAX_D, MAX_D]. And MAX_D is the sum of the two sequence sizes. delta is the difference.

For reverse vectors, note that we need to be able to address [-MAX_D - delta, MAX_D + delta], with delta being the (signed) difference between the size of the two sequences. We consider delta being bounded by MAX_D itself; so we say we need to be able to address [-2MAX_D, 2MAX_D].

Parameters

size1	the size of the first sequence we are interested in.
size2	the size of the second sequence we are interested in.

Definition at line 505 of file abg-diff-utils.h.

---

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

• /home/dodji/git/libabigail/master/include/abg-diff-utils.h