tuc 1.2.0 Cut text (or bytes) where a delimiter matches, then keep the desired parts. The data is read from standard input. USAGE: tuc [FLAGS] [OPTIONS] FLAGS: -g, --greedy-delimiter Match consecutive delimiters as if it was one -p, --compress-delimiter Print only the first delimiter of a sequence -s, --only-delimited Print only lines containing the delimiter -V, --version Print version informatio
// By Rishabh Jain and Daniel Reiter Horn • Aug 04, 2020 Dropbox syncs petabytes of data every day across millions of desktop clients. It is vital that we constantly improve the sync experience for our users, to increase our users’ productivity in their everyday lives. We also constantly strive to better leverage our infrastructure, increasing Dropbox’s operational efficiency. Because the files th
Introduction Some part of me has always been fascinated with coercing code to run in weird places. I scratch this itch a lot with my security research projects. These often lead me to writing shellcode to run in kernels or embedded hardware, sometimes with the only way being through an existing bug. For those not familiar, shellcode is honestly hard to describe. I don’t know if there’s a very form
ClockBound allows you to generate and compare bounded timestamps that include accumulated error as reported from the local chronyd process. On every request, ClockBound uses two pieces of information: the current time and the associated absolute error range, which is also known as the clock error bound. This means that the “true” time of a ClockBound timestamp is within a set range. Using ClockBou
To get the licence for your open-source project, please fill out this form
Phantun is a project that obfuscated UDP packets into TCP connections. It aims to achieve maximum performance with minimum processing and encapsulation overhead. It is commonly used in environments where UDP is blocked/throttled but TCP is allowed through. Phantun simply converts a stream of UDP packets into obfuscated TCP stream packets. The TCP stack used by Phantun is designed to pass through m
below is an interactive tool to view and record historical system data. It has support for: information regarding hardware resource utilization viewing the cgroup hierarchy cgroup and process information pressure stall information (PSI) record mode to record system data replay mode to replay historical system data live mode to view live system data dump subcommand to report script-friendly informa
$ htmlq -h htmlq 0.4.0 Michael Maclean <michael@mgdm.net> Runs CSS selectors on HTML USAGE: htmlq [FLAGS] [OPTIONS] [--] [selector]... FLAGS: -B, --detect-base Try to detect the base URL from the <base> tag in the document. If not found, default to the value of --base, if supplied -h, --help Prints help information -w, --ignore-whitespace When printing text nodes, ignore those that consist entirel
It turns out that finite state machines are useful for things other than expressing computation. Finite state machines can also be used to compactly represent ordered sets or maps of strings that can be searched very quickly. In this article, I will teach you about finite state machines as a data structure for representing ordered sets and maps. This includes introducing an implementation written
Can be used to analyze memory leaks, see where exactly the memory is being consumed, identify temporary allocations and investigate excessive memory fragmentation Gathers every allocation and deallocation, along with full stack traces Can dynamically cull temporary allocations allowing you to profile over a long period of time Uses a custom, tailor-made stack unwinding implementation which makes i
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く