Implemented interface member:
property
Count
System.Collections.ICollection.Count
42 references to Count
System.Web (42)
UI\WebControls\TreeNode.cs (13)
258
else if ((value == false) && (oldValue == true) && (ChildNodes.
Count
> 0)) {
813
Debug.Assert(ChildNodes.
Count
> 0, "No nodes for expansion, why are we rendering an expander?");
838
if ((Depth == 0) && (ChildNodes.
Count
> 0)) {
841
else if ((ChildNodes.
Count
> 0) || PopulateOnDemand) {
870
if (!Populated && (ChildNodes.
Count
== 0)) {
960
bool canExpand = (PopulateOnDemand || (ChildNodes.
Count
> 0)) && _owner.ShowExpandCollapse;
1178
if (ChildNodes.
Count
!= 0) {
1507
if (ChildNodes.
Count
> 0) {
1553
for (int i = 0; i < ChildNodes.
Count
; i++) {
1555
isLast[depth + 1] = (i == ChildNodes.
Count
- 1);
1608
if (ChildNodes.
Count
> 0) {
1609
for (int i = 0; i < ChildNodes.
Count
; i++) {
1633
if (ChildNodes.
Count
> 0) {
UI\WebControls\TreeNodeCollection.cs (13)
73
AddAt(
Count
, child);
107
if (this.
Count
== 0) return;
112
if (owner.CheckedNodes.
Count
!= 0) {
155
for (int i = 0; i <
Count
; i++) {
193
if (owner.CheckedNodes.
Count
!= 0) {
226
for (int i = 0; i <
Count
; i++) {
242
if (selectedNode != null || checkedNodes.
Count
!= 0) {
310
object[] nodes = new object[
Count
+ 1];
339
for (int i = 0; i <
Count
; i++) {
353
for (int i = 0; i <
Count
; i++) {
422
if (index < (list.
Count
- 1)) {
428
index = list.
Count
;
442
if (index >= list.
Count
)
UI\WebControls\TreeView.cs (16)
1841
bool parent = node.ChildNodes.
Count
!= 0 || node.PopulateOnDemand;
2270
bool parent = node.ChildNodes.
Count
!= 0 || node.PopulateOnDemand;
2492
if (nodes.
Count
> 0) {
2493
for (int i = 0; i < nodes.
Count
; i++) {
2580
for (int i = 0; i < Nodes.
Count
; i++) {
2852
for (int i = 0; i < Nodes.
Count
; i++) {
2855
isLast[0] = (i == (Nodes.
Count
- 1));
2937
if ((node.ChildNodes.
Count
== 0) || (node.Expanded != true)) {
2947
else if (node.ChildNodes.
Count
== 0) {
2966
if (node.ChildNodes.
Count
> 0) {
2968
for (int i = 0; i < nodes.
Count
; i++) {
3293
if (node.ChildNodes.
Count
> 0) {
3296
for (int i = 0; i < node.ChildNodes.
Count
; i++) {
3392
for (int i = 0; i < Nodes.
Count
; i++) {
3411
if ((node.ChildNodes.
Count
> 0) && (lastIndex != -1)) {
3413
for (int j = 0; j < nodes.
Count
; j++) {