Skip to content

Instantly share code, notes, and snippets.

L40:
MV r0,r6
MV r1,r0
MV r0,r6
MV r0,r0
ADDI r0,128
MV r0,r0
MV r6,r0
MV r0,r7
MV r0,r0
L3:
MV r0,r6
MV r1,r0
MV r0,r6
MV r0,r0
ADDI r0,128
MV r0,r0
MV r6,r0
MV r0,r7
MV r2,r0
L24:
MV r0,r6
MV r1,r0
MV r0,r6
MV r0,r0
ADDI r0,128
MV r0,r0
MV r6,r0
MV r0,r7
MV r0,r0
@pandaman64
pandaman64 / exercise-web-crawler.go
Created October 18, 2017 01:47
Exercise: Web Crawler
package main
import (
"fmt"
"sync"
)
type Fetcher interface {
// Fetch returns the body of URL and
// a slice of URLs found on that page.
<html>
<head>
<script>
window.addEventListener("load", function(){
let field = document.getElementById("field");
let controller = document.getElementById("controller");
function run(x, y) {
controller.setAttribute("cx", new String(x));
controller.setAttribute("cy", new String(y));
x = (x - 100) * 100;
if &compatible
set nocompatible
endif
set runtimepath+=/home/pan/.vim/bundles/repos/github.com/Shougo/dein.vim
if dein#load_state('/home/pan/.vim/bundles')
call dein#begin('/home/pan/.vim/bundles')
call dein#add('/home/pan/.vim/bundles/repos/github.com/Shougo/dein.vim')
if &compatible
set nocompatible
endif
set runtimepath+=/home/pan/.vim/bundles/repos/github.com/Shougo/dein.vim
if dein#load_state('/home/pan/.vim/bundles')
call dein#begin('/home/pan/.vim/bundles')
call dein#add('/home/pan/.vim/bundles/repos/github.com/Shougo/dein.vim')
with (import <nixpkgs> {});
{
allowUnfree = true;
packageOverrides = pkgs: with pkgs; {
userPackages = buildEnv {
inherit ((import <nixpkgs/nixos> {}).config.system.path)
pathsToLink ignoreCollisions postBuild;
extraOutputsToInstall = [ "man" ];
name = "user-packages";
paths = [
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Let's call (r_i)_{i>=0} the sequence of the ranks of (A^i)_{i>=0}.
For any i>=0, the image of A^{i+1} is a subspace of the image of A^{i}.
Our sequence of ranks (r_i) is non-increasing.
Since Im(A^{i+1}) ⊂ Im(A^i), if there exists i such that r_i = r_{i+1}, Im(A^{i+1}) = Im(A^i).
From this, it follows that Im(A^k) = Im(A^i) (k > i), or r_k = r_i.
In other words, (r_i) is a sequence of non-negative integers that
- starts at n
- might be stricly decreasing for a while