If one item in a package or stack initiates, it will usually propagate to the other items, creating a mass fire.

If this is set, it signifies that the current label is the last in the stack.

If the popped label was the last on the label stack, the packet " leaves " the MPLS tunnel.

If a mapping is available, presentation service data units are encapsulated into session protocol data units, and passed down the stack. This layer provides independence from data representation ( e. g., encryption ) by translating between application and network formats.

If the two cards played are of equal value, each player lays down three face-down cards and picks one of the cards out of the three ( a " war "), and the higher-valued card wins all of the cards on the table, which are then added to the bottom of the player's stack.

If the player has no cards he can play, he must instead draw a new card from the top of the stack and, in some variants, say something such as " Pass ", " Penalty Card " or knock on the table to indicate inability to play a card.

If a bowler, usually a leg spin bowler, decides to attack the batsman's legs in an attempt to force a stumping, bowl him behind his legs, or induce a catch on the leg side, the field may stack 4-5 towards the leg side.

; Multi-level undo: If all user actions in a program are implemented as command objects, the program can keep a stack of the most recently executed commands.

If the former command is added twice to an undo stack, both items on the stack refer to the same command instance.

If the stack is full and does not contain enough space to accept the given item, the stack is then considered to be in an overflow state.

If the judge does not pick one of their red apple cards, the wagered cards are forfeited to the bottom of the card stack.

If the temperature gradient operator exceeds one, the mean temperature gradient is larger than the critical temperature gradient and the stack operates as a prime mover.

If the temperature gradient operator is less than one, the mean temperature gradient is smaller than the critical gradient and the stack operates as a heat pump.

If deploying as a team, the team will form up in a stack while airborne with their parachutes.

If an adapter is operating in normal mode, it will drop this frame, and the IP stack never sees or responds to it.

If the adapter is in promiscuous mode, the frame will be passed on, and the IP stack on the machine ( to which a MAC address has no meaning ) will respond as it would to any other ping.

If the card was correctly declared, then the challenger must pick up the entire stack ; otherwise the bluffer must pick it up.

If a falling top half does not have any bottom half to join to in the stack it touches, it is automatically removed and no points are awarded.

If such a pointer is a null pointer, dangling pointer ( pointing to memory that has already been freed ), or to a memory location outside of current stack or heap bounds, it is referring to memory that is not then possessed by the program.

If the program did not have a dbref and a string on the top of the stack at runtime, in this order, the program would crash.

If the stack did not contain a dbref and a string, in the proper order, the program would crash.

If an expensive and specialized piece of machinery is needed -- such as a spray rig, a combine, or a binder -- it is better to pay someone with a machine to do the work.

If Acorn had thought to include this small modification in the original Electron design it is likely the machine would have had a much greater impact as it would have nearly doubled the amount of motion possible in games and saved modes 0 – 3 ( including the only 16 colour mode ) from being nearly useless due to contended memory timings.

If another machine has that address, it will pick another address, and keep trying until it finds a free one.

If numerical iterative methods have to be employed, the aim is to iterate until full machine accuracy is obtained ( the best that is possible with a finite word length on the computer, and within the mathematical and / or physical approximations made ).

For example, a non-deterministic Turing machine may have both " If you are in state 2 and you see an ' A ', change it to a ' B ' and move left " and " If you are in state 2 and you see an ' A ', change it to a ' C ' and move right " in its rule set.

( If the machine is deterministic, the possible computations are the prefixes of a single, possibly infinite, path.

If there is an oracle machine M that computes a function f with oracle A, f is said to be A-computable.

If this disc was removed from the machine and put on a similar machine provided with a contact point, the embossed record would cause the signals to be repeated into another wire.

If we allow a finite automaton access to two stacks instead of just one, we obtain a more powerful device, equivalent in power to a Turing machine.

If a player dies all their weapons are lost and they receive the spawn weapons for the current map, usually the gauntlet and machine gun.

If the roving was not a consistent size, then this step could cause a break in the yarn, or could jam the machine.

If the required font files do not exist on the machine where the SVG file is rendered, the text may not appear as intended.

If a player matches a combination according to the rules of the game, the slot machine pays the player cash or some other sort of value, such as extra games.

If a machine that is not designed to support Wake-on-LAN is left powered down after power failure, it may be possible to set the BIOS to start it up automatically on restoration of power, so that it is never left in an unresponsive state.

If a connection delay of a minute or two is acceptable, the machine can timeout into hibernation, powered off with its state saved to disk.

If the machine address does not match the intended address for the data, the machine ignores the data.

If the virtual machine uses only byte-size instructions, is simply a fetch from, but often there are commonly used 1-byte instructions plus some less-common multibyte instructions, in which case is more complex.

# If all goes well, users on the client machine can then view and interact with mounted filesystems on the server within the parameters permitted.

If so, a disassembler operating on the machine code would produce disassembly lacking these constants and comments ; the disassembled output becomes more difficult for a human to interpret than the original annotated source code.

) If we use a nondeterministic machine instead, we get the class NEXPSPACE, which is equal to EXPSPACE by Savitch's theorem.

If V is a probabilisitic Turing Machine which could possible accept x if x is in X, then the proof is the string of coin flips which leads the machine, by luck, intuition, or genius, to accepting x.

If the machine in question is larger than that, we can scale to 1600 MIPS with our quad Nehalem based package, and we have been promised an 8 way Nehalem EX based machine early next year that should take us to the 3200 MIPS mark.