2006-02-11 18:23:23 +03:00
|
|
|
/*
|
2009-06-17 18:56:57 +04:00
|
|
|
* Copyright 2006-2009, Haiku, Inc. All Rights Reserved.
|
2006-02-11 18:23:23 +03:00
|
|
|
* Distributed under the terms of the MIT License.
|
|
|
|
*/
|
2002-10-23 17:54:44 +04:00
|
|
|
#ifndef _OUTLINE_LIST_VIEW_H
|
|
|
|
#define _OUTLINE_LIST_VIEW_H
|
|
|
|
|
2006-02-11 18:23:23 +03:00
|
|
|
|
2002-10-23 17:54:44 +04:00
|
|
|
#include <ListView.h>
|
|
|
|
|
|
|
|
class BListItem;
|
|
|
|
|
|
|
|
|
|
|
|
class BOutlineListView : public BListView {
|
2009-06-17 18:56:57 +04:00
|
|
|
public:
|
2006-02-11 18:23:23 +03:00
|
|
|
BOutlineListView(BRect frame, const char* name,
|
|
|
|
list_view_type type = B_SINGLE_SELECTION_LIST,
|
2009-06-17 18:56:57 +04:00
|
|
|
uint32 resizeMode
|
|
|
|
= B_FOLLOW_LEFT | B_FOLLOW_TOP,
|
2006-02-11 18:23:23 +03:00
|
|
|
uint32 flags = B_WILL_DRAW | B_FRAME_EVENTS
|
|
|
|
| B_NAVIGABLE);
|
2009-06-17 18:56:57 +04:00
|
|
|
BOutlineListView(const char* name,
|
|
|
|
list_view_type type = B_SINGLE_SELECTION_LIST,
|
|
|
|
uint32 flags = B_WILL_DRAW | B_FRAME_EVENTS
|
|
|
|
| B_NAVIGABLE);
|
2006-02-11 18:23:23 +03:00
|
|
|
BOutlineListView(BMessage* archive);
|
2009-06-17 18:56:57 +04:00
|
|
|
virtual ~BOutlineListView();
|
|
|
|
|
|
|
|
static BArchivable* Instantiate(BMessage* archive);
|
|
|
|
virtual status_t Archive(BMessage* archive, bool deep = true) const;
|
|
|
|
|
|
|
|
virtual void MouseDown(BPoint where);
|
|
|
|
virtual void KeyDown(const char* bytes, int32 numBytes);
|
|
|
|
virtual void FrameMoved(BPoint newPosition);
|
|
|
|
virtual void FrameResized(float newWidth, float newHeight);
|
|
|
|
virtual void MouseUp(BPoint where);
|
|
|
|
|
|
|
|
virtual bool AddUnder(BListItem* item, BListItem* underItem);
|
|
|
|
|
|
|
|
virtual bool AddItem(BListItem* item);
|
|
|
|
virtual bool AddItem(BListItem* item, int32 fullListIndex);
|
|
|
|
virtual bool AddList(BList* newItems);
|
|
|
|
virtual bool AddList(BList* newItems, int32 fullListIndex);
|
|
|
|
|
|
|
|
virtual bool RemoveItem(BListItem* item);
|
|
|
|
virtual BListItem* RemoveItem(int32 fullListIndex);
|
|
|
|
virtual bool RemoveItems(int32 fullListIndex, int32 count);
|
|
|
|
|
|
|
|
BListItem* FullListItemAt(int32 fullListIndex) const;
|
|
|
|
int32 FullListIndexOf(BPoint point) const;
|
|
|
|
int32 FullListIndexOf(BListItem* item) const;
|
|
|
|
BListItem* FullListFirstItem() const;
|
|
|
|
BListItem* FullListLastItem() const;
|
|
|
|
bool FullListHasItem(BListItem* item) const;
|
|
|
|
int32 FullListCountItems() const;
|
|
|
|
int32 FullListCurrentSelection(int32 index = 0) const;
|
|
|
|
|
|
|
|
virtual void MakeEmpty();
|
|
|
|
bool FullListIsEmpty() const;
|
|
|
|
void FullListDoForEach(bool (*func)(BListItem* item));
|
|
|
|
void FullListDoForEach(
|
|
|
|
bool (*func)(BListItem* item, void*), void*);
|
|
|
|
|
|
|
|
BListItem* Superitem(const BListItem* item);
|
|
|
|
|
|
|
|
void Expand(BListItem* item);
|
|
|
|
void Collapse(BListItem* item);
|
|
|
|
|
|
|
|
bool IsExpanded(int32 fullListIndex);
|
|
|
|
|
|
|
|
virtual BHandler* ResolveSpecifier(BMessage* message, int32 index,
|
|
|
|
BMessage* specifier, int32 what,
|
|
|
|
const char* property);
|
|
|
|
virtual status_t GetSupportedSuites(BMessage* data);
|
|
|
|
virtual status_t Perform(perform_code d, void* arg);
|
|
|
|
|
|
|
|
virtual void ResizeToPreferred();
|
|
|
|
virtual void GetPreferredSize(float* _width, float* _height);
|
|
|
|
virtual void MakeFocus(bool focus = true);
|
|
|
|
virtual void AllAttached();
|
|
|
|
virtual void AllDetached();
|
|
|
|
virtual void DetachedFromWindow();
|
|
|
|
|
|
|
|
void FullListSortItems(int (*compareFunc)(
|
|
|
|
const BListItem* first,
|
|
|
|
const BListItem* second));
|
|
|
|
void SortItemsUnder(BListItem* underItem,
|
|
|
|
bool oneLevelOnly, int (*compareFunc)(
|
|
|
|
const BListItem* first,
|
|
|
|
const BListItem* second));
|
|
|
|
int32 CountItemsUnder(BListItem* under,
|
|
|
|
bool oneLevelOnly) const;
|
|
|
|
BListItem* EachItemUnder(BListItem* underItem,
|
|
|
|
bool oneLevelOnly, BListItem* (*eachFunc)(
|
|
|
|
BListItem* item, void* arg), void* arg);
|
|
|
|
BListItem* ItemUnderAt(BListItem* underItem, bool oneLevelOnly,
|
2002-10-23 17:54:44 +04:00
|
|
|
int32 index) const;
|
|
|
|
|
2009-06-17 18:56:57 +04:00
|
|
|
protected:
|
|
|
|
virtual bool DoMiscellaneous(MiscCode code, MiscData* data);
|
|
|
|
virtual void MessageReceived(BMessage* message);
|
|
|
|
|
|
|
|
private:
|
|
|
|
virtual void _ReservedOutlineListView1();
|
|
|
|
virtual void _ReservedOutlineListView2();
|
|
|
|
virtual void _ReservedOutlineListView3();
|
|
|
|
virtual void _ReservedOutlineListView4();
|
|
|
|
|
|
|
|
protected:
|
|
|
|
virtual void ExpandOrCollapse(BListItem* underItem, bool expand);
|
|
|
|
virtual BRect LatchRect(BRect itemRect, int32 level) const;
|
|
|
|
virtual void DrawLatch(BRect itemRect, int32 level,
|
|
|
|
bool collapsed, bool highlighted,
|
|
|
|
bool misTracked);
|
|
|
|
virtual void DrawItem(BListItem* item, BRect itemRect,
|
|
|
|
bool complete = false);
|
|
|
|
|
|
|
|
private:
|
|
|
|
int32 _FullListIndex(int32 index) const;
|
|
|
|
|
|
|
|
void _PopulateTree(BList* tree, BList& target,
|
|
|
|
int32& firstIndex, bool onlyVisible);
|
|
|
|
void _SortTree(BList* tree, bool oneLevelOnly,
|
|
|
|
int (*compareFunc)(const BListItem* a,
|
|
|
|
const BListItem* b));
|
|
|
|
void _DestructTree(BList* tree);
|
|
|
|
BList* _BuildTree(BListItem* underItem, int32& index);
|
2006-02-11 18:23:23 +03:00
|
|
|
|
2009-06-17 18:56:57 +04:00
|
|
|
void _CullInvisibleItems(BList &list);
|
|
|
|
bool _SwapItems(int32 first, int32 second);
|
|
|
|
BListItem* _RemoveItem(BListItem* item, int32 fullListIndex);
|
2006-02-11 18:23:23 +03:00
|
|
|
|
2009-06-17 18:56:57 +04:00
|
|
|
BListItem* _SuperitemForIndex(int32 fullListIndex, int32 level,
|
* AddItem() versions did not work correctly at all: maximum insertion index
was limited by the visible list count, it did not care if the insertion
failed, it didn't maintain the BListItem::fHasSubitems field, neither
fVisible, and it didn't invalidate the latch of the parent, if needed.
* The "add item at end" also did not care if the item should be added to the
visible list, too, it always did.
* AddUnder() would have crashed with a NULL superitem.
* _RemoveItem() now updates the fHasSubitems field as well.
* _SuperitemForIndex() can now return the index of the superitem as well.
* SortItemsUnder() did not check if the "underItem" if the items should be
added to the visible list or not, it also just did.
* SortItemsUnder() now invalidates the part of the visible list that may
have been changed.
* This fixed bug #662, and possibly #663, too (at least I could never
reproduce it).
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@17812 a95241bf-73f2-0310-859d-f6bbb57e9c96
2006-06-13 14:11:11 +04:00
|
|
|
int32* _superIndex = NULL);
|
2009-06-17 18:56:57 +04:00
|
|
|
int32 _FindPreviousVisibleIndex(int32 fullListIndex);
|
2006-02-11 18:23:23 +03:00
|
|
|
|
2009-06-17 18:56:57 +04:00
|
|
|
private:
|
|
|
|
BList fFullList;
|
|
|
|
uint32 _reserved[2];
|
2002-10-23 17:54:44 +04:00
|
|
|
};
|
|
|
|
|
2006-02-11 18:23:23 +03:00
|
|
|
#endif // _OUTLINE_LIST_VIEW_H
|