Check website stack from the terminal.
In fact I know there's already a pretty good Chrome extension called Wappalyzer, but I still wanna make a CLI tool for myself. There's 2 major reasons why:
OMMGGGGGGG
Based on these demands, I started working on fixing these issues.
$ npm install stacks-cli -g
Type the following command in your terminal:
$ stacks-cli
And the scripts will ask you:
? Which website stack do you wanna browse ?
Copy & Paste the URL of the website you want to analyze:
https://www.cloudflare.com/
Here's a screenshot of the result:
Examples
$ stacks-cli
Analyze URL via cli
$ stacks-cli <URL>
$ stacks-cli -u <URL>
Helpers
$ stacks-cli -h
Show current version
$ stacks-cli -v
Source code of this side project
$ stacks-cli -s
$ docker build -t stacks-cli .
$ docker run --rm -ti stacks-cli -h
$ docker run --rm -ti femtopixel/stacks-cli
MIT © WeiChiaChang
ROS-CLI源码 参考文章: 通过命令行工具使用阿里云资源编排服务 阿里云ROS帮助文档——命令行工具使用示例 源码下载:命令行工具源码地址 一、目录结构 aliyun-ros-cli-master --bin 执行文件 --ros --resources --ros_compl
配置 aws cli How to get exactly the account and environment information you need to manage your AWS account using just the AWS CLI 如何仅使用AWS CLI准确获取管理AWS账户所需的账户和环境信息 Installing the AWS CLI is actually qu
堆栈有时称为外部数据队列,但我们遵循常见用法并将其称为堆栈。 它是一块逻辑上在Rexx外部的内存块。 像push和queue这样的指令将数据放入堆栈,拉取和解析等指令从中提取数据。 排队的内置函数报告堆栈中有多少项。 我们来看一个堆栈的例子。 /* STACK: */ /* */ /* This program shows how to use the Rexx Stack as either
Stacks 2.0 Reference implementation of the Stacks blockchain in Rust. Stacks 2.0 is a layer-1 blockchain that connects to Bitcoin for security and enables decentralized apps and predictable smart cont
Jupyter Docker Stacks Jupyter Docker Stacks are a set of ready-to-run Docker imagescontaining Jupyter applications and interactive computing tools. Quick Start You can try a relatively recent build of
Awesome Stacks Deploy 80+ open-source web apps with one Docker command. Features Traefik compatibility Portainer compatibility No need to manage configuration files Distributed storage compatibility (
C++ Stack(堆栈) 是一个容器类的改编,为程序员提供了堆栈的全部功能,——也就是说实现了一个先进后出(FILO)的数据结构。 操作 比较和分配堆栈 empty() 堆栈为空则返回真 pop() 移除栈顶元素 push() 在栈顶增加元素 size() 返回栈中元素数目 top() 返回栈顶元素
操作语法: == <= >= < > != 所有的这些操作可以被用于堆栈. 相等指堆栈有相同的元素并有着相同的顺序。 empty语法: bool empty(); 如当前堆栈为空,empty() 函数 返回 true 否则返回false. pop语法: void pop(); pop() 函数移除堆栈中最顶层元素。相关主题: top