fn ret(&mut self) 
	{
		if self.stack[0] == 0 { panic!("Return without anything on the stack!"); }
		
		let mut i = 0;
		while i < self.stack.len()
		{
			if self.stack[i] == 0
			{
				self.pc = self.stack[i-1];
				self.stack[i-1] = 0;
				return;
			}
			i = i + 1;
		}

		self.pc = self.stack[15];
		self.stack[15] = 0;
	}
/// Return from a subroutine.
/// The interpreter sets the program counter to the address at the top of the stack, then subtracts 1 from the stack pointer.
Return from a subroutine.
The interpreter sets the program counter to the address at the top of the stack, then subtracts 1 from the stack pointer.
Return from a subroutine . The interpreter sets the program counter to the address at the top of the stack then subtracts 1 from the stack pointer .
fn ret(&mut self) 
	{
		if self.stack[0] == 0 { panic!("Return without anything on the stack!"); }
		let mut i = 0;
		while i < self.stack.len()
		{
			if self.stack[i] == 0
			{
				self.pc = self.stack[i-1];
				self.stack[i-1] = 0;
				return;
			}
			i = i + 1;
		}
		self.pc = self.stack[15];
		self.stack[15] = 0;
	}
fn ret ( & mut self ) { if self . stack [ 0 ] == 0 { panic ! ( " " ) ; } let mut i = 0 ; while i < self . stack . len ( ) { if self . stack [ i ] == 0 { self . pc = self . stack [ i - 1 ] ; self . stack [ i - 1 ] = 0 ; return ; } i = i + 1 ; } self . pc = self . stack [ 15 ] ; self . stack [ 15 ] = 0 ; }
Return from a subroutine.
Return from a subroutine .
&mut self