我试图在Prolog中实现斐波那契序列的递归版本。下面是代码: fib(0,F) :- F is 0.
fib(1,F) :- F is 1.
fib(N,F) :- N > 1,
AA is (N - 1),
BB is (N - 2),
fib(AA,CC),
fib(BB,DD),
RR is (CC + DD),
F == RR,
F is RR.
问题是,它不符合我
if (!window.x) {
x = {};
}
x.Selector = {};
x.Selector.getSelected = function() {
if (window.getSelection) {
t = window.getSelection();
} else if (document.g