Jaeyong Sung buttercrab

## gc-example.rs
use std::cell::RefCell;

use crate::gc::{collect, Gc, GcCtx, Trace};

#[derive(Clone)]
struct Node {
    id: usize,
    next: RefCell<Option<Gc<Node>>>,
}

## 📊 Weekly development breakdown
C++        12 hrs 55 mins ████████████████████░  95.6%
Java       27 mins        ▋░░░░░░░░░░░░░░░░░░░░   3.3%
ObjectiveC 4 mins         ░░░░░░░░░░░░░░░░░░░░░   0.6%
C          1 min          ░░░░░░░░░░░░░░░░░░░░░   0.2%
Brainfuck  1 min          ░░░░░░░░░░░░░░░░░░░░░   0.2%

## field.cpp

/**
 * @class field
 * Number that is in modular Mod
 *
 * @tparam Mod should be prime number
 */

template<long long Mod>
class field {

## quic.pdf

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                buttercrab
                / quic.pdf
            
            
              Last active
              September 29, 2021 08:20
            
              
                구글의 새로운 프로토콜 QUIC
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## rbtree.h
/**
 * @class rbtree
 *
 * @details Red Black Tree Implementation
 *
 * @author Jaeyong Sung
 *
 * @date April 29, 2018
 */

## persistent_seg.cpp
#include <bits/stdc++.h>

using namespace std;

int func(int a, int b) {
    // binary function
    // ex) return gcd(a, b);
    // ex) return a * b;
    // ex) return a ^ b;
    // BUT! associated law has to be held

## dynamic_seg.cpp
#include <bits/stdc++.h>

using namespace std;

// identity element of binary function
int e = 0;

int func(int a, int b) {
	// binary function
	// ex) return gcd(a, b);

## lazy_seg.cpp
#include <bits/stdc++.h>

using namespace std;

int func(int a, int b) {
    // binary function
    // ex) return gcd(a, b);
    // ex) return a * b;
    // ex) return a ^ b;
    // BUT! associated law has to be held

## segment_tree.cpp
#include <bits/stdc++.h>

using namespace std;

int func(int a, int b) {
    // binary function
    // ex) return gcd(a, b);
    // ex) return a * b;
    // ex) return a ^ b;
    // BUT! associated law has to be held
	use std::cell::RefCell;

	use crate::gc::{collect, Gc, GcCtx, Trace};

	#[derive(Clone)]
	struct Node {
	id: usize,
	next: RefCell<Option<Gc<Node>>>,
	}
	C++ 12 hrs 55 mins ████████████████████░ 95.6%
	Java 27 mins ▋░░░░░░░░░░░░░░░░░░░░ 3.3%
	ObjectiveC 4 mins ░░░░░░░░░░░░░░░░░░░░░ 0.6%
	C 1 min ░░░░░░░░░░░░░░░░░░░░░ 0.2%
	Brainfuck 1 min ░░░░░░░░░░░░░░░░░░░░░ 0.2%

	/**
	* @class field
	* Number that is in modular Mod
	*
	* @tparam Mod should be prime number
	*/

	template<long long Mod>
	class field {
	/**
	* @class rbtree
	*
	* @details Red Black Tree Implementation
	*
	* @author Jaeyong Sung
	*
	* @date April 29, 2018
	*/
	#include <bits/stdc++.h>

	using namespace std;

	int func(int a, int b) {
	// binary function
	// ex) return gcd(a, b);
	// ex) return a * b;
	// ex) return a ^ b;
	// BUT! associated law has to be held
	#include <bits/stdc++.h>

	using namespace std;

	// identity element of binary function
	int e = 0;

	int func(int a, int b) {
	// binary function
	// ex) return gcd(a, b);