zuyu

## bench-backend.conf
listen: 3001
http2-max-concurrent-requests-per-connection: 1024
max-connections: 15000
num-threads: 1
hosts:
  localhost:
    paths:
      /:
        file.dir: /path/to/htdocs

## bibliography.md

      
              1 file
            
          
              0 forks
            
          
                1 comment
              
            
              15 stars
            
          
                gigamonkey
                / bibliography.md
            
            
              Last active
              April 15, 2024 09:17
            
          
    Books

Algorithms and Data Structures

The Art of Computer Programming (Knuth)
Programming Pearls (Bentley)
Data Structures and Algorithms (Aho, Hopcroft, Ullman)

  
## tree-bench.cc
#include <set>

#include <stdio.h>
#include <sys/time.h>

double now()
{
  struct timeval tv;
  gettimeofday(&tv, NULL);
  return tv.tv_sec + tv.tv_usec / 1000000.0;

## 0.suffixtree.cs
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Text;

namespace SuffixTreeAlgorithm
{
	public class SuffixTree
	{
	listen: 3001
	http2-max-concurrent-requests-per-connection: 1024
	max-connections: 15000
	num-threads: 1
	hosts:
	localhost:
	paths:
	/:
	file.dir: /path/to/htdocs
	#include <set>

	#include <stdio.h>
	#include <sys/time.h>

	double now()
	{
	struct timeval tv;
	gettimeofday(&tv, NULL);
	return tv.tv_sec + tv.tv_usec / 1000000.0;
	using System;
	using System.Collections.Generic;
	using System.IO;
	using System.Linq;
	using System.Text;

	namespace SuffixTreeAlgorithm
	{
	public class SuffixTree
	{