register tour sign in Home My Books Friends Recommendations Explore Genres Listopia Giveaways Choice Awards Popular Goodreads Voice Ebooks Fun Trivia Quizzes Quotes Community Groups Creative Writing People Events Get quotes daily Sign in with Facebook Sign in options Join Goodreads Richard P. Feynman Quotes The other students in the class interrupt me: "We *know* all that!" "Oh," I say, "you *do*? Then no *wonder* I can catch up with you so fast after you've had four years of biology." They had wasted all their time memorizing stuff like that, when it could be looked up in fifteen minutes.” ― Richard P. Feynman , Surely You're Joking, Mr. Feynman!: Adventures of a Curious Character tags: humor , learning , physics , science Read more quotes from Ri...

CentralNotice Malbolge From Wikipedia, the free encyclopedia Jump to: navigation , search This article is about the programming language. For the eighth circle of hell in Dante's Inferno, see Malebolge . This article has multiple issues. Please help improve it or discuss these issues on the talk page . This article's lead section may not adequately summarize key points of its contents . Please consider expanding the lead to provide an accessible overview of all important aspects of the article. (May 2012) This article needs additional citations for verification . Please help improve this article by adding citations to reliable sources . Unsourced material may be challenged and removed. (November 2011) This article may have too many section headers dividing up its content . Please help improve the article by merging similar sections an...

~?~

Skip to content Sign up Sign in This repository Explore Features Enterprise Blog Star 176 Fork 25 hashicorp / memberlist /.container /.repohead Code Issues Pull Requests Pulse Graphs HTTPS Subversion You can clone with HTTPS or Subversion . Download ZIP /.repository-sidebar Golang package for gossip based membership and failure detection 365 commits 1 branch 0 releases 12 contributors Go 99.6% Other 0.4% Go Other branch: master Switch branches/tags /.select-menu-header Branches Tags /.select-menu-tabs /.select-menu-filters master /.select-menu-item Nothing to show /.select-menu-list Nothing to show /.select-menu-list /.select-menu-modal /.select-menu-modal-holder /.s...

Header Content Wrapper Left Column Main Content Well Video Hack ‘n’ Slash is a puzzle action game about hacking — reprogram object properties, hijack global variables, hack creature behavior, and even rewrite the game’s code. The only way to win is not to play... by the rules! The wizard has mandated that everyone stay in the village, the castle armory has started to forge weapons so powerful that no one but guards are allowed to carry them, and anyone who attempts to locate a sprite and demonstrate their bravery would face certain death. The new laws are for your own protection, but you don’t buy it. You’ll show everyone what “brave” means and, if you’re clever, maybe uncover the secret reasons why everything’s gone sideways. Screenshots Links Read the development blog Check out the official Hack'n'Slash forums Buy Right Column Footer ...

CentralNotice Banach–Tarski paradox From Wikipedia, the free encyclopedia Jump to: navigation , search Can a ball be decomposed into a finite number of point sets and reassembled into two balls identical to the original? The Banach–Tarski paradox is a theorem in set-theoretic geometry , which states the following: Given a solid ball in 3‑dimensional space, there exists a decomposition of the ball into a finite number of disjoint subsets , which can then be put back together in a different way to yield two identical copies of the original ball. Indeed, the reassembly process involves only moving the pieces around and rotating them, without changing their shape. However, the pieces themselves are not "solids" in the usual sense, but infinite scatterings of points. The reconstruction can work with as few as five pieces. [ 1 ] A stronger form of the theorem implies ...

<![endif] NOTE: The nojs class is removed from the page if javascript is enabled. Otherwise, it drives the display when there is no javascript. Stanford Encyclopedia of Philosophy Menu Browse Table of Contents What's New Random Entry Chronological Archives About Editorial Information About the SEP Editorial Board How to Cite the SEP Special Characters Advanced Tools Contact Support SEP Support the SEP PDFs for SEP Friends Make a Donation SEPIA for Libraries End navigation End search End header End header wrapper Begin article sidebar Entry Navigation Entry Contents Bibliography Academic Tools Friends PDF Preview Author and Citation Info Back to Top End article sidebar NOTE: Article content must have two wrapper divs: id="article" and id="article-content" BEGIN ARTICLE HTML DO NOT MODIFY THIS LINE AND ABOVE First published ...

MENU Overview Support & Hosting Blog Docs Community Play Download We're Hiring! Introduction Overview Installation Getting Started API Reading & Writing Data Query Language Aggregate Functions Continuous Queries Chunked HTTP Responses Administration UI Built-in Admin and Explorer Interface Grafana Dashboards Influga Dashboards Advanced Topics Underlying Storage and Shards Configuration Options Schema Design Performance Considerations Security Clustering Design Setup Guides Introduction Replacing Graphite Syslog Analytics with FluentD Future Features Binary Protocol Pubsub Column Indexes and Tags Shard Spaces and Retention Policies Custom Functions Security Enhancements Merging Many Series Client Libraries JavaScript Ruby Rails Python Python (async Tornado) Node.js PHP Java Clojure Common Lisp Java Metrics Go Go Metrics Scala R Perl Haskell Contributing CLA To this Documentation License ...

...

PASTEBIN |  #1 paste tool since 2002 create new paste tools api archive faq PASTEBIN create new paste trending pastes sign up login my alerts my settings my profile Want more features on Pastebin? Sign Up , it's FREE! Public Pastes Monk Guide - Fatal 1 sec ago Untitled 2 sec ago Untitled 6 sec ago Untitled 17 sec ago Untitled 8 sec ago Untitled 10 sec ago Untitled 11 sec ago Untitled 12 sec ago By: a guest on Dec 15th, 2014 |  syntax: None |  size: 0.42 KB  |  views: 6 |  expires: Never download | raw | embed | report abuse | print Text below is selected. Please press Ctrl+C to copy to your clipboard. (⌘+C on Mac) SELECT rel.relations AS relations, res.sailor_ssn AS s_ssn, COUNT(*) AS totalreservations FROM reservations res JOIN (SELECT r1.sailorssn AS from, r2.sailorssn AS to, COUNT(*) AS relations FR...

CentralNotice Directed acyclic graph From Wikipedia, the free encyclopedia Jump to: navigation , search An example of a directed acyclic graph In mathematics and computer science , a directed acyclic graph ( DAG i / ˈ d æ ɡ / ), is a directed graph with no directed cycles . That is, it is formed by a collection of vertices and directed edges , each edge connecting one vertex to another, such that there is no way to start at some vertex v and follow a sequence of edges that eventually loops back to v again. [ 1 ] [ 2 ] [ 3 ] DAGs may be used to model many different kinds of information. The reachability relation in a DAG forms a partial order , and any finite partial order may be represented by a DAG using reachability. A collection of tasks that must be ordered into a sequence, subject to constraints that certain tasks must be performed earlier than others, may be...

Skip to content Sign up Sign in This repository Explore Features Enterprise Blog Star 2,473 Fork 221 hashicorp / consul /.container /.repohead Code Issues Pull Requests Wiki Pulse Graphs HTTPS Subversion You can clone with HTTPS or Subversion . Download ZIP /.repository-sidebar Permalink blob contrib key: blob_contributors:v21:b60f7a05cd4a63bce0d968f885d8f4dd branch: master Switch branches/tags /.select-menu-header Branches Tags /.select-menu-tabs /.select-menu-filters f-standardize-api /.select-menu-item f-tombstone /.select-menu-item f-web-ui-demo /.select-menu-item master /.select-menu-item Nothing to show /.select-menu-list v0.4.1 /.select-menu-item v0.4.0 /.select-menu-item v0.3.1 /.select-...

Skip to main content Select language Skip to search Header mozilla Mozilla Developer Network Sign in with Sign in Persona GitHub Zones Add-ons App Center Firefox Firefox Marketplace Firefox OS Persona Web Platform Technologies HTML CSS JavaScript Graphics APIs / DOM Apps MathML References & Guides Tutorials References Developer Guides Accessibility Demos ...more docs Tools Demos Connect Search Search Content will go here end is_zone action buttons Languages Français Русский Add a translation Edit Advanced this page Advanced History Print this page crumbs MDN Web technology for developers JavaScript JavaScript reference Expressions and operators Destructuring assignment heading Your Search Results start the main content container additional controls row; hidden unless needed Show TOC "...

CentralNotice Bin packing problem From Wikipedia, the free encyclopedia Jump to: navigation , search In the bin packing problem , objects of different volumes must be packed into a finite number of bins or containers each of volume V in a way that minimizes the number of bins used. In computational complexity theory , it is a combinatorial NP-hard problem. There are many variations of this problem, such as 2D packing, linear packing, packing by weight, packing by cost, and so on. They have many applications, such as filling up containers, loading trucks with weight capacity constraints, creating file backups in media and technology mapping in Field-programmable gate array semiconductor chip design. The bin packing problem can also be seen as a special case of the cutting stock problem . When the number of bins is restricted to 1 and each item is characterised by both...

Den Talk Den is a small scripting language created for XXIIVV, and the successor to Mute . It is meant for optimal readability and simplicity. Similarly to Mute, there is only one syntax, for conditions, objects, functions, etc.. For example, a variable is just a function that returns a value. A return, in Den, uses the colon character. You can think of it like, index = value, like the setter [index:value]. index : value An if/else system is simply a function with cases. The following example will return 20, if a is not equal to 10. isEqual a b ? = a b : 1 : 0 Every function must exit, or else it runs itself into a loop. The following example shows an incrementation loop that exits once loop has equaled 10. loop value ? = value 10 : value + value 1 The following object is initialized with variables a and b, followed with the method, divided with a pipe. ob...

English French German Italian Polish Portuguese (Brazil) Japanese header menu Home Latest news Upcoming events About Features Screenshots History Make a donation WeeChat.org Documentation Docs (stable) Docs (devel) FAQ (English) API (English) Download Stable version Dev version Debian repositories Security issues Scripts Browse scripts Add script Update script Pending scripts Unofficial scripts Dev Roadmap Statistics Support Devel blog Repositories end of menu page content Scripts Add script Update script Pending scripts Unofficial scripts Warning: these scripts are written by external contributors, therefore WeeChat developers are NOT RESPONSIBLE for problems caused by one of these scripts. You could experience problems like memory leaks, slowdowns, or even security problems . You are warned! Display scripts for old API (≤...