Listing 7. A Fibonacci sequence in fib.hs.
清单7. fib . hs中的Fibonacci序列。
We first get the infinite Fibonacci sequence.
我们首先获得一个无穷的Fibonacci序列。
Each column corresponds to a Fibonacci number.
每一列对应一个斐波那契数。
Here the Fibonacci Outgrowth is represented.
这里体现了斐波纳契数列结果。
I am testing different Fibonacci patterns now.
现在我正在测试其它的斐波那契枝叶布局模式。
The font size also corresponds to a Fibonacci number.
字体的大小也对应于一个斐波那契数。
A trade. You get me a plane, I'll give you Fibonacci.
一个交易，你给我一架飞机，我给你Fibonacci。
Figure 4 shows the Fibonacci trace highlighted in vim.
图4显示了vim中加亮的Fibonacci跟踪。
You remember last time we were looking at Fibonacci.
你还记得上次我们在研究斐波那契数列吧。
Your first Erlang program, a recursive Fibonacci function.
第一个Erlang程序，一个递归的fibonacci函数。
Fibonacci kisses his three kids before he puts them to bed.
Fibonacci亲吻了他的3个孩子，把他们哄上床睡觉。
Why are there different Fibonacci patterns among trees?
为什么不同的树种中有不同的斐波那契布局模式存在？
He then applies this to the Fibonacci sequence generator.
他接下来将这个函数应用在斐波那契数列生成器上。
A Fibonacci design is best suited to blogs and magazine layouts.
斐波那契设计最适宜用于博客和杂志页面布局。
Sometimes it's just not possible. Consider a Fibonacci function.
不过，有时候这并不可能。
You can think of factorials in much the same way as Fibonacci sequences.
可以用与Fibonacci序列基本相同的方式对待阶乘。
The pattern was about 137 degrees and the Fibonacci sequence was 2/5.
这个布局的夹角约为137度而斐波那契分数为2/5。
A Fibonacci spiral, which is a close approximation of a golden spiral.
斐波那契螺旋是黄金螺旋线的近似表达。
The example he USES is a function that generates a Fibonacci sequence.
他当时使用的例子，就是用递归生成一个斐波那契数列。
The result is all of the Fibonacci Numbers less than 4 million and even.
结果得到的是所有小于400万且为偶数的fibonacci数。
The result -- the 16th element in the Fibonacci series -- is shown in Figure 2.
其结果 ——Fibonacci系列的第 16 个元素 ——如图 2 所示。
You can arrange the layout in different ways according to Fibonacci Numbers.
你可以根据斐波那契序列的数字来安排不同的页面布局方式。
As an example, let's profile the simple ACME Fibonacci Maker, fibonacci.php.
作为一个示例，我们来分析一下这个简单的ACME fibonacciMaker, fibonacci . php，如清单5所示。
Now that we have a good way to generate Fibonacci numbers, let's solve the problem.
我们已经具备了一种很好的生成Fibonacci数的方式，让我们来解决这个问题。
While counting his newborn rabbits, Fibonacci came up with a numerical sequence.
斐波那契提出了一个数字序列计数新生兔子。
I designed and built my own test model, copying the Fibonacci pattern of an oak tree.
模仿橡树的斐波那契布局模式，我设计并制作了自己的测试模型。
We prepared a sample PSD layout that is designed according to the Fibonacci sequence.
我们准备了遵照斐波那契序列原则设计的PSD格式版面设计示例。
The first time that fibonacci(35) was called, it took 106.857 milliseconds to execute.
第一次调用 fibonacci(35)时，执行的时间是 106.857毫秒。
The Fibonacci pattern allowed some solar panels to collect sunlight even if others were in shade.
即使在被遮挡的情况下，斐波那契布局模式让部分太阳能电池仍然能够收集到阳光。
This is probably why the Fibonacci pattern is found in deciduous trees living in higher latitudes.
这可能正是为什么斐波那契布局出现在高海拔落叶树种中。
应用推荐