<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
		<id>http://nfex.ru/index.php?action=history&amp;feed=atom&amp;title=Csharp%2FCSharp_Tutorial%2FData_Structure%2FYour_Stack</id>
		<title>Csharp/CSharp Tutorial/Data Structure/Your Stack - История изменений</title>
		<link rel="self" type="application/atom+xml" href="http://nfex.ru/index.php?action=history&amp;feed=atom&amp;title=Csharp%2FCSharp_Tutorial%2FData_Structure%2FYour_Stack"/>
		<link rel="alternate" type="text/html" href="http://nfex.ru/index.php?title=Csharp/CSharp_Tutorial/Data_Structure/Your_Stack&amp;action=history"/>
		<updated>2026-04-30T00:58:00Z</updated>
		<subtitle>История изменений этой страницы в вики</subtitle>
		<generator>MediaWiki 1.30.0</generator>

	<entry>
		<id>http://nfex.ru/index.php?title=Csharp/CSharp_Tutorial/Data_Structure/Your_Stack&amp;diff=5559&amp;oldid=prev</id>
		<title> в 15:31, 26 мая 2010</title>
		<link rel="alternate" type="text/html" href="http://nfex.ru/index.php?title=Csharp/CSharp_Tutorial/Data_Structure/Your_Stack&amp;diff=5559&amp;oldid=prev"/>
				<updated>2010-05-26T15:31:53Z</updated>
		
		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style=&quot;vertical-align: top;&quot; lang=&quot;ru&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Предыдущая&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Версия 15:31, 26 мая 2010&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; style=&quot;text-align: center;&quot; lang=&quot;ru&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(нет различий)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
			</entry>

	<entry>
		<id>http://nfex.ru/index.php?title=Csharp/CSharp_Tutorial/Data_Structure/Your_Stack&amp;diff=5560&amp;oldid=prev</id>
		<title>Admin: 1 версия</title>
		<link rel="alternate" type="text/html" href="http://nfex.ru/index.php?title=Csharp/CSharp_Tutorial/Data_Structure/Your_Stack&amp;diff=5560&amp;oldid=prev"/>
				<updated>2010-05-26T12:15:54Z</updated>
		
		<summary type="html">&lt;p&gt;1 версия&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;==A stack class for characters.==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
   &lt;br /&gt;
&amp;lt;source lang=&amp;quot;csharp&amp;quot;&amp;gt;using System;  &lt;br /&gt;
  &lt;br /&gt;
class Stack {   &lt;br /&gt;
  char[] stck; // holds the stack  &lt;br /&gt;
  int tos;     // index of the top of the stack  &lt;br /&gt;
   &lt;br /&gt;
  public Stack(int size) {   &lt;br /&gt;
    stck = new char[size]; // allocate memory for stack   &lt;br /&gt;
    tos = 0;   &lt;br /&gt;
  }   &lt;br /&gt;
  &lt;br /&gt;
  public void push(char ch) {   &lt;br /&gt;
    if(tos==stck.Length) {   &lt;br /&gt;
      Console.WriteLine(&amp;quot; -- Stack is full.&amp;quot;);   &lt;br /&gt;
      return;   &lt;br /&gt;
    }   &lt;br /&gt;
       &lt;br /&gt;
    stck[tos] = ch;  &lt;br /&gt;
    tos++;  &lt;br /&gt;
  }   &lt;br /&gt;
   &lt;br /&gt;
  public char pop() {   &lt;br /&gt;
    if(tos==0) {   &lt;br /&gt;
      Console.WriteLine(&amp;quot; -- Stack is empty.&amp;quot;);   &lt;br /&gt;
      return (char) 0;    &lt;br /&gt;
    }   &lt;br /&gt;
     &lt;br /&gt;
    tos--;   &lt;br /&gt;
    return stck[tos];   &lt;br /&gt;
  } &lt;br /&gt;
 &lt;br /&gt;
  public bool full() { &lt;br /&gt;
    return tos==stck.Length;    &lt;br /&gt;
  } &lt;br /&gt;
 &lt;br /&gt;
  public bool empty() { &lt;br /&gt;
    return tos==0; &lt;br /&gt;
  } &lt;br /&gt;
 &lt;br /&gt;
  public int capacity() { &lt;br /&gt;
    return stck.Length; &lt;br /&gt;
  } &lt;br /&gt;
 &lt;br /&gt;
  public int getNum() { &lt;br /&gt;
    return tos; &lt;br /&gt;
  } &lt;br /&gt;
}  &lt;br /&gt;
class MainClass {   &lt;br /&gt;
  public static void Main() {   &lt;br /&gt;
    Stack stk1 = new Stack(10);   &lt;br /&gt;
    Stack stk2 = new Stack(10);   &lt;br /&gt;
    Stack stk3 = new Stack(10);   &lt;br /&gt;
    char ch;   &lt;br /&gt;
    int i;   &lt;br /&gt;
   &lt;br /&gt;
    Console.WriteLine(&amp;quot;Push A through J onto stk1.&amp;quot;); &lt;br /&gt;
    for(i=0; !stk1.full(); i++)   &lt;br /&gt;
      stk1.push((char) (&amp;quot;A&amp;quot; + i));   &lt;br /&gt;
  &lt;br /&gt;
    if(stk1.full()) &lt;br /&gt;
       Console.WriteLine(&amp;quot;stk1 is full.&amp;quot;); &lt;br /&gt;
 &lt;br /&gt;
    Console.Write(&amp;quot;Contents of stk1: &amp;quot;);   &lt;br /&gt;
    while( !stk1.empty() ) {    &lt;br /&gt;
      ch = stk1.pop();   &lt;br /&gt;
      Console.Write(ch);   &lt;br /&gt;
    }   &lt;br /&gt;
   &lt;br /&gt;
    Console.WriteLine();   &lt;br /&gt;
 &lt;br /&gt;
    if(stk1.empty()) &lt;br /&gt;
       Console.WriteLine(&amp;quot;stk1 is empty.\n&amp;quot;); &lt;br /&gt;
   &lt;br /&gt;
    Console.WriteLine(&amp;quot;Again push A through J onto stk1.&amp;quot;); &lt;br /&gt;
    for(i=0; !stk1.full(); i++)   &lt;br /&gt;
      stk1.push((char) (&amp;quot;A&amp;quot; + i));   &lt;br /&gt;
 &lt;br /&gt;
    Console.WriteLine(&amp;quot;Now, pop chars from stk1 and push &amp;quot; + &lt;br /&gt;
                      &amp;quot;them onto stk2.&amp;quot;); &lt;br /&gt;
    while( !stk1.empty() ) {    &lt;br /&gt;
      ch = stk1.pop();   &lt;br /&gt;
      stk2.push(ch); &lt;br /&gt;
    }   &lt;br /&gt;
 &lt;br /&gt;
    Console.Write(&amp;quot;Contents of stk2: &amp;quot;);   &lt;br /&gt;
    while( !stk2.empty() ) {    &lt;br /&gt;
      ch = stk2.pop();   &lt;br /&gt;
      Console.Write(ch);   &lt;br /&gt;
    }   &lt;br /&gt;
 &lt;br /&gt;
 &lt;br /&gt;
    Console.WriteLine(&amp;quot;Capacity of stk2: &amp;quot; + stk2.capacity()); &lt;br /&gt;
    Console.WriteLine(&amp;quot;Number of objects in stk2: &amp;quot; + &lt;br /&gt;
                      stk2.getNum()); &lt;br /&gt;
    &lt;br /&gt;
  }   &lt;br /&gt;
}&amp;lt;/source&amp;gt;&lt;br /&gt;
&amp;lt;pre class=codeResult&amp;gt;Push A through J onto stk1.&lt;br /&gt;
stk1 is full.&lt;br /&gt;
Contents of stk1: JIHGFEDCBA&lt;br /&gt;
stk1 is empty.&lt;br /&gt;
Again push A through J onto stk1.&lt;br /&gt;
Now, pop chars from stk1 and push them onto stk2.&lt;br /&gt;
Contents of stk2: ABCDEFGHIJCapacity of stk2: 10&lt;br /&gt;
Number of objects in stk2: 0&amp;lt;/pre&amp;gt;&lt;/div&gt;</summary>
		<author><name>Admin</name></author>	</entry>

	</feed>