Permalink
Browse files

Working heading rendering

  • Loading branch information...
1 parent 39b2471 commit 9d239600d0f4062d1c38a7bf9cf4dbff24a1b540 @runemadsen committed Sep 23, 2011
Showing with 75 additions and 2 deletions.
  1. BIN .DS_Store
  2. +1 −1 .rvmrc
  3. +14 −0 Gemfile.lock
  4. +7 −0 application.rb
  5. +1 −1 config.ru
  6. +7 −0 config.yml
  7. +19 −0 parse.rb
  8. +25 −0 public/test.asciidoc
  9. +1 −0 views/parse.erb
View
Binary file not shown.
View
@@ -1 +1 @@
-rvm ree@magicbook --create
+rvm 1.9.2@magicbook --create
View
@@ -0,0 +1,14 @@
+GEM
+ remote: http://rubygems.org/
+ specs:
+ rack (1.3.3)
+ sinatra (1.2.6)
+ rack (~> 1.1)
+ tilt (>= 1.2.2, < 2.0)
+ tilt (1.3.3)
+
+PLATFORMS
+ ruby
+
+DEPENDENCIES
+ sinatra
View
@@ -1,12 +1,19 @@
require 'rubygems'
require 'bundler'
Bundler.require
+require './parse'
+require 'yaml'
class Application < Sinatra::Base
get '/' do
erb :front
end
+
+ get '/parse' do
+ @parser = Parse.new(open("public/test.asciidoc").read)
+ erb :parse
+ end
not_found do
erb :notfound
View
@@ -1,2 +1,2 @@
-require 'application.rb'
+require './application.rb'
run Application
View
@@ -0,0 +1,7 @@
+titles:
+ level0: !ruby/regexp '/^= +(?<title>[\S].*?)( +=)?$/'
+ level1: !ruby/regexp '/^== +(?<title>[\S].*?)( +==)?$/'
+ level2: !ruby/regexp '/^=== +(?<title>[\S].*?)( +===)?$/'
+ level3: !ruby/regexp '/^==== +(?<title>[\S].*?)( +====)?$/'
+ level4: !ruby/regexp '/^===== +(?<title>[\S].*?)( +=====)?$/'
+ blocktitle: !ruby/regexp '/^\.(?<title>([^.\s].*)|(\.[^.\s].*))$/'
View
@@ -0,0 +1,19 @@
+class Parse
+
+ attr_accessor :parsed_content, :config
+
+ def initialize(content)
+ @config = YAML::load(open("config.yml").read)
+ @parsed_content = content
+ parse_titles
+ end
+
+ private
+
+ def parse_titles
+ @config["titles"].each do |k,v|
+ @parsed_content.gsub!(v, '<h1>\k<title></h1>')
+ end
+ end
+
+end
View
@@ -0,0 +1,25 @@
+Chapter 6. Autonomous Agents
+=============================
+
+[quote]
+“This is an exercise in fictional science, or science fiction, if you like that better.”
+ —Valentino Braitenberg
+
+
+== 6.1 Forces from within
+
+=== 6.1.0 Rune Test
+
+Believe it or not, there is a purpose. Well, at least there’s a purpose for the first five chapters of this book. We could stop right here; after all, we’ve looked at several different ways of modeling motion and simulating physics. Angry Birds, here we come!
+
+Still, let’s think for a moment. Why are we here? The _nature_ of code, right? What have we been designing so far? Inanimate objects. Lifeless shapes sitting on our screens that flop around when affected by forces in their environment. What if we could breathe life into those shapes? What if those shapes could live by their own rules? Can shapes have hopes and dreams and fears? This is what we are here in this chapter to do—develop _autonomous agents_.
+
+The term *_autonomous agent_* generally refers to an entity that makes its own choices about how to act in its environment without any influence from a leader or global plan. For us, “acting” will mean moving. This addition is a significant conceptual leap. Instead of a box sitting on a boundary waiting to be pushed by another falling box, we are now going to design a box that has the ability and “desire” to leap out of the way of that other falling box, if it so chooses. While the concept of forces that come from within is a major shift in our design thinking, our code base will barely change, as these desires and actions are simply that—_forces_.
+
+Here are three key components of autonomous agents that we’ll want to keep in mind as we build our examples.
+
+- *An autonomous agent has a _limited_ ability to perceive environment.* It makes sense that a living, breathing being should have an awareness of its environment. What does this mean for us, however? As we look at examples in this chapter, we will point out programming techniques for allowing objects to store references to other objects and therefore “perceive” their environment. It’s also crucial that we consider the word *_limited here_*. Are we designing a all-knowing rectangle that flies around a Processing window aware of everything else in that window? Or are we creating a shape that can only examine any other object within 15 pixels of itself? - *_Of course, there is no right answer to this question; it all depends._* We’ll explore some possibilities as we move forward. For a simulation to feel more “natural,” however, limitations are a good thing. An insect, for example, may only be aware of the sights and smells that immediately surround it? For a real-world creature, we could study the exact science of these limitations. Luckily for us, we can just make stuff up and try it out.
+- *An autonomous agent processes the information from its environment and calculates an action.* This will be the easy part for us, as the action is a force. The environment might tell the agent that there’s a big scary-looking shark swimming right at it, and the action will be a powerful force in the opposite direction.
+- *An autonomous agent has no leader.* This third principle is something we care a little less about. After all, if you are designing a system where it makes sense to have a leader barking commands at various entities, then that’s what you’ll want to implement. Nevertheless, many of these examples will have no leader for an important reason. As we get to the end of this chapter and examine group behaviors, we will look at designing collections of autonomous agents that exhibit the properties of complex systems— intelligent and structured group dynamics that emerge not from a leader, but from the local interactions of the elements themselves.
+
+In the late 1980s, computer scientist Craig Reynolds developed algorithmic steering behaviors for animated characters. These behaviors allowed individual elements to navigate their digital environments in a “lifelike” manner with strategies for fleeing, wandering, arriving, pursuing, evading, etc. Used in the case of a single autonomous agent, these behaviors are fairly simple to understand and implement. In addition, by building a system of multiple characters that steer themselves according to simple locally based rules, surprising levels of complexity emerge. The most famous example is Reynolds’s “boids” model for “flocking/swarming” behavior.
View
@@ -0,0 +1 @@
+<%= @parser.parsed_content %>

0 comments on commit 9d23960

Please sign in to comment.