C#, "Xiaobai Learning Program" Lesson 5: Queue (Queue)

1 text format

/// <summary>
/// Lesson 5 of "Xiaobai Learning Programs": Queue (Queue)
/// Common queuing in daily life, how does the software reflect it?
/// The basic principle of queuing is: first come first served, first come first served, first in first out
/// </summary>
/// <param name="sender"></param>
/// <param name ="e"></param>
private void button5_Click(object sender, EventArgs e)
{     // #1 define a queue (members are classmate information)     Queue<Classmate> q = new Queue<Classmate>();

    // #2 Queuing
    // Here select male students to participate in queuing
    int n = 8;
    for (int i = 0; i < n; i++)
    {         if (mates[i].Gender == "male")         {             // add Queue information             q.Enqueue(mates[i]);         }     }

    // #3 Dinner is ready! (output queue information)
    StringBuilder sb = new StringBuilder();
    while (q.Count > 0)
    {         // select the first member of the queue         Classmate m = q.Dequeue();         sb.AppendLine(m.Id + " " + m.Name + ": " + m.Gender + "<br>");     }     webBrowser1.DocumentText = sb.ToString(); }






 

2 code format

/// <summary>
/// 《小白学程序》第五课：队列（Queue）
/// 日常生活中常见的排队，软件怎么体现呢？
/// 排队的基本原则是：先到先得，先到先吃，先进先出
/// </summary>
/// <param name="sender"></param>
/// <param name="e"></param>
private void button5_Click(object sender, EventArgs e)
{
    // #1 定义一个队列（成员是同学信息Classmate）
    Queue<Classmate> q = new Queue<Classmate>();

    // #2 排队
    // 这里选择男同学参与排队
    int n = 8;
    for (int i = 0; i < n; i++)
    {
        if (mates[i].Gender == "男")
        {
            // 添加队列信息
            q.Enqueue(mates[i]);
        }
    }

    // #3 开饭啦！（输出队列信息）
    StringBuilder sb = new StringBuilder();
    while (q.Count > 0)
    {
        // 选择队列第一个成员
        Classmate m = q.Dequeue();
        sb.AppendLine(m.Id + " " + m.Name + ": " + m.Gender + "<br>");
    }
    webBrowser1.DocumentText = sb.ToString();
}

You are very lucky to read the only real programming tutorial in the world.