haberman

T create<T>(T Function(int) creator, int a) {
  return creator(a);
}

class Bar {
  int member;
  Bar(this.member);
  
  void doPrint() { print(member); }
}

haberman

class Getter<T> {}

extension on Getter<int> {
  int get() => 42;
}

extension on Getter<String> {
  String get() => "the answer to life, the universe, and everything";
}

haberman

class Getter<T> {}

T get<T>(Getter<T> getter) {
  if (T == int) {
    return 42 as T;
  } else if (T == String) {
    return "the answer to life, the universe, and everything" as T;
  }
  throw "Unexpected type: ${T.toString()}";

haberman

autocmd FileType bzl AutoFormatBuffer buildifier

syntax on
let mapleader = ","
set wildmode=list:longest
set list
set listchars=tab:>-,trail:-,extends:>,precedes:<,nbsp:+
set sts=2
set sw=2
set bs=2

haberman

  0.7%   0.7%    8645 google::protobuf::TextFormat::Parser::ParserImpl::ConsumeField(google::protobuf::Message*)
  0.6%   1.2%    7131 google::protobuf::io::Printer::Print(char const*, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&)
  0.5%   1.8%    6346 google::protobuf::DescriptorBuilder::BuildMessage(google::protobuf::DescriptorProto const&, google::protobuf::Descriptor const*, google::protobuf::Descriptor*)
  0.5%   2.2%    6248 google::protobuf::io::Printer::Print(char const*, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&, char const*, std::string const&)
  0.5%   2.7%    5974 google::protobuf::util::converter::ProtoWriter::RenderPrimitiveField

haberman

#!/usr/bin/python

import sys
import re

INCLUDE_RE = re.compile('^#include "([^"]*)"$')

def parse_include(line):
  match = INCLUDE_RE.match(line)
  return match.groups()[0] if match else None

haberman

use std::collections::TreeMap;
use std::collections::tree_map::Entries;  // This took forever
use std::num::One;
use std::num::Saturating;

// Equivalent to Set<T>, but only works for Ints, and may be more efficient
// if the set contains large contiguous ranges.  Each range is stored as a
// single entry instead of storing each member individually.
struct IntSet<T> {
  // These correspond to ranges of high->low.  The ranges are closed (inclusive)

haberman

{
 "metadata": {
  "name": "HistogramFail"
 },
 "nbformat": 3,
 "nbformat_minor": 0,
 "worksheets": [
  {
   "cells": [
    {

haberman

// Prototype for a scheme for upb Rust wrappers for upb.
//
// Output (when linked with fakeupb.c):
//   C: new()
//   C: number() = 1
//   Number: 1
//   C: setnumber(5)
//   C: number() = 5
//   Number: 5
//   C: freeze() = 1

haberman

// Fake upb: a fake implementation for a small subset of the
// actual upb interface, for testing with Rust.

#include <stdint.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>

typedef struct {
  uint32_t refcount;