public void Refresh(List <WaitDeadLock> deadlocks)
        {
            TreeNodeCollection deadLockNodes = r_deadlocksNode.Nodes;
            int countNew = deadlocks.Count;
            int countOld = r_deadLockNodes.Count;

            if (countNew < countOld)
            {
                for (int i = countNew; i < countOld; ++i)
                {
                    r_deadLockNodes[countNew].Remove();
                    r_deadLockNodes.RemoveAt(countNew);
                }
            }
            else if (countOld < countNew)
            {
                for (int i = 0; i < (countNew - countOld); ++i)
                {
                    DeadLockNode deadLockNode = new DeadLockNode(r_manager, r_deadlocksNode, (countOld + i));
                    r_deadLockNodes.Add(deadLockNode);
                }
            }

            for (int i = 0; i < deadlocks.Count; ++i)
            {
                DeadLockNode deadlockNode = r_deadLockNodes[i];
                deadlockNode.Refresh(deadlocks[i]);
            }
        }
        public void Refresh(List<WaitDeadLock> deadlocks)
        {
            TreeNodeCollection deadLockNodes = r_deadlocksNode.Nodes;
            int countNew = deadlocks.Count;
            int countOld = r_deadLockNodes.Count;

            if (countNew < countOld)
            {
                for (int i = countNew; i < countOld; ++i)
                {
                    r_deadLockNodes[countNew].Remove();
                    r_deadLockNodes.RemoveAt(countNew);
                }
            }
            else if (countOld < countNew)
            {
                for (int i = 0; i < (countNew - countOld); ++i)
                {
                    DeadLockNode deadLockNode = new DeadLockNode(r_manager, r_deadlocksNode, (countOld + i));
                    r_deadLockNodes.Add(deadLockNode);
                }
            }

            for (int i = 0; i < deadlocks.Count; ++i)
            {
                DeadLockNode deadlockNode = r_deadLockNodes[i];
                deadlockNode.Refresh(deadlocks[i]);
            }
        }