zoukankan      html  css  js  c++  java
  • DataGrid 如何得到DataGridRow 和DataGridCell 对象

    第一行为不可编辑
     DataGridRow row = (DataGridRow)dataGrid1.ItemContainerGenerator.ContainerFromIndex(0);
                if (row == null)
                {
                    dataGrid1.UpdateLayout();
                    row = (DataGridRow)dataGrid1.ItemContainerGenerator.ContainerFromIndex(0);
                     
             }
             row.IsEnabled = false;
            public static T GetVisualChild<T>(Visual parent) where T : Visual
            {
                T childContent = default(T);
                int numVisuals = VisualTreeHelper.GetChildrenCount(parent);
                for (int i = 0; i < numVisuals; i++)
                {
                    Visual v = (Visual)VisualTreeHelper.GetChild(parent, i);
                    childContent = v as T;
                    if (childContent == null)
                    {
                        childContent = GetVisualChild<T>(v);
                    }
                    if (childContent != null)
                    {
                        break;
                    }
                }
                return childContent;
            }
      
      
    //第二行第一列不可编辑
                     DataGridRow rowContainer = GetDataGridRow(dataGrid1, 1);
      
                    if (rowContainer != null)
                    {
                        DataGridCellsPresenter presenter = GetVisualChild<DataGridCellsPresenter>(rowContainer);
                        DataGridCell cell = (DataGridCell)presenter.ItemContainerGenerator.ContainerFromIndex(1);
                        if (cell == null)
                        {
                            dataGrid1.ScrollIntoView(rowContainer, dataGrid1.Columns[0]);
                            cell = (DataGridCell)presenter.ItemContainerGenerator.ContainerFromIndex(0);
                            
                        }
      
                        cell.IsEnabled = false;
                    }
  • 相关阅读:
    POJ 3660 Cow Contest (floyd求联通关系)
    POJ 3660 Cow Contest (最短路dijkstra)
    POJ 1860 Currency Exchange (bellman-ford判负环)
    POJ 3268 Silver Cow Party (最短路dijkstra)
    POJ 1679 The Unique MST (最小生成树)
    POJ 3026 Borg Maze (最小生成树)
    HDU 4891 The Great Pan (模拟)
    HDU 4950 Monster (水题)
    URAL 2040 Palindromes and Super Abilities 2 (回文自动机)
    URAL 2037 Richness of binary words (回文子串,找规律)
  • 原文地址:https://www.cnblogs.com/qq247039968/p/4567266.html
Copyright © 2011-2022 走看看