• Ruby 2.7.0 Released at 2019年12月27日

    汉语大师

    来看看 erlang 真正的 pattern m 吧

  • 有测试就好了 加油!

  • 北京 ruby 活动么

  • no test...

  • 流汗。。

  • function asc2rb(asc) {
      let rb = rblib;
      let prevfun = "";
      let curlvl = 0;
      let strayvar = 0;
      let lambdaList = [];
      let methodIndex = 0;
      asc = lowerAllPinYinAndMakeItGlobal(asc);
      // console.log("START!",asc)
      function getval(x) {
        if (!x) return "";
        if (x[0] == "ans") {
          strayvar = 0;
          return currTmpVar();
        }
        if (x[0] == "iden") return rename(x[1]);
        if (x[1] == undefined) return "nil";
        return x[1];
      }
      for (let i = 0; i < asc.length; i++) {
        let a = asc[i];
        if (a.args) console.log(a.args, a, "+++++++=======++++_____");
        if (a.op == "var") {
          for (let j = 0; j < a.count; j++) {
            if (a.values[j] == undefined) {
              a.values[j] = [];
            }
            let name = a.names[j];
            if (a.type == "fun") {
              prevfun = name;
              continue;
            }
            let value = getval(a.values[j]);
            if (name == undefined) {
              name = nextTmpVar();
              strayvar++;
            }
            if ([undefined, "nil"].includes(value)) {
              if (a.type == "arr") {
                value = "Ctnr.new";
              } else if (a.type == "num") {
                value = "0";
              } else if (a.type == "str") {
                value = `""`;
              } else if (a.type == "bol") {
                value = "false";
              }
            }
            rb += "\t".repeat(curlvl);
            rb += `${name}=${value}\n`;
          }
        } else if (a.op == "print") {
          rb += "\t".repeat(curlvl);
          rb += `p([`;
          for (let j = 0; j < strayvar; j++) {
            rb += `${prevTmpVar(strayvar - j)}.to_s`;
            if (j != strayvar - 1) {
              rb += ",";
            }
          }
          rb += "].join)\n";
          strayvar = 0;
        } else if (a.op == "fun") {
          rb += "\t".repeat(curlvl);
          let argsStr = a.args.map(arg => arg.name).join(",");
          if (methodIndex == 0) {
            rb += `def ${prevfun}(${argsStr})`;
          } else {
            lambdaList.push(prevfun);
            rb += `${prevfun} = proc {|${argsStr}|`;
          }
          methodIndex++;
        } else if (a.op == "funbody") {
          rb += "\t".repeat(curlvl);
          if (asc[i - 1].op != "fun") {
            if (methodIndex == 0) {
              rb += `def ${prevfun}()`;
            } else {
              lambdaList.push(prevfun);
              rb += `${prevfun} = proc {|_|`;
            }
            methodIndex++;
          }
          rb += "\n";
          curlvl++;
        } else if (a.op == "funend") {
          curlvl--;
          methodIndex--;
          if (methodIndex == 0) {
            rb += `${"\t".repeat(curlvl)}end\n`;
          } else {
            rb += `${"\t".repeat(curlvl)}}`;
          }
          rb += "\n";
        } else if (a.op == "end") {
          curlvl--;
          rb += `${"\t".repeat(curlvl)}end \n`;
        } else if (a.op == "if") {
          rb += "\t".repeat(curlvl);
          rb += "if ";
          let j = 0;
          while (j < a.test.length) {
            if (a.test[j][0] == "cmp") {
              rb += a.test[j][1];
            } else if (a.test[j][0] == "ctnr") {
              if (a.test[j][1] == "subs") {
                if (a.test[j + 1][1] == "rest") {
                  rb += ".slice(1)";
                } else {
                  if (a.test[j + 1][0] == "lit") {
                    rb += "[" + a.test[j + 1][1] + "]";
                  } else {
                    rb += "[" + a.test[j + 1][1] + "-1]";
                  }
                }
                j++;
              } else if (a.test[j][1] == "len") {
                rb += ".length";
              }
            } else {
              rb += a.test[j][1];
            }
            j++;
          }
          rb += "\n";
          curlvl++;
        } else if (a.op == "else") {
          rb += "\t".repeat(curlvl - 1);
          rb += "else\n";
        } else if (a.op == "return") {
          rb += "\t".repeat(curlvl);
          rb += `return ${getval(a.value)}\n`;
        } else if (a.op.startsWith("op")) {
          rb += "\t".repeat(curlvl);
          let lhs = getval(a.lhs);
          let rhs = getval(a.rhs);
    
          let op = a.op.slice(2);
          if (op in lop) {
            op = lop[op];
          }
          rb += `${nextTmpVar()}=${lhs}${op}${rhs}\n`;
          strayvar++;
        } else if (a.op == "name") {
          for (let j = 0; j < a.names.length; j++) {
            rb += "\t".repeat(curlvl);
            rb += `${a.names[j]}=${prevTmpVar(strayvar - j)}\n`;
          }
          strayvar -= a.names.length;
        } else if (a.op == "call") {
          rb += "\t".repeat(curlvl);
          let functionCallStr = `${a.fun}(${a.args.map(x => getval(x)).join(",")})`;
          if (lambdaList.includes(a.fun)) {
            functionCallStr = `${a.fun}.call(${a.args
              .map(x => getval(x))
              .join(",")})`;
          }
          rb += `${nextTmpVar()}=${functionCallStr}\n`;
          strayvar++;
        } else if (a.op == "subscript") {
          rb += "\t".repeat(curlvl);
          let idx = getval(a.value);
          if (idx == "rest") {
            rb += `${nextTmpVar()}=${a.container}.slice(1)\n`;
            strayvar++;
          } else {
            rb += `${nextTmpVar()}=${a.container}[${idx}${
              a.value[0] == "lit" ? "" : "-1"
            }]\n`;
            strayvar++;
          }
        } else if (a.op == "cat") {
          rb += "\t".repeat(curlvl);
          rb +=
            `${nextTmpVar()}=${a.containers[0]}.concat(` +
            a.containers.slice(1).join(").concat(") +
            ")\n";
          strayvar++;
        } else if (a.op == "push") {
          rb += "\t".repeat(curlvl);
          rb += `${a.container}.push(${a.values.map(x => getval(x)).join(",")})\n`;
        } else if (a.op == "for") {
          rb += "\t".repeat(curlvl);
          rb += `${a.container}.each do |${a.iterator.toLowerCase()}|\n`;
          curlvl++;
        } else if (a.op == "whiletrue") {
          rb += "\t".repeat(curlvl);
          rb += "while true do\n";
          curlvl++;
        } else if (a.op == "whilen") {
          rb += "\t".repeat(curlvl);
          let v = randVar();
          rb += `${getval(a.value)}.times do |${v}|\n`;
          curlvl++;
        } else if (a.op == "break") {
          rb += "\t".repeat(curlvl);
          rb += "break\n";
        } else if (a.op == "not") {
          rb += "\t".repeat(curlvl);
          let v = getval(a.value);
          rb += `${nextTmpVar()}=!${v}\n`;
          strayvar++;
        } else if (a.op == "reassign") {
          rb += "\t".repeat(curlvl);
          let rhs = getval(a.rhs);
          let lhs = getval(a.lhs);
          if (a.lhssubs) {
            lhs += `[${a.lhssubs[1]}${a.lhssubs[0] == "lit" ? "" : "-1"}]`;
          }
          rb += `${lhs}=${rhs}\n`;
        } else if (a.op == "discard") {
          strayvar = 0;
        } else if (a.op == "length") {
          rb += `${nextTmpVar()}=${a.container}.length;`;
          strayvar++;
        } else if (a.op == "comment") {
          rb += "\t".repeat(curlvl);
          rb += `# ${getval(a.value)}\n`;
          rb += "\t".repeat(curlvl);
        } else {
          // console.log(a.op)
        }
      }
      return rb;
    }
    
    
  • 说说 Rails 的套娃缓存机制 at 2019年12月17日

    论坛新人值得一看的,Ruby China 上的经典讨论贴子

  • girl?

  • Dijkstra 是对的?

  • 住宿 心水

  • 他们的本质是?

  • 实现了 flat map,就是 monad

  • mock 就是造假数据的?

  • 野路子?

  • Ruby 2.7 的新功能 at 2019年12月06日

    Elixir 的 Pattern Matching 还不是合一

  • 妹妹声音好温暖

  • C 语言精华在头文件

  • 虚拟大学园??

  • 自拍

  • 么么哒?

  • 问题也是一头雾水

  • 直播 (中) -- 核心流程梳理 at 2019年11月18日

    本质上是在打破自然界光线、声音传播的绝对性约束~~~~~

  • 编程语言大爆炸 at 2019年11月04日

  • 安排上,学校很多免费场地

  • 可以 hack

  • your linkedin?

  • Conway's Game of Life 有很多外国人上班看这个摸鱼。。。。

  • 感谢 Ekohe

  • ShowMeBug 核心技术内幕 at 2019年10月29日

    并发上的优势是啥