Site updated: 2016-01-03 19:46:41

meetwudi · Jan 3, 2016 · eddbf6e · eddbf6e
1 parent 3511f0d
commit eddbf6e
Show file tree

Hide file tree

Showing 3 changed files with 16 additions and 4 deletions.
diff --git a/2016/01/03/iterative-recursive-process/index.html b/2016/01/03/iterative-recursive-process/index.html
@@ -20,7 +20,7 @@
 <meta property="og:description" content="在程序设计的世界里面有两种很基本的设计模式，那就是迭代（iterative）和递归（recursive）。这两种模式之间存在着很强的一致性和对称性。">
 <meta property="og:image" content="http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/1.jpg">
 <meta property="og:image" content="http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/2.jpg">
-<meta property="og:updated_time" content="2016-01-03T11:44:49.000Z">
+<meta property="og:updated_time" content="2016-01-03T11:46:27.000Z">
 <meta name="twitter:card" content="summary">
 <meta name="twitter:title" content="迭代、递归与Tail Call Optimization">
 <meta name="twitter:description" content="在程序设计的世界里面有两种很基本的设计模式，那就是迭代（iterative）和递归（recursive）。这两种模式之间存在着很强的一致性和对称性。">
@@ -31,6 +31,9 @@
         <meta property="og:image" content="http://www.gravatar.com/avatar/1380392c951c5d3edc96146b1d5b877b?s=640"/>
 
 
+        <meta property="og:image" content="/2016/01/03/iterative-recursive-process/2.jpg"/>
+        <meta class="swiftype" name="image" data-type="enum" content="http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/2.jpg" />
+
 
 
 

diff --git a/atom.xml b/atom.xml
@@ -4,7 +4,7 @@
   <subtitle><![CDATA[创造是我最大的兴趣]]></subtitle>
   <link href="/atom.xml" rel="self"/>
   <link href="http://blog.leapoahead.com/"/>
-  <updated>2016-01-03T11:44:49.000Z</updated>
+  <updated>2016-01-03T11:46:27.000Z</updated>
   <id>http://blog.leapoahead.com/</id>
 
   <author>
@@ -19,7 +19,7 @@
     <link href="http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/"/>
     <id>http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/</id>
     <published>2016-01-03T09:59:13.000Z</published>
-    <updated>2016-01-03T11:44:49.000Z</updated>
+    <updated>2016-01-03T11:46:27.000Z</updated>
     <content type="html"><![CDATA[<p>在程序设计的世界里面有两种很基本的设计模式，那就是迭代（iterative）和递归（recursive）。这两种模式之间存在着很强的一致性和对称性。</p>
 <a id="more"></a>
 <p>现在让我来设计一段程序，计算<code>n!</code>，<strong>不能使用任何循环结构</strong>。我们把这个过程封装成一个函数<code>calc</code>，假设<code>n=4</code>，整个计算的<strong>过程（Process）</strong>是这样的。</p>

diff --git a/index.html b/index.html
@@ -170,8 +170,12 @@ <h1 class="header-title">
 <section class="postShorten-group main-content-wrap">
 
 
+
+
+
 
-                <article class="postShorten" itemscope itemType="http://schema.org/BlogPosting">
+
+            <article class="postShorten postShorten--thumbnailimg" itemscope itemType="http://schema.org/BlogPosting">
 
             <div class="postShorten-wrap">
                 <div class="postShorten-header">
@@ -209,6 +213,11 @@ <h1 class="postShorten-title" itemprop="headline">
                 </div>
             </div>
 
+                <div class="postShorten-thumbnailimg">
+                    <img alt="" itemprop="image" src="http://blog.leapoahead.com/2016/01/03/iterative-recursive-process/2.jpg"/>
+                </div>
+
+
         </article>