t_cuesheet_index_list

#include <cuesheet_index_list.h>

Public Types
enum	{ count = 100 }

Public Member Functions
	t_cuesheet_index_list ()
bool	from_infos (file_info const &p_in, double p_base)
bool	is_empty () const
bool	is_valid () const
double	pregap () const
void	reset ()
double	start () const
void	to_infos (file_info &p_out) const

Data Fields
double	m_positions [count]

Detailed Description

Definition at line 1 of file cuesheet_index_list.h.

Member Enumeration Documentation

anonymous enum

Enumerator
count

Definition at line 3 of file cuesheet_index_list.h.

{count = 100};

Constructor & Destructor Documentation

t_cuesheet_index_list::t_cuesheet_index_list ( )

inline

Definition at line 4 of file cuesheet_index_list.h.

{reset();}

Member Function Documentation

bool t_cuesheet_index_list::from_infos	(	file_info const &	p_in,
		double	p_base
	)

Definition at line 52 of file cuesheet_index_list.cpp.

{
    double pregap;
    bool found = false;
    if (!parse_value(p_in.info_get("pregap"),pregap)) pregap = 0;
    else found = true;
    m_positions[0] = p_base - pregap;
    m_positions[1] = p_base;
    for(unsigned n=2;n<count;n++)
    {
        char namebuffer[16];
        sprintf_s(namebuffer,"index %02u",n);
        double temp;
        if (parse_value(p_in.info_get(namebuffer),temp)) {
            m_positions[n] = temp + p_base; found = true;
        } else {
            m_positions[n] = 0;
        }
    }
    return found;   
}

bool t_cuesheet_index_list::is_empty

(

)

const

Definition at line 74 of file cuesheet_index_list.cpp.

                                           {
    for(unsigned n=0;n<count;n++) if (m_positions[n] != m_positions[1]) return false;
    return true;
}

bool t_cuesheet_index_list::is_valid

(

)

const

Definition at line 7 of file cuesheet_index_list.cpp.

                                           {
    if (m_positions[1] < m_positions[0]) return false;
    for(t_size n = 2; n < count && m_positions[n] > 0; n++) {
        if (m_positions[n] < m_positions[n-1]) return false;
    }
    return true;
}

double t_cuesheet_index_list::pregap ( ) const

inline

Definition at line 15 of file cuesheet_index_list.h.

{return m_positions[1] - m_positions[0];}

void t_cuesheet_index_list::reset ( )

inline

Definition at line 5 of file cuesheet_index_list.h.

{for(unsigned n=0;n<count;n++) m_positions[n]=0;}

double t_cuesheet_index_list::start ( ) const

inline

Definition at line 14 of file cuesheet_index_list.h.

{return m_positions[1];}

void t_cuesheet_index_list::to_infos

(

file_info &

p_out

)

const

Definition at line 15 of file cuesheet_index_list.cpp.

{
    double base = m_positions[1];

    if (base > 0) {
        p_out.info_set("referenced_offset",cuesheet_format_index_time(base));
    }
    
    if (m_positions[0] < base)
        p_out.info_set("pregap",cuesheet_format_index_time(base - m_positions[0]));
    else
        p_out.info_remove("pregap");

    p_out.info_remove("index 00");  
    p_out.info_remove("index 01");
    
    for(unsigned n=2;n<count;n++)
    {
        char namebuffer[16];
        sprintf_s(namebuffer,"index %02u",n);
        double position = m_positions[n] - base;
        if (position > 0)
            p_out.info_set(namebuffer,cuesheet_format_index_time(position));
        else
            p_out.info_remove(namebuffer);
    }
}

Field Documentation

double t_cuesheet_index_list::m_positions[count]

Definition at line 12 of file cuesheet_index_list.h.

---

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

• foobar2000/helpers/cuesheet_index_list.h
• foobar2000/helpers/cuesheet_index_list.cpp

---

Generated by   1.8.11