pram

license: gpl-3.0
height: 960

pram

license: gpl-3.0
height: 600
border: no

pram

license: mit
border: yes

pram

license: mit

pram

license: mit

pram

license: gpl-3.0
height: 1030
scrolling: yes

pram

license: gpl-3.0

pram

[
  {
    "date": "11/01/1985",
    "open": 115.48,
    "high": 116.78,
    "low": 115.48,
    "close": 116.28,
    "volume": 900900,
    "oi": 0
  },

pram

{"directed": false, "graph": [["node_default", {}], ["name", "()_with_int_labels"], ["edge_default", {}]], "nodes": [{"id": 0, "Year": 1996, "Venue": "SWAT", "cYear": 1996, "label": "The randomized complexity of maintaining the minimum"}, {"id": 1, "Year": 1998, "Venue": "SWAT", "cYear": 1998, "label": "Probabilistic data structures for priority queues"}, {"id": 2, "Year": 1992, "Venue": "SWAT", "cYear": 1992, "label": "Fractional cascading simplified"}, {"id": 3, "Year": 2002, "Venue": "SWAT", "cYear": 2002, "label": "Paging on a RAM with Limited Resources"}, {"id": 4, "Year": 1999, "Venue": "WADS", "cYear": 1999, "label": "Online Data Structures in External Memory"}, {"id": 5, "Year": 1996, "Venue": "SWAT", "cYear": 1996, "label": "Binary search trees: How low can you go?"}, {"id": 6, "Year": 1994, "Venue": "SWAT", "cYear": 1994, "label": "Randomized geometric algorithms (abstract)"}, {"id": 7, "Year": 1989, "Venue": "WADS", "cYear": 1990, "label": "Improving partial rebuilding by using simple balance crite

pram

componentDidMount() {
  this.sub = Meteor.subscribe("itemsRefs", (err) => {
    let item = Items.findOne(this.props.id) || {};
    let state = _.pick(item, "name", "descr");
    this.setState(state);
  });
}