dpfg dpfg

## script-frame.html
<script>
console.log(009099990392434234234234)
</script>

<h2>Scripting is here</h2>

## main.go
package main

import (
	"fmt"
	"time"
)

type Ref struct {
	AsOfDate time.Time
	Value    float64

## scrpit.groovy
// go to http://jenkins/script
item = Jenkins.instance.getItemByFullName("path/to/job")

item.builds.each() { build ->
  build.delete()
}

item.updateNextBuildNumber(1)

## Main.java
public class Main {
  public static void main(String[] args) {
    // According to JLS https://docs.oracle.com/javase/specs/jls/se7/html/jls-5.html
    // If the value p being boxed is true, false, a byte, or a char in the range \u0000 to \u007f, or an int or short number between -128 and 127 (inclusive), then let r1 and r2 be the results of any two boxing conversions of p. It is always the case that r1 == r2.
    // So only for certain cases reference caching is mandatory.
    // Caching for double is not mandatory. See small text - it would be ideal to have but it's not a part of the spec.
    // In actuall implementation (open jdk 12) there is no cache for doubles
    Double d1 = Double.valueOf("90");
    Double d2 = Double.valueOf("90");

## bumpme
 e

## accordion.html
<html>

<head>
  <script src="https://cdn.jsdelivr.net/vue/latest/vue.js"></script>
</head>

<body>
  <div id="app">
    <h2>{{ name }}</h2>
    <tabs>

## gist:51ae61b51906f93bb1e20792b1fb08ba

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                dpfg
                / gist:51ae61b51906f93bb1e20792b1fb08ba
            
            
              Created
              June 16, 2016 04:48
            
              
                Distributed storage systems and programming models [Reading]
              
          
Date
Subject
Readings


1/5
Welcome


1/7
Fundamentals: doom and gloom
 A note on distributed computing 
  Impossibility of Distributed Consensus with One Faulty Process


1/12
Fundamentals: rays of hope
Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail


1/14
Fundamentals: rays of hope
The Weakest Failure Detector for Solving Consensus


1/19
Fundamentals: what we know
Using Reasoning About Knowledge to analyze Distributed Systems


1/21
Storage: naming and finding
[Chord: A Scalable Peer-to-peer Lookup Service for InternetApplications](https://pdos.c


## Distributed systems meta-list.md

      
              1 file
            
          
              0 forks
            
          
                0 comments
              
            
              0 stars
            
          
                dpfg
                / Distributed systems meta-list.md
            
            
              Created
              June 16, 2016 04:45
                — forked from macintux/Distributed systems meta-list.md
            
              
                List of distributed systems reading lists, plus miscellanea
              
          
http://the-paper-trail.org/blog/distributed-systems-theory-for-the-distributed-systems-engineer/
https://github.com/palvaro/CMPS290S-Winter16/blob/master/readings.md
http://muratbuffalo.blogspot.com/2015/12/my-distributed-systems-seminars-reading.html
http://christophermeiklejohn.com/distributed/systems/2013/07/12/readings-in-distributed-systems.html
http://michaelrbernste.in/2013/11/06/distributed-systems-archaeology-works-cited.html
http://dancres.org/reading_list.html
http://rxin.github.io/db-readings/
http://research.microsoft.com/en-us/um/people/lamport/pubs/pubs.html
http://www.eecs.berkeley.edu/GradAffairs/CS/Prelims/db.html
http://pdos.csail.mit.edu/dsrg/papers/


## gist:8342039
<?xml version="1.0" encoding="UTF-8" ?>
<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
    <dict>
        <key>uuid</key>
        <string>6052353D-4EDA-4263-9535-4293100AA58A</string>
        <key>patterns</key>
        <array>
            <dict>
                <key>include</key>

## gist:6028287
import java.nio.Buffer;
import java.nio.ByteBuffer;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;

/**
 * Test performance of link list, array list, Object[] and flatted to int[] object(FieldHolder)
 * @author Aliaksandr_Chaiko
 *
	<script>
	console.log(009099990392434234234234)
	</script>

	<h2>Scripting is here</h2>
	package main

	import (
	"fmt"
	"time"
	)

	type Ref struct {
	AsOfDate time.Time
	Value float64
	// go to http://jenkins/script
	item = Jenkins.instance.getItemByFullName("path/to/job")

	item.builds.each() { build ->
	build.delete()
	}

	item.updateNextBuildNumber(1)
	public class Main {
	public static void main(String[] args) {
	// According to JLS https://docs.oracle.com/javase/specs/jls/se7/html/jls-5.html
	// If the value p being boxed is true, false, a byte, or a char in the range \u0000 to \u007f, or an int or short number between -128 and 127 (inclusive), then let r1 and r2 be the results of any two boxing conversions of p. It is always the case that r1 == r2.
	// So only for certain cases reference caching is mandatory.
	// Caching for double is not mandatory. See small text - it would be ideal to have but it's not a part of the spec.
	// In actuall implementation (open jdk 12) there is no cache for doubles
	Double d1 = Double.valueOf("90");
	Double d2 = Double.valueOf("90");
	<html>

	<head>
	<script src="https://cdn.jsdelivr.net/vue/latest/vue.js"></script>
	</head>

	<body>
	<div id="app">
	<h2>{{ name }}</h2>
	<tabs>
Date	Subject	Readings
1/5	Welcome
1/7	Fundamentals: doom and gloom	A note on distributed computing Impossibility of Distributed Consensus with One Faulty Process
1/12	Fundamentals: rays of hope	Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail
1/14	Fundamentals: rays of hope	The Weakest Failure Detector for Solving Consensus
1/19	Fundamentals: what we know	Using Reasoning About Knowledge to analyze Distributed Systems
1/21	Storage: naming and finding	[Chord: A Scalable Peer-to-peer Lookup Service for InternetApplications](https://pdos.c
	<?xml version="1.0" encoding="UTF-8" ?>
	<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
	<plist version="1.0">
	<dict>
	<key>uuid</key>
	<string>6052353D-4EDA-4263-9535-4293100AA58A</string>
	<key>patterns</key>
	<array>
	<dict>
	<key>include</key>
	import java.nio.Buffer;
	import java.nio.ByteBuffer;
	import java.util.ArrayList;
	import java.util.LinkedList;
	import java.util.List;

	/**
	* Test performance of link list, array list, Object[] and flatted to int[] object(FieldHolder)
	* @author Aliaksandr_Chaiko
	*