Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/sel__list__model__impl_8hpp_source.html below:

NCBI C++ ToolKit: include/gui/widgets/aln_multiple/sel_list_model_impl.hpp Source File

<

Item>

b_reset_others =

);

b_keep_selection =

);

<

Item>

: m_SelectedCount(0),

<

Item>

x_GetItemsCount();

<

Item>

x_GetItem(index);

<

Item>

m_iFocusedItem;

<

Item>

x_IsItemSelected(index);

<

Item>

m_SelectedCount;

<

Item>

= (

) x_GetItemsCount();

(

= 0;

<

;

++ ) {

(x_IsItemSelected(

)) {

vIndices.push_back(

);

<

Item>

= x_GetItemsCount();

(

= 0;

<

;

++ ) {

(x_IsItemSelected(

)) {

item = x_GetItem(

);

items.push_back(item);

<

Item>

(index != m_iFocusedItem) {

vUpdateItems.push_back(m_iFocusedItem);

m_iFocusedItem = index;

vUpdateItems.push_back(m_iFocusedItem);

x_ViewsUpdateItems(vUpdateItems);

<

Item>

x_GetSelectedItems(vPrevSel);

(m_iFocusedItem != index) {

(m_iFocusedItem >= 0 && ! x_IsItemSelected(m_iFocusedItem))

vPrevSel.push_back(m_iFocusedItem);

m_iFocusedItem = index;

(

= 0;

< vPrevSel.size();

++ ) {

x_SelectItem(idx,

);

x_SelectItem(index,

);

vPrevSel.push_back(index);

m_iAnchorItem = index;

}

m_SelectedCount = 0;

x_ViewsUpdateItems(vPrevSel);

<

Item>

(m_iFocusedItem != index) {

vIndices.push_back(m_iFocusedItem);

m_iFocusedItem = index;

b_old_sel = x_IsItemSelected(index);

x_SelectItem(index, ! b_old_sel);

vIndices.push_back(index);

m_iAnchorItem = index;

m_SelectedCount += b_old_sel ? -1 : 1;

}

m_SelectedCount = 0;

x_ViewsUpdateItems(vIndices);

<

Item>

(b_reset_others) {

n_items = x_GetItemsCount();

vector<bool> v_sel(n_items,

);

(

= 0;

< vIndices.size();

++ ) {

( ! v_sel[vIndices[

]]) {

v_sel[vIndices[

]] =

;

(

j= 0; j < n_items; j++ ) {

x_SelectItem((

) j, v_sel[j]);

m_SelectedCount =

;

x_ViewsUpdateItemRange(0, (

) n_items - 1);

( ! x_IsItemSelected(*it)) {

x_SelectItem(*it,

);

vUpdateIndices.push_back(*it);

m_SelectedCount += (

) vUpdateIndices.size();

x_ViewsUpdateItems(vUpdateIndices);

<

Item>

x_SelectItem(

, b_select);

m_SelectedCount = b_select ?

: 0;

x_ViewsUpdateItemRange(0,

- 1);

<

Item>

iStart =

(m_iAnchorItem, index);

iEnd =

(m_iAnchorItem, index);

bPrevFocusedChanged =

;

b_select = (

>= iStart &&

<= iEnd);

(x_IsItemSelected(

) != b_select)

x_SelectItem(

, b_select);

m_SelectedCount += b_select ? 1 : -1;

vUpdateIndices.push_back(

);

(

== m_iFocusedItem)

bPrevFocusedChanged =

;

(m_iFocusedItem != index)

( ! bPrevFocusedChanged)

vUpdateIndices.push_back(m_iFocusedItem);

m_iFocusedItem = index;

x_ViewsUpdateItems(vUpdateIndices);

<

Item>

( find(m_lsViews.begin(), m_lsViews.end(), pView) == m_lsViews.end()) {

m_lsViews.push_back(pView);

<

Item>

TViewList::iterator itView

= find( m_lsViews.begin(), m_lsViews.end(), pView);

(itView != m_lsViews.end()) {

m_lsViews.erase(itView);

<

Item>

b_update,

b_keep_selection)

items_n = vItems.size();

= x_GetItemsCount();

(

= 0;

< items_n;

++) {

v_entries[

].first = vItems[

];

(b_keep_selection) {

index = x_GetItemIndex(vItems[

]);

b_sel = (index > -1 && index <

) ? x_IsItemSelected(index) :

;

v_entries[

].second = b_sel;

x_SetEntries(v_entries);

m_SelectedCount = n_sel;

i_max =

(0, (

) items_n - 1);

x_ViewsUpdateItemRange(0, i_max);

<

Item>

n_items = v_items.size();

(n_items == v_indices.size());

i_min = x_GetItemsCount();

(

= 0;

< n_items;

++ ) {

ind =

(ind, x_GetItemsCount());

x_InsertItem(ind,

(v_items[

],

));

i_min =

(i_min, ind);

x_CompleteInsertion();

i_max =

(0, x_GetItemsCount() - 1);

x_ViewsUpdateItemRange(i_min, i_max);

<

Item>

(index >= 0 && index <= x_GetItemsCount()) {

x_InsertItem(index,

(item,

));

x_CompleteInsertion();

i_max =

(0, x_GetItemsCount() - 1);

x_ViewsUpdateItemRange(index, i_max);

<

Item>

(index >= 0 && index <

) {

(m_iFocusedItem == index)

(m_iAnchorItem == index)

m_iAnchorItem = m_iFocusedItem;

(x_IsItemSelected(index))

x_SelectItem(index,

);

x_MarkItemForErase(index);

x_EraseMarkedItems();

(bUpdate && min_del <

) {

x_ViewsUpdateItemRange(min_del,

-1);

<

Item>

(index >= 0 && index <

) {

(m_iFocusedItem == index)

(m_iAnchorItem == index)

m_iAnchorItem = m_iFocusedItem;

(x_IsItemSelected(index))

x_ViewsUpdateItemRange(0, i_max);

<

Item>

x_ViewsUpdateItemRange(0, -1);

<

Item>

m_iFocusedItem = m_iAnchorItem = -1;

<

Item>

vIndices.reserve(m_SelectedCount);

(x_IsItemSelected(

))

vIndices.push_back(

);

(vIndices.size() == (

) m_SelectedCount);

<

Item>

(*itView)->SLV_UpdateItems(vIndices);

<

Item>

(*itView)->SLV_UpdateRange(iStart, iEnd);

CSelListModelImpl provides a defult implementation of ISelListModel.

void x_ViewsUpdateItemRange(int iStart, int iEnd)

ISelListModel< Item >::TIndexVector TIndexVector

virtual TItem x_GetItem(TIndex index) const =0

bool DeleteItem(TIndex index, bool bUpdate=true)

void InsertItems(const TItemVector &v_items, const TIndexVector &v_indices, bool b_update)

void x_GetSelectedItems(TIndexVector &vIndices)

virtual void SLM_GetSelectedItems(TItemVector &items) const

vector< TItem > TItemVector

ISelListModel< TItem > TSelListModel

void DeleteItems(const TIndexVector &vIndices, bool b_update)

bool InsertItem(TIndex index, const TItem &item, bool b_update)

list< TSelListView * > TViewList

virtual void x_CompleteInsertion()=0

performs update after all items have been inserted

virtual void SLM_SelectItems(const TIndexVector &vIndeces, bool b_reset_others=false)

Select items with given indices.

virtual bool x_IsItemSelected(TIndex index) const =0

virtual TIndex SLM_GetItemsCount() const

vector< TItemEntry > TEntryVector

virtual TIndex SLM_GetSelectedCount() const

virtual void SLM_RemoveSLView(TSelListView *pView)

virtual void SLM_SelectAll(bool bSelect=true)

ISelListModel< Item >::TItem TItem

virtual bool SLM_IsItemSelected(TIndex index) const

virtual void SLM_GetSelectedIndices(TIndexVector &vIndices) const

virtual TIndex x_GetItemIndex(const TItem &item)=0

virtual void x_SelectItem(TIndex index, bool b_sel)=0

virtual void SLM_FocusItem(TIndex index)

virtual TIndex x_GetItemsCount() const =0

virtual void x_SetEntries(const TEntryVector &v_entries)=0

virtual void SLM_InvertSingleItem(TIndex index)

virtual void SLM_AddSLView(TSelListView *pView)

ISelListModel< Item >::TIndex TIndex

virtual void x_ClearItems()=0

virtual void x_EraseMarkedItems()=0

deletes all marked items in a single pass, performs neccessary updates

virtual TIndex SLM_GetFocusedItemIndex() const

void x_EraseItem(TIndex index)

TODO.

virtual void SLM_SelectTo(TIndex index)

virtual void SLM_SelectSingleItem(TIndex index)

virtual void x_InsertItem(TIndex index, const TItemEntry &entry)=0

inserts item, but does not updates all data structures

virtual void x_MarkItemForErase(TIndex index)=0

mark item for deletion

ISelListView< TItem > TSelListView

related interfaces

void x_ViewsUpdateItems(TIndexVector &vIndices)

void SetItems(const TItemVector &vItems, bool b_update, bool b_keep_selection=false)

map< TItem, int > TItemToIndexMap

CSelListModelImpl()

class CSelListModelImpl

virtual TItem SLM_GetItem(TIndex index) const

pair< TItem, bool > TItemEntry

vector< TIndex > TIndexVector

virtual void SLV_SetModel(TSelListModel *pModel)=0

Include a standard set of the NCBI C++ Toolkit most basic headers.

#define ITERATE(Type, Var, Cont)

ITERATE macro to sequence through container elements.

#define NON_CONST_ITERATE(Type, Var, Cont)

Non constant version of ITERATE macro.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

unsigned int

A callback function used to compare two keys in a database.

const struct ncbi::grid::netcache::search::fields::SIZE size

The NCBI C++/STL use hints.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4