沧海一粟

You might have this need when just initializing a Git repository. I tried rebase -i HEAD^^ before and got an error. Today I finally found the correct way.

1

git rebase -i --root

Then change the pick of the second commit to fixup, save and exit.

Reference:
Combine the first two commits of a Git repository?

刚初始化一个Git仓库的时候可能会有这个需求。之前尝试用rebase -i HEAD^^，报错。今天终于找到了正确的方法。

1

git rebase -i --root

然后把第二个commit的pick改成fixup，保存退出即可。

参考来源：
Combine the first two commits of a Git repository?

Preparing to re-watch the MCU in chronological order of release date and recording it here. It will include all movies and TV series. In addition to Marvel’s own productions, it will also include SONY and FOX productions. Unauthorized ones are not considered. Some listed here are too ancient, hard to find sources, and have no subtitles, so I probably won’t watch them.
(Universal & Lionsgate are also considered)
(Finish the movies and TV series first, then plan for animation, then comics…)
(Then watch DC Universe?)

准备重新按照时间线看一遍 MCU，记录一下。会包含所有的电影和电视剧。除了漫威自己拍的，还会包含 SONY 和 FOX 的。没有授权的不在考虑范围内，这里列出来的有些太远古了，片源不好找，也没有字幕，可能就不会看了。
（环球&狮门也考虑一下）
（先把影视作品补完，然后的计划是动画，再然后是漫画……）
（然后再看 DC 宇宙？）

如果你开发微信小程序遇到了这个问题。先看下是不是和我情况一样。 Mac下使用nvm安装的Nodejs。 解决方法：

which node

先获取当前Nodejs的路径

ln -s /Users/#{username}/.nvm/versions/node/#{nodeVersion}/bin/npm /usr/local/bin/npm
ln -s /Users/#{username}/.nvm/versions/node/#{nodeVersion}/bin/node /usr/local/bin/node

If you encounter this problem when developing WeChat Mini Programs. First check if it’s the same situation as mine. Using Nodejs installed by nvm on Mac. Solution:

which node

First get the current Nodejs path

ln -s /Users/#{username}/.nvm/versions/node/#{nodeVersion}/bin/npm /usr/local/bin/npm
ln -s /Users/#{username}/.nvm/versions/node/#{nodeVersion}/bin/node /usr/local/bin/node

Use babel-preset-env together with browserslist.

使用babel-preset-env 同时配套使用browserslist

链接： https://gist.githubusercontent.com/tyrchen/32c50aadca48aee3da10a77a18479517/raw/3aa07629e61239cd26cf514584c949a98aa38d67/movies.csv 按照rank排序，取前topK

/**
 * 
 * @param {*} data 获取到的数据
 * @param {*} num 取top num个
 */
let top = (data, num) => {
    let res = [];
    let dataArr = data.split('\n');
    let dataLength = dataArr.length;

    for (let i = 0; i < dataLength; i++) {
        // 处理脏数据
        // example: "27, most popular",127.6053254325764,6.03051434574081
        if (dataArr[i].match('"')) {
            dataArr[i] = dataArr[i].replace(/".+"/, i);
        }

        dataArr[i] = dataArr[i].split(',');

        dataArr[i][2] = parseFloat(dataArr[i][2]);

        // 每次循环的时候进行一次rank从小到大的排序
        res.sort((a, b) => {
            return a[2] - b[2];
        });

        // 首先把数据填满到num个
        if (i > 0 && res.length < num) {
            res.push(dataArr[i]);
        }

        // 如果比数组中rank最小的还要大，就替换res中rank最小的
        if (res.length === num && dataArr[i][2] > res[0][2]) {
            res[0] = dataArr[i];
        }
    }
    console.log(res);
}

top(data, 20);

这里的做法利用了Array.sort的函数。 现在回想一下，好像不太对。直接sort排序，取一下前10不就可以了么。应该正常写一个快排。脏数据的处理，还差一个10e-1这种。(parseFloat好像也会给处理掉) 总结一下，要改进的问题。 1.写一个request请求，拿到原始数据。 2.使用快排重写 3.尝试是否能用js写一个Java的PriorityQueue

Link: https://gist.githubusercontent.com/tyrchen/32c50aadca48aee3da10a77a18479517/raw/3aa07629e61239cd26cf514584c949a98aa38d67/movies.csv Sort by rank, take top K

/**
 * 
 * @param {*} data Fetched data
 * @param {*} num Take top num items
 */
let top = (data, num) => {
    let res = [];
    let dataArr = data.split('\n');
    let dataLength = dataArr.length;

    for (let i = 0; i < dataLength; i++) {
        // Handle dirty data
        // example: "27, most popular",127.6053254325764,6.03051434574081
        if (dataArr[i].match('"')) {
            dataArr[i] = dataArr[i].replace(/".+"/, i);
        }

        dataArr[i] = dataArr[i].split(',');

        dataArr[i][2] = parseFloat(dataArr[i][2]);

        // Perform a sort by rank from small to large in each loop
        res.sort((a, b) => {
            return a[2] - b[2];
        });

        // First fill the data up to num items
        if (i > 0 && res.length < num) {
            res.push(dataArr[i]);
        }

        // If larger than the smallest rank in the array, replace the smallest rank in res
        if (res.length === num && dataArr[i][2] > res[0][2]) {
            res[0] = dataArr[i];
        }
    }
    console.log(res);
}

top(data, 20);

The approach here used the Array.sort function. Now thinking back, it seems not quite right. Directly sorting and taking the top 10 would be enough. Should normally write a Quick Sort. For dirty data handling, things like 10e-1 are still missing. (parseFloat seems to handle it too) Summary of improvements needed: 1. Write a request to get raw data. 2. Rewrite with Quick Sort. 3. Try to write a Java PriorityQueue in JS.