npm package discovery and stats viewer.
[free text search, go nuts!]
pkg:[package-name]
@[username]
I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.
Hi, 👋, I’m Ryan Hefner and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.
As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.
If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.
I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.
This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏
next / express / next-routes
redux / react-redux / next-redux-wrapper / redux-thunk / redux-logger
babel-plugin-module-resolver / babel-plugin-styled-components
© 2024 – Pkg Stats / Ryan Hefner
- 54张牌里总有3162510组合的5张牌的信息,计算每组牌的排名后再查询赢的概率.
Downloads
8
node index 由于每组牌出现后,这组牌的每张牌的所有组合按道理说应该不会存在了,
应该要去掉那些不会存在的牌后在计算,
按这精确计算出来的与不去掉算出来的误差非常非常的小(总组合3162510),
还有计算去掉的也很耗时,所以就允许存在这个误差.
但有种情况需要手工的去掉,比如 [大王,2,3,5,10],这个的rank虽然不是第一,但出现这牌由于牛牛并且最大的也是大王,所以胜率也是100%(跟[大王,小王,K, K, K]一样)第一次运行由于需要计算排名大概需要30s的时间,数据大小大约100m, 如果有什么好的办法压缩/优化算法可以探讨下