lancejpollard

# source:http://reocities.com/SiliconValley/heights/7052/opcode.txt
From: [email protected] (Mark Hopkins)
Newsgroups: alt.lang.asm
Subject: A Summary of the 80486 Opcodes and Instructions

(1) The 80x86 is an Octal Machine
   This is a follow-up and revision of an article posted in alt.lang.asm on
7-5-92 concerning the 80x86 instruction encoding.
 
   The only proper way to understand 80x86 coding is to realize that ALL 80x86

lancejpollard

#[derive(Copy, Clone, PartialEq, Eq, Debug)]
pub struct True;

#[derive(Copy, Clone, PartialEq, Eq, Debug)]
pub struct False;

pub trait Bool {
    fn new() -> Self;
}
impl Bool for True {

lancejpollard

#[derive(Copy, Clone, PartialEq, Eq, Debug)]
pub struct True;

#[derive(Copy, Clone, PartialEq, Eq, Debug)]
pub struct False;

pub trait Bool {
    fn new() -> Self;
}
impl Bool for True {

lancejpollard

import java.util.Arrays;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import java.util.concurrent.locks.ReentrantReadWriteLock;

public class Node {

	static final int MIN_ELEMENTS = 30, MAX_ELEMENTS = 2 * MIN_ELEMENTS;
	private int[] data;
	private int len;

lancejpollard

export class BTreeNode {
  constructor(isLeaf) {
    /**
     * @type {number[]} list of values in the node
    */
    this.values = [];
    /**
     * @type {boolean} is a leaf
    */
    this.leaf = isLeaf;

lancejpollard

ANSI Escape Sequences

Standard escape codes are prefixed with Escape:

• Ctrl-Key: ^[
• Octal: \033
• Unicode: \u001b
• Hexadecimal: \x1B
• Decimal: 27

lancejpollard

typedef struct _DateTime {
	uint16_t year;
	uint8_t month;
	uint8_t day;
	uint8_t hour;
	uint8_t minute;
	uint8_t second;
} DateTime;

uint8_t monthDays[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

lancejpollard

const logicGates = {
  nand (a, b) { return !(a && b); },
  not  (a)    { return this.nand (a, a); },
  and  (a, b) { return this.not  (this.nand (a, b)); },
  or   (a, b) { return this.nand (this.not  (a), this.not(b)); },
  nor  (a, b) { return this.not  (this.or   (a, b)); },
  xor  (a, b) { return this.and  (this.nand (a, b), this.or(a, b)); },
  xnor (a, b) { return this.not  (this.xor  (a, b)); }
};

lancejpollard

/** By_Sean_Eron_Anderson [email protected] */

#include <stdbool.h>
#include <stdint.h>
#include <endian.h>

#define CHAR_BIT 8

void Compute_the_sign_of_an_integer() {
    /*Compute the sign of an integer*/

lancejpollard

def deBruijn(n, k):
   '''
   An implementation of the FKM algorithm for generating the de Bruijn
   sequence containing all k-ary strings of length n, as described in
   "Combinatorial Generation" by Frank Ruskey.
   '''
 
   a = [ 0 ] * (n + 1)
   
   def gen(t, p):