Csharp/C Sharp/LINQ/Group — различия между версиями
Admin (обсуждение | вклад) м (1 версия) |
Admin (обсуждение | вклад) м (1 версия) |
(нет различий)
|
Текущая версия на 11:38, 26 мая 2010
Group words by length
using System;
using System.Linq;
class HelloWorld {
static void Main() {
string[] words = { "A", "ss", "w", "ccc", "a" };
var groups =
from word in words
orderby word ascending
group word by word.Length into lengthGroups
orderby lengthGroups.Key descending
select new { Length = lengthGroups.Key, Words = lengthGroups };
foreach (var group in groups) {
Console.WriteLine("Words of length " + group.Length);
foreach (string word in group.Words)
Console.WriteLine(" " + word);
}
}
}
Select from a Group
using System;
using System.Collections;
using System.Collections.Generic;
using System.Text;
using System.Linq;
using System.Reflection;
public class MainClass {
public static void Main() {
var query = from m in typeof(int).GetMethods() select m.Name;
var q = from m in typeof(int).GetMethods()
group m by m.Name into gb
select new { Name = gb.Key };
}
}
Use group to group all employees by department
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
public class Tree<TreeNode> : IEnumerable<TreeNode> where TreeNode : IComparable<TreeNode> {
public Tree(TreeNode nodeValue) {
this.NodeData = nodeValue;
this.LeftTree = null;
this.RightTree = null;
}
public void Insert(TreeNode newItem) {
TreeNode currentNodeValue = this.NodeData;
if (currentNodeValue.rupareTo(newItem) > 0) {
if (this.LeftTree == null) {
this.LeftTree = new Tree<TreeNode>(newItem);
} else {
this.LeftTree.Insert(newItem);
}
} else {
if (this.RightTree == null) {
this.RightTree = new Tree<TreeNode>(newItem);
} else {
this.RightTree.Insert(newItem);
}
}
}
public void WalkTree() {
if (this.LeftTree != null) {
this.LeftTree.WalkTree();
}
Console.WriteLine(this.NodeData.ToString());
if (this.RightTree != null) {
this.RightTree.WalkTree();
}
}
public TreeNode NodeData { get; set; }
public Tree<TreeNode> LeftTree { get; set; }
public Tree<TreeNode> RightTree { get; set; }
IEnumerator<TreeNode> IEnumerable<TreeNode>.GetEnumerator() {
if (this.LeftTree != null) {
foreach (TreeNode item in this.LeftTree) {
yield return item;
}
}
yield return this.NodeData;
if (this.RightTree != null) {
foreach (TreeNode item in this.RightTree) {
yield return item;
}
}
}
System.Collections.IEnumerator System.Collections.IEnumerable.GetEnumerator() {
throw new NotImplementedException();
}
}
class Employee : IComparable<Employee> {
public string FirstName { get; set; }
public string LastName { get; set; }
public string Department { get; set; }
public int Id { get; set; }
public override string ToString() {
return String.Format("Id: {0}, Name: {1} {2}, Dept: {3}", this.Id, this.FirstName, this.LastName, this.Department);
}
int IComparable<Employee>.rupareTo(Employee other) {
if (other == null)
return 1;
if (this.Id > other.Id)
return 1;
if (this.Id < other.Id)
return -1;
return 0;
}
}
class Program {
static void Main() {
Tree<Employee> empTree = new Tree<Employee>(new Employee { Id = 1, FirstName = "Janet", LastName = "Gates", Department = "IT" });
empTree.Insert(new Employee { Id = 2, FirstName = "O", LastName = "G", Department = "Marketing" });
empTree.Insert(new Employee { Id = 4, FirstName = "K", LastName = "H", Department = "IT" });
empTree.Insert(new Employee { Id = 6, FirstName = "L", LastName = "H", Department = "Sales" });
empTree.Insert(new Employee { Id = 3, FirstName = "E", LastName = "L", Department = "Sales" });
empTree.Insert(new Employee { Id = 5, FirstName = "D", LastName = "L", Department = "Marketing" });
var employeesByDept = from e in empTree group e by e.Department;
foreach (var dept in employeesByDept)
{
Console.WriteLine("Department: {0}", dept.Key);
foreach (var emp in dept)
{
Console.WriteLine("\t{0} {1}", emp.FirstName, emp.LastName);
}
}
}
}