Let's introduce the region types used in G1:
eden: for newly added objects from-survivor: for objects in to-survivor from previous young-GC to-survivor: live objects in eden/from-survivor are copied here if they have not lived long old: live objects in eden/from-survivor are copied here if they have lived long
| // https://developers.google.com/edu/c++/getting-started | |
| #include <iostream> | |
| #include <cassert> | |
| using namespace std; | |
| static int a, b, c; | |
| int new_sum(int sum, bool& terminated) | |
| { |
Find the max and min of sum of all permutations of [1..9] satisfying the following condition:
sum
== a[1] + a[2] + a[3]
== a[3] + a[4] + a[5]
== a[5] + a[6] + a[7]
== a[7] + a[8]
where sum = a[0] + a[1]
DrRacket provides rudimentary features for Racket programming, you could experiment them by launch DrRacket directly. Some particularly interesting/useful ones are highlighted here:
Hoogle is the search engine for Haskell functions. It supports searching by function names and types.
For example, you plan to use parMap, but forget its type. You could just type parMap in Hoogle, and the search result would look like:
| {-# LANGUAGE NamedFieldPuns #-} | |
| import Data.List ((\\)) | |
| type Grid = [[Char]] | |
| third_d :: Int -> Int -> Int | |
| third_d x y = head $ [1..3] \\ [x,y] | |
| data Op = L | R | U | D deriving (Show) | |
| data State = State { |
specific goal specific time period specific resource unique work arrangement temporary organization
The line is optimized towards routine work. When one new problem arises, one specific request is given to a project group through a project charter trying to solve this problem. After the problem is solved, the result is implemented in the line, and initiates new work routine in the line.
| #define MIN(a,b) (((a)<(b))?(a):(b)) | |
| typedef unsigned int uint; | |
| typedef struct { | |
| uint red:5; | |
| uint green:6; | |
| uint blue:5; | |
| } f_pixel; |
| global gc_major | |
| global gc_minor | |
| global gc_major_count | |
| global gc_minor_count | |
| global stat | |
| global count_stat | |
| probe process("/home/albert/github/otp/bin/x86_64-unknown-linux-gnu/beam.smp").mark("gc_major__start") | |
| { | |
| gc_major[user_string($arg1)] = gettimeofday_ms() - gc_major[user_string($arg1)] |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <time.h> | |
| // copied from http://rosettacode.org/wiki/Sorting_algorithms/Insertion_sort#C | |
| void insertion_sort (int *a, int n) { | |
| int i, j, t; | |
| for (i = 1; i < n; i++) { | |
| t = a[i]; | |
| for (j = i; j > 0 && t < a[j - 1]; j--) { |