jens-maus/yam

/***************************************************************************

 YAM - Yet Another Mailer
 Copyright (C) 1995-2000 Marcel Beck
 Copyright (C) 2000-2022 YAM Open Source Team

 This program 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; either version 2 of the License, or
 (at your option) any later version.

 This program 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, write to the Free Software
 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

 YAM Official Support Site :  http://www.yam.ch
 YAM OpenSource project    :  http://sourceforge.net/projects/yamos/

 $Id$

 Superclass:  MUIC_NList
 Description: NList class of an addressbook entry

***************************************************************************/

#include "AddressBookEntryList_cl.h"

#include <mui/NListtree_mcc.h>

#include "YAM.h"

#include "mui/AddressBookWindow.h"

#include "MUIObjects.h"

#include "Debug.h"


/* Private Functions */
/// AddSingleMember
//  Adds a single entry to the member list by Drag&Drop
static void AddSingleMember(Object *obj, struct MUI_NListtree_TreeNode *tn)
{
  struct ABookNode *abn = (struct ABookNode *)tn->tn_User;

  ENTER();

  DoMethod(obj, MUIM_List_InsertSingle, abn->Alias, xget(obj, MUIA_List_DropMark));

  LEAVE();
}

///
/// AddMembers (rec)
//  Adds an entire group to the member list by Drag&Drop
static void AddMembers(Object *obj, Object *tree, struct MUI_NListtree_TreeNode *list)
{
  struct MUI_NListtree_TreeNode *tn;
  int i;

  ENTER();

  for(i=0; ; i++)
  {
    if((tn = (struct MUI_NListtree_TreeNode *)DoMethod(tree, MUIM_NListtree_GetEntry, list, i, MUIV_NListtree_GetEntry_Flag_SameLevel)) != NULL)
    {
      if(isFlagSet(tn->tn_Flags, TNF_LIST))
        AddMembers(obj, tree, tn);
      else
        AddSingleMember(obj, tn);
    }
    else
      break;
  }

  LEAVE();
}

///

/* Overloaded Methods */
/// OVERLOAD(MUIM_DragQuery)
OVERLOAD(MUIM_DragQuery)
{
  struct MUIP_DragQuery *d = (struct MUIP_DragQuery *)msg;

  if(d->obj != obj)
  {
    if(d->obj == (Object *)xget(G->ABookWinObject, MUIA_AddressBookWindow_Listtree))
    {
      struct MUI_NListtree_TreeNode *active;

      if((active = (struct MUI_NListtree_TreeNode *)xget(d->obj, MUIA_NListtree_Active)))
      {
        if(((struct ABookNode *)(active->tn_User))->ListMembers == NULL)
          return MUIV_DragQuery_Accept;
      }
    }

    return MUIV_DragQuery_Refuse;
  }

  return DoSuperMethodA(cl,obj,msg);
}

///
/// OVERLOAD(MUIM_DragDrop)
OVERLOAD(MUIM_DragDrop)
{
  struct MUIP_DragQuery *d = (struct MUIP_DragQuery *)msg;

  if(d->obj != obj)
  {
    if(d->obj == (Object *)xget(G->ABookWinObject, MUIA_AddressBookWindow_Listtree))
    {
      struct MUI_NListtree_TreeNode *active;

      if((active = (struct MUI_NListtree_TreeNode *)xget(d->obj, MUIA_NListtree_Active)) != NULL)
      {
        if(isFlagSet(active->tn_Flags, TNF_LIST))
          AddMembers(obj, d->obj, active);
        else
          AddSingleMember(obj, active);
      }
    }

    return 0;
  }

  return DoSuperMethodA(cl,obj,msg);
}

///

/* Public Methods */