Search Results for "large files"

A cat(1) clone with syntax highlighting and Git integration. By default, bat pipes its own output to a pager (e.g. less) if the output is too large for one screen. If you would rather bat work like cat all the time (never page output), you can set --paging=never as an option, either on the command line or in your configuration file. If you intend to alias cat to bat in your shell configuration, you can use alias cat='bat --paging=never' to preserve the default behavior. Even with a pager set, you can still use bat to concatenate files. ...

Pyright is a fast type checker meant for large Python source bases. It can run in a “watch” mode and performs fast incremental updates when files are modified. Pyright supports configuration files that provide granular control over settings. Different “execution environments” can be associated with subdirectories within a source base. Each environment can specify different module search paths, python language versions, and platform targets.

pytype is a static type analyzer that checks and infers types for Python code without executing it, catching errors at “compile time” and generating actionable diagnostics. It grew alongside Python typing at Google and can understand both inline annotations and unannotated code via powerful inference. The tool consumes stub files (.pyi) for the standard library and third-party packages (from typeshed and its own built-ins), enabling accurate checks even in large, mixed-quality codebases. Developers can run pytype locally or wire it into CI to prevent regressions and track tightening type discipline over time. Because pytype infers types, it’s useful during gradual typing, surfacing mismatches, missing attributes, or unsafe unions before runtime. ...

Sloc, Cloc and Code: scc is a very fast accurate code counter with complexity calculations and COCOMO estimates written in pure Go. The tool is similar to cloc, sloccount and tokei. For counting the lines of code, blank lines, comment lines, and physical lines of source code in many programming languages. The goal is to be the fastest code counter possible, but also perform COCOMO calculations like sloccount, estimate code complexity similar to cyclomatic complexity calculators, and produce...

Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. ...

The CodeXCavator is a tool for source code indexing, tagging, and fast full-text search. It consists of two applications: The indexer is a configurable tool for creating an index for large amounts of source code or plain text files. The searcher is a GUI based tool for fast full text search within previously created indexes. The toolchain also supports code tagging, i.e. you can include special tags within comments inside the source code. These are indexed separately and can be associated with any kind of URL, which can be opened from the searcher tool itself. ...

...Rift currently supports C/C++ ,Python and Ruby languages.Rift features Powerfull Compilers & interpreters and gives you the freedom to work with IDE of your choice. Rift is also supplemented with a powerful testing feature for very large input/output Files and lets you analyse the time complexity of your code. It tests the correctness of the code in accordance with the input and output(Expected) file provided by the user.It is a perfect weapon for coders who prefer Speed and Performance Rift V2.0 Build(2.0.8.22) include some major changes: 1). Multilanguage support, included Python and Ruby. ...

[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.