mirror of
https://github.com/netsurf-browser/netsurf
synced 2024-11-25 07:49:38 +03:00
3918a7eaaf
svn path=/trunk/netsurf/; revision=7685
736 lines
19 KiB
C
Executable File
736 lines
19 KiB
C
Executable File
/*
|
|
* Copyright 2008,2009 Chris Young <chris@unsatisfactorysoftware.co.uk>
|
|
*
|
|
* This file is part of NetSurf, http://www.netsurf-browser.org/
|
|
*
|
|
* NetSurf is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; version 2 of the License.
|
|
*
|
|
* NetSurf is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "desktop/tree.h"
|
|
#include <proto/listbrowser.h>
|
|
#include <proto/window.h>
|
|
#include <proto/layout.h>
|
|
#include <classes/window.h>
|
|
#include <gadgets/listbrowser.h>
|
|
#include <gadgets/layout.h>
|
|
#include <reaction/reaction_macros.h>
|
|
#include "amiga/gui.h"
|
|
#include "content/urldb.h"
|
|
#include <proto/exec.h>
|
|
#include <assert.h>
|
|
#include <proto/intuition.h>
|
|
#include "amiga/tree.h"
|
|
#include <proto/button.h>
|
|
#include <gadgets/button.h>
|
|
#include <string.h>
|
|
#include "utils/messages.h"
|
|
#include <proto/bitmap.h>
|
|
#include <images/bitmap.h>
|
|
|
|
struct Node *selectednode;
|
|
struct node *selectednode2;
|
|
|
|
void ami_add_elements(struct treeview_window *twin,struct node *root,WORD *gen);
|
|
bool ami_tree_launch_node(struct tree *tree, struct node *node);
|
|
void free_browserlist(struct List *list);
|
|
void ami_move_node(struct treeview_window *twin,int move);
|
|
void ami_new_bookmark(struct treeview_window *twin);
|
|
void ami_recreate_listbrowser(struct treeview_window *twin);
|
|
|
|
void tree_initialise_redraw(struct tree *tree)
|
|
{
|
|
}
|
|
|
|
void tree_redraw_area(struct tree *tree, int x, int y, int width, int height)
|
|
{
|
|
}
|
|
|
|
void tree_draw_line(int x, int y, int width, int height)
|
|
{
|
|
}
|
|
|
|
void tree_draw_node_element(struct tree *tree, struct node_element *element)
|
|
{
|
|
return;
|
|
#if 0
|
|
/* add element to listbrowser list */
|
|
|
|
struct Node *lbnode;
|
|
struct treeview_window *twin = tree->handle;
|
|
struct node *tempnode;
|
|
int generation=1;
|
|
BOOL edit = FALSE;
|
|
|
|
tempnode = element->parent;
|
|
edit = tempnode->editable;
|
|
|
|
while(tempnode)
|
|
{
|
|
tempnode = tempnode->parent;
|
|
generation++;
|
|
}
|
|
|
|
switch (element->type) {
|
|
case NODE_ELEMENT_TEXT_PLUS_SPRITE:
|
|
case NODE_ELEMENT_TEXT:
|
|
if (lbnode = AllocListBrowserNode(3,
|
|
// LBNA_UserData,nodetime,
|
|
LBNA_Generation,1,
|
|
LBNA_Column, 0,
|
|
LBNCA_CopyText,TRUE,
|
|
LBNCA_Text, element->text,
|
|
LBNCA_Editable,edit,
|
|
LBNA_Column, 1,
|
|
LBNCA_CopyText,TRUE,
|
|
LBNCA_Text, "",
|
|
LBNA_Column, 2,
|
|
LBNCA_CopyText,TRUE,
|
|
LBNCA_Text, "",
|
|
TAG_DONE))
|
|
{
|
|
AddTail(twin->listbrowser_list, lbnode);
|
|
}
|
|
break;
|
|
}
|
|
#endif
|
|
}
|
|
|
|
void tree_draw_node_expansion(struct tree *tree, struct node *node)
|
|
{
|
|
DebugPrintF("tree_draw_node_expansion\n");
|
|
}
|
|
|
|
void tree_recalculate_node_element(struct node_element *element)
|
|
{
|
|
}
|
|
|
|
void tree_update_URL_node(struct node *node, const char *url,
|
|
const struct url_data *data)
|
|
{
|
|
struct node_element *element;
|
|
char buffer[256];
|
|
|
|
assert(node);
|
|
|
|
element = tree_find_element(node, TREE_ELEMENT_URL);
|
|
|
|
if (!element)
|
|
return;
|
|
if (data) {
|
|
/* node is linked, update */
|
|
assert(!node->editable);
|
|
if (!data->title)
|
|
urldb_set_url_title(url, url);
|
|
|
|
if (!data->title)
|
|
return;
|
|
|
|
node->data.text = data->title;
|
|
} else {
|
|
/* node is not linked, find data */
|
|
assert(node->editable);
|
|
data = urldb_get_url_data(element->text);
|
|
if (!data)
|
|
return;
|
|
}
|
|
|
|
/* not implemented yet
|
|
if (element) {
|
|
sprintf(buffer, "small_%.3x", ro_content_filetype_from_type(data->type));
|
|
if (ro_gui_wimp_sprite_exists(buffer))
|
|
tree_set_node_sprite(node, buffer, buffer);
|
|
else
|
|
tree_set_node_sprite(node, "small_xxx", "small_xxx");
|
|
}
|
|
*/
|
|
|
|
element = tree_find_element(node, TREE_ELEMENT_LAST_VISIT);
|
|
if (element) {
|
|
snprintf(buffer, 256, (char *)messages_get("TreeLast"),
|
|
(data->last_visit > 0) ?
|
|
ctime((time_t *)&data->last_visit) :
|
|
(char *)messages_get("TreeUnknown"));
|
|
if (data->last_visit > 0)
|
|
buffer[strlen(buffer) - 1] = '\0';
|
|
free((void *)element->text);
|
|
element->text = (char *)strdup(buffer);
|
|
}
|
|
|
|
element = tree_find_element(node, TREE_ELEMENT_VISITS);
|
|
if (element) {
|
|
snprintf(buffer, 256, (char *)messages_get("TreeVisits"),
|
|
data->visits);
|
|
free((void *)element->text);
|
|
element->text = (char *)strdup(buffer);
|
|
}
|
|
}
|
|
|
|
void tree_resized(struct tree *tree)
|
|
{
|
|
}
|
|
|
|
void tree_set_node_sprite_folder(struct node *node)
|
|
{
|
|
}
|
|
|
|
void tree_set_node_sprite(struct node *node, const char *sprite,
|
|
const char *expanded)
|
|
{
|
|
}
|
|
|
|
void ami_open_tree(struct tree *tree,int type)
|
|
{
|
|
struct treeview_window *twin;
|
|
BOOL msel = TRUE,nothl = TRUE,launchdisable=FALSE;
|
|
static WORD gen=0;
|
|
char *wintitle;
|
|
char folderclosed[100],folderopen[100],item[100];
|
|
|
|
if(tree->handle)
|
|
{
|
|
twin = (struct treeview_window *)tree->handle;
|
|
WindowToFront(twin->win);
|
|
ActivateWindow(twin->win);
|
|
return;
|
|
}
|
|
|
|
twin = AllocVec(sizeof(struct treeview_window),MEMF_PRIVATE | MEMF_CLEAR);
|
|
twin->listbrowser_list = AllocVec(sizeof(struct List),MEMF_PRIVATE | MEMF_CLEAR);
|
|
|
|
static struct ColumnInfo columninfo[] =
|
|
{
|
|
{ 80,"Name", CIF_DRAGGABLE | CIF_SORTABLE},
|
|
{ 20,"URL", CIF_DRAGGABLE },
|
|
// { 5,"Visits", CIF_DRAGGABLE },
|
|
{ -1, (STRPTR)~0, -1 }
|
|
};
|
|
|
|
if(tree->single_selection) msel = FALSE;
|
|
|
|
ami_get_theme_filename(&folderclosed,"theme_list_folder_closed");
|
|
ami_get_theme_filename(&folderopen,"theme_list_folder_open");
|
|
|
|
switch(type)
|
|
{
|
|
case AMI_TREE_HOTLIST:
|
|
nothl = FALSE;
|
|
wintitle = (char *)messages_get("Hotlist");
|
|
ami_get_theme_filename(&item,"theme_list_bookmark");
|
|
break;
|
|
case AMI_TREE_COOKIES:
|
|
nothl = TRUE;
|
|
launchdisable=TRUE;
|
|
wintitle = (char *)messages_get("Cookies");
|
|
ami_get_theme_filename(&item,"theme_list_cookie");
|
|
break;
|
|
case AMI_TREE_HISTORY:
|
|
nothl = TRUE;
|
|
wintitle = (char *)messages_get("GlobalHistory");
|
|
ami_get_theme_filename(&item,"theme_list_history");
|
|
break;
|
|
case AMI_TREE_SSLCERT:
|
|
nothl = TRUE;
|
|
wintitle = (char *)messages_get("SSLCerts");
|
|
ami_get_theme_filename(&item,"theme_list_sslcert");
|
|
break;
|
|
}
|
|
|
|
NewList(twin->listbrowser_list);
|
|
|
|
tree->handle = (void *)twin;
|
|
twin->tree = tree;
|
|
ami_add_elements(twin,twin->tree->root,&gen);
|
|
|
|
twin->objects[OID_MAIN] = WindowObject,
|
|
WA_ScreenTitle,nsscreentitle,
|
|
WA_Title,wintitle,
|
|
WA_Activate, TRUE,
|
|
WA_DepthGadget, TRUE,
|
|
WA_DragBar, TRUE,
|
|
WA_CloseGadget, TRUE,
|
|
WA_SizeGadget, TRUE,
|
|
WA_CustomScreen,scrn,
|
|
WINDOW_SharedPort,sport,
|
|
WINDOW_UserData,twin,
|
|
WINDOW_IconifyGadget, TRUE,
|
|
WINDOW_Position, WPOS_CENTERSCREEN,
|
|
WINDOW_ParentGroup, twin->gadgets[GID_MAIN] = VGroupObject,
|
|
LAYOUT_AddChild, twin->gadgets[GID_TREEBROWSER] = ListBrowserObject,
|
|
GA_ID, GID_TREEBROWSER,
|
|
GA_RelVerify, TRUE,
|
|
GA_ReadOnly,FALSE,
|
|
LISTBROWSER_ColumnInfo, &columninfo,
|
|
// LISTBROWSER_ColumnTitles, TRUE,
|
|
LISTBROWSER_Hierarchical,TRUE,
|
|
LISTBROWSER_Editable,TRUE,
|
|
// LISTBROWSER_TitleClickable,TRUE,
|
|
LISTBROWSER_AutoFit, TRUE,
|
|
LISTBROWSER_HorizontalProp, TRUE,
|
|
LISTBROWSER_Labels, twin->listbrowser_list,
|
|
// LISTBROWSER_MultiSelect,msel,
|
|
LISTBROWSER_ShowSelected,TRUE,
|
|
LISTBROWSER_ShowImage,BitMapObject,
|
|
BITMAP_SourceFile,folderclosed,
|
|
BITMAP_Screen,scrn,
|
|
BITMAP_Masking,TRUE,
|
|
BitMapEnd,
|
|
LISTBROWSER_HideImage,BitMapObject,
|
|
BITMAP_SourceFile,folderopen,
|
|
BITMAP_Screen,scrn,
|
|
BITMAP_Masking,TRUE,
|
|
BitMapEnd,
|
|
LISTBROWSER_LeafImage,BitMapObject,
|
|
BITMAP_SourceFile,item,
|
|
BITMAP_Screen,scrn,
|
|
BITMAP_Masking,TRUE,
|
|
BitMapEnd,
|
|
ListBrowserEnd,
|
|
CHILD_NominalSize,TRUE,
|
|
LAYOUT_AddChild, HGroupObject,
|
|
LAYOUT_AddChild, twin->gadgets[GID_OPEN] = ButtonObject,
|
|
GA_ID,GID_OPEN,
|
|
GA_Text,messages_get("TreeLaunch"),
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,launchdisable,
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_NEWF] = ButtonObject,
|
|
GA_ID,GID_NEWF,
|
|
BUTTON_AutoButton,BAG_POPDRAWER,
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,nothl,
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_NEWB] = ButtonObject,
|
|
GA_ID,GID_NEWB,
|
|
BUTTON_AutoButton,BAG_POPFILE,
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,nothl,
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_LEFT] = ButtonObject,
|
|
GA_ID,GID_LEFT,
|
|
BUTTON_AutoButton,BAG_LFARROW,
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,nothl, //(!tree->movable),
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_UP] = ButtonObject,
|
|
GA_ID,GID_UP,
|
|
BUTTON_AutoButton,BAG_UPARROW,
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,nothl, //(!tree->movable),
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_DOWN] = ButtonObject,
|
|
GA_ID,GID_DOWN,
|
|
BUTTON_AutoButton,BAG_DNARROW,
|
|
GA_RelVerify,TRUE,
|
|
GA_Disabled,nothl, //(!tree->movable),
|
|
ButtonEnd,
|
|
LAYOUT_AddChild, twin->gadgets[GID_DEL] = ButtonObject,
|
|
GA_ID,GID_DEL,
|
|
GA_Text,messages_get("TreeDelete"),
|
|
GA_RelVerify,TRUE,
|
|
ButtonEnd,
|
|
EndGroup,
|
|
CHILD_WeightedHeight,0,
|
|
EndGroup,
|
|
EndWindow;
|
|
|
|
twin->win = (struct Window *)RA_OpenWindow(twin->objects[OID_MAIN]);
|
|
|
|
twin->node = AddObject(window_list,AMINS_TVWINDOW);
|
|
twin->node->objstruct = twin;
|
|
}
|
|
|
|
/**
|
|
* Launches a node using all known methods.
|
|
*
|
|
* \param node the node to launch
|
|
* \return whether the node could be launched
|
|
*/
|
|
bool ami_tree_launch_node(struct tree *tree, struct node *node)
|
|
{
|
|
struct node_element *element;
|
|
|
|
assert(node);
|
|
|
|
element = tree_find_element(node, TREE_ELEMENT_URL);
|
|
if (element) {
|
|
browser_window_create(element->text, NULL, 0, true, false);
|
|
return true;
|
|
}
|
|
|
|
/* not implemented yet
|
|
element = tree_find_element(node, TREE_ELEMENT_SSL);
|
|
if (element) {
|
|
ro_gui_cert_open(tree, node);
|
|
return true;
|
|
}
|
|
*/
|
|
|
|
return false;
|
|
}
|
|
|
|
void ami_tree_close(struct treeview_window *twin)
|
|
{
|
|
twin->tree->handle = 0;
|
|
DisposeObject(twin->objects[OID_MAIN]);
|
|
FreeListBrowserList(twin->listbrowser_list);
|
|
FreeVec(twin->listbrowser_list);
|
|
//free_browserlist(twin->listbrowser_list);
|
|
DelObject(twin->node);
|
|
}
|
|
|
|
void free_browserlist(struct List *list)
|
|
{
|
|
struct Node *node, *nextnode;
|
|
|
|
if(IsListEmpty(list)) return;
|
|
|
|
node = GetHead(list);
|
|
|
|
do
|
|
{
|
|
nextnode = GetSucc(node);
|
|
// FreeVec(node->ln_Name);
|
|
FreeListBrowserNode(node);
|
|
} while(node = nextnode);
|
|
}
|
|
|
|
void ami_add_elements(struct treeview_window *twin,struct node *root,WORD *gen)
|
|
{
|
|
struct Node *lbnode;
|
|
struct tree *tree = twin->tree;
|
|
struct node *tempnode;
|
|
int generation=1;
|
|
BOOL edit = FALSE;
|
|
struct node_element *element=NULL,*element2=NULL,*element3=NULL;
|
|
struct node *node;
|
|
ULONG flags = 0;
|
|
STRPTR text1 = "",text2 = "",text3 = "";
|
|
|
|
*gen = *gen + 1;
|
|
for (node = root; node; node = node->next)
|
|
{
|
|
element = tree_find_element(node, TREE_ELEMENT_NAME);
|
|
if(!element) element = tree_find_element(node, TREE_ELEMENT_TITLE);
|
|
if(!element) element = tree_find_element(node, TREE_ELEMENT_SSL);
|
|
if(element && element->text)
|
|
{
|
|
text1 = (char *)element->text;
|
|
}
|
|
|
|
/* Really, the second column needs axing - relevant data should appear in an
|
|
area below the listview when items are selected */
|
|
|
|
element2 = tree_find_element(node, TREE_ELEMENT_URL);
|
|
if(!element2) element2 = tree_find_element(node, TREE_ELEMENT_VALUE);
|
|
if(!element2) element2 = tree_find_element(node, TREE_ELEMENT_COMMENT);
|
|
|
|
if(element2 && element2->text)
|
|
{
|
|
text2 = (char *)element2->text;
|
|
}
|
|
else
|
|
{
|
|
text2 = "";
|
|
}
|
|
|
|
// element = tree_find_element(node, TREE_ELEMENT_VISITS);
|
|
|
|
flags = 0;
|
|
/*if(node->expanded) */ flags = LBFLG_SHOWCHILDREN;
|
|
if(node->folder) flags |= LBFLG_HASCHILDREN;
|
|
if(!node->parent) flags |= LBFLG_HIDDEN;
|
|
|
|
switch (element->type) {
|
|
case NODE_ELEMENT_TEXT_PLUS_SPRITE:
|
|
case NODE_ELEMENT_TEXT:
|
|
if (lbnode = AllocListBrowserNode(3,
|
|
LBNA_UserData,node,
|
|
LBNA_Generation,*gen - 1,
|
|
LBNA_Selected,node->selected,
|
|
LBNA_Flags,flags,
|
|
LBNA_Column, 0,
|
|
LBNCA_CopyText,TRUE,
|
|
LBNCA_MaxChars,256,
|
|
LBNCA_Text, text1,
|
|
LBNCA_Editable,node->editable,
|
|
LBNA_Column, 1,
|
|
LBNCA_CopyText,TRUE,
|
|
LBNCA_MaxChars,256,
|
|
LBNCA_Text, text2,
|
|
LBNCA_Editable,FALSE,
|
|
TAG_DONE))
|
|
{
|
|
AddTail(twin->listbrowser_list, lbnode);
|
|
if(node == selectednode2) selectednode = lbnode;
|
|
}
|
|
break;
|
|
}
|
|
|
|
if (node->child)
|
|
{
|
|
ami_add_elements(twin,node->child,gen);
|
|
}
|
|
}
|
|
*gen = *gen - 1;
|
|
}
|
|
|
|
BOOL ami_tree_event(struct treeview_window *twin)
|
|
{
|
|
/* return TRUE if window destroyed */
|
|
ULONG class,result,relevent = 0;
|
|
ULONG column;
|
|
uint16 code;
|
|
struct MenuItem *item;
|
|
struct node *treenode;
|
|
struct Node *lbnode;
|
|
struct node_element *element;
|
|
char *text;
|
|
// ULONG editcols[] = {TREE_ELEMENT_TITLE,TREE_ELEMENT_URL};
|
|
static WORD gen=0;
|
|
|
|
while((result = RA_HandleInput(twin->objects[OID_MAIN],&code)) != WMHI_LASTMSG)
|
|
{
|
|
switch(result & WMHI_CLASSMASK) // class
|
|
{
|
|
case WMHI_GADGETUP:
|
|
switch(result & WMHI_GADGETMASK)
|
|
{
|
|
case GID_TREEBROWSER:
|
|
GetAttrs(twin->gadgets[GID_TREEBROWSER],
|
|
LISTBROWSER_RelEvent,&relevent,
|
|
TAG_DONE);
|
|
|
|
switch(relevent)
|
|
{
|
|
case LBRE_DOUBLECLICK:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
ami_tree_launch_node(twin->tree,treenode);
|
|
break;
|
|
|
|
case LBRE_EDIT:
|
|
GetAttrs(twin->gadgets[GID_TREEBROWSER],
|
|
LISTBROWSER_SelectedNode,(ULONG *)&lbnode,
|
|
// LISTBROWSER_RelColumn,(ULONG *)&column,
|
|
TAG_DONE);
|
|
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
|
|
element = tree_find_element(treenode,TREE_ELEMENT_TITLE);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_Column,column,
|
|
LBNCA_Text,(ULONG *)&text,
|
|
TAG_DONE);
|
|
element->text = (char *)strdup(text);
|
|
tree_handle_node_element_changed(twin->tree, element);
|
|
break;
|
|
|
|
case LBRE_HIDECHILDREN:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
tree_set_node_expanded(twin->tree, treenode, false);
|
|
break;
|
|
|
|
case LBRE_SHOWCHILDREN:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
tree_set_node_expanded(twin->tree, treenode, true);
|
|
break;
|
|
}
|
|
break;
|
|
|
|
case GID_OPEN:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
ami_tree_launch_node(twin->tree,treenode);
|
|
break;
|
|
|
|
case GID_NEWF:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
if(lbnode)
|
|
{
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
}
|
|
else
|
|
{
|
|
treenode = twin->tree->root;
|
|
}
|
|
|
|
tree_create_folder_node(treenode,(char *)messages_get("TreeNewFolder"));
|
|
|
|
ami_recreate_listbrowser(twin);
|
|
break;
|
|
|
|
case GID_NEWB:
|
|
ami_new_bookmark(twin);
|
|
break;
|
|
|
|
case GID_UP:
|
|
ami_move_node(twin,AMI_MOVE_UP);
|
|
break;
|
|
|
|
case GID_DOWN:
|
|
ami_move_node(twin,AMI_MOVE_DOWN);
|
|
break;
|
|
|
|
case GID_LEFT:
|
|
ami_move_node(twin,AMI_MOVE_OUT);
|
|
break;
|
|
|
|
case GID_DEL:
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
tree_delete_node(twin->tree, treenode, false);
|
|
/* We are recreating the list from scratch as there is no obvious easy way
|
|
to delete children from a listbrowser list */
|
|
ami_recreate_listbrowser(twin);
|
|
break;
|
|
}
|
|
break;
|
|
|
|
/* no menus yet, copied in as will probably need it later
|
|
case WMHI_MENUPICK:
|
|
item = ItemAddress(gwin->win->MenuStrip,code);
|
|
while (code != MENUNULL)
|
|
{
|
|
ami_menupick(code,gwin);
|
|
if(win_destroyed) break;
|
|
code = item->NextSelect;
|
|
}
|
|
break;
|
|
*/
|
|
|
|
case WMHI_CLOSEWINDOW:
|
|
ami_tree_close(twin);
|
|
return TRUE;
|
|
break;
|
|
}
|
|
}
|
|
return FALSE;
|
|
}
|
|
|
|
void ami_move_node(struct treeview_window *twin,int move)
|
|
{
|
|
struct Node *lbnode = NULL;
|
|
struct node *treenode,*moveto;
|
|
bool before;
|
|
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
|
|
if(!lbnode) return;
|
|
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
// for multiselects? LBNA_Selected,(BOOL *)&sel,
|
|
TAG_DONE);
|
|
|
|
selectednode2 = treenode;
|
|
|
|
tree_set_node_selected(twin->tree,twin->tree->root,false);
|
|
tree_set_node_selected(twin->tree,treenode,true);
|
|
|
|
switch(move)
|
|
{
|
|
case AMI_MOVE_UP:
|
|
moveto = treenode->previous;
|
|
before = true;
|
|
break;
|
|
|
|
case AMI_MOVE_DOWN:
|
|
moveto = treenode->next;
|
|
before = false;
|
|
break;
|
|
|
|
case AMI_MOVE_OUT:
|
|
moveto = treenode->parent->previous;
|
|
before = false;
|
|
break;
|
|
}
|
|
|
|
if(!moveto) return;
|
|
|
|
tree_delink_node(treenode);
|
|
//tree_move_selected_nodes(twin->tree,moveto,before);
|
|
tree_link_node(moveto,treenode,before);
|
|
ami_recreate_listbrowser(twin);
|
|
selectednode2 = NULL;
|
|
}
|
|
|
|
void ami_new_bookmark(struct treeview_window *twin)
|
|
{
|
|
const struct url_data *data;
|
|
struct Node *lbnode;
|
|
struct node *treenode;
|
|
char *url,*title;
|
|
|
|
GetAttr(LISTBROWSER_SelectedNode,twin->gadgets[GID_TREEBROWSER],(ULONG *)&lbnode);
|
|
if(lbnode)
|
|
{
|
|
GetListBrowserNodeAttrs(lbnode,
|
|
LBNA_UserData,(ULONG *)&treenode,
|
|
TAG_DONE);
|
|
}
|
|
else
|
|
{
|
|
treenode = twin->tree->root;
|
|
}
|
|
|
|
url = (char *)strdup("http://www.netsurf-browser.org");
|
|
|
|
data = urldb_get_url_data(url);
|
|
if (!data)
|
|
{
|
|
urldb_add_url(url);
|
|
urldb_set_url_persistence(url,true);
|
|
data = urldb_get_url_data(url);
|
|
}
|
|
|
|
if (data)
|
|
{
|
|
title = data->title;
|
|
tree_create_URL_node(treenode,url,data,title);
|
|
ami_recreate_listbrowser(twin);
|
|
}
|
|
}
|
|
|
|
void ami_recreate_listbrowser(struct treeview_window *twin)
|
|
{
|
|
static WORD gen=0;
|
|
|
|
SetGadgetAttrs(twin->gadgets[GID_TREEBROWSER],twin->win,NULL,
|
|
LISTBROWSER_Labels,~0,
|
|
TAG_DONE);
|
|
|
|
FreeListBrowserList(twin->listbrowser_list);
|
|
ami_add_elements(twin,twin->tree->root,&gen);
|
|
|
|
RefreshSetGadgetAttrs(twin->gadgets[GID_TREEBROWSER],twin->win,NULL,
|
|
LISTBROWSER_Labels,twin->listbrowser_list,
|
|
LISTBROWSER_SelectedNode,selectednode,
|
|
TAG_DONE);
|
|
}
|