Keeping the indentation level with Drag '& Drop

I can suggest an extension to the Drag and Drop of your TreeView control. The standard drag and drop as in your control will add the drag branch as a child of the drop item. Quite often during drag and drop operations parent items should stay parent items, child items should stay child items, grandchildren should stay grandchildren, etc, etc.

The following allows just that - with a few logical rules of course:

  1. Dragging an item onto another item on the same indentation level (no matter in which branch), will add the dragitem as a sibling of the dropitem, directly following the dropitem.
  2. Dragging an item onto an item of the next higher (parent-level) indentation, will add the dragitem as the last child of the dropitem.

Therefore the indentation level of the dragitem will stay the same after dropping it. Dragging onto lower (child-level) indentation level, and dragging onto more than 1 higher (parent) indentations are not allowed.

Add a member variable:
   BOOL m_bKeepIndentLevel;

In the constructor, initialize this variable:

m_bKeepIndentLevel = FALSE;

When this member is FALSE, the drag and drop operation will work as it currently is. To keep the indentation level, you can change this value to TRUE inside your program, either by directly accessing the variable, or by Get/Set functions.

In the OnLButtonUp() function, add/modify the lines indicated by '->' :


void CTreeCtrlX::OnLButtonUp(UINT nFlags, CPoint point) 
{
      .
      .
      .

      while ((htiParent = GetParentItem(htiParent)) != NULL)
      {
         if (htiParent == m_hDragItem) return;
      }

->    // check for same indentation level

->    HTREEITEM htiPosition = TVI_LAST;

->    if (m_bKeepIndentLevel)
->    {
->       int nDragIndent = GetIndentLevel(m_hDragItem);
->       int nDropIndent = GetIndentLevel(m_hDropItem);
->
->       if (nDragIndent == nDropIndent)
->       {
->          // add after the drop item, as child of drop item's parent
->          htiPosition = m_hDropItem;
->          m_hDropItem = GetParentItem(m_hDropItem);
->       }
->       else if (nDragIndent == (nDropIndent + 1))
->       {
->          // if dropped on 'upper' indentation, add as last child of drop item
->          htiPosition = TVI_LAST;
->       }
->       else
->       {
->          // invalid drop target
->          return;
->       }
->    }

      Expand (m_hDropItem,TVE_EXPAND);

->    HTREEITEM htiNew = CopyBranch(m_hDragItem,m_hDropItem,htiPosition);
      DeleteItem(m_hDragItem);
      .
      .
      .
}

The implementation of GetIndentLevel() is as follows:


int CRTreeCtrl::GetIndentLevel(HTREEITEM hItem)
{
   int iIndent = 0;
   while ((hItem = GetParentItem(hItem)) != NULL)
   {
      iIndent++;
   }
   return iIndent;
}



Comments

  • There are no comments yet. Be the first to comment!

Leave a Comment
  • Your email address will not be published. All fields are required.

Top White Papers and Webcasts

  • Intelligent N+X Redundancy, Placement Affinities, & Future Proofing in the Virtualized Data Center Virtualization brought about the ability to simplify business continuity management in IT. Workload portability and data replication capabilities mean that physical infrastructure failures no longer need impact application services, and they can rapidly be recovered even in the event of complete site failure. However, Enterprises and Service Providers face new challenges ensuring they have enough compute …

  • As virtualization becomes the norm throughout organizations of nearly all sizes, and as more organizations look to private cloud solutions, IT decision makers are increasingly in need of ways to keep storage costs and complexity under control in the face of often-runaway virtual machine (VM) sprawl. Application-aware storage is designed to help achieve these important goals. Read this white paper to learn how application-aware storage allows you to gain VM-level visibility into application performance and …

Most Popular Programming Stories

More for Developers

RSS Feeds

Thanks for your registration, follow us on our social networks to keep up-to-date