$300 in Free Credit for Your Google Cloud Projects
Build, test, and explore on Google Cloud with $300 in free credit. No hidden charges. No surprise bills.
Launch your next project with $300 in free Google Cloud credit—no hidden charges. Test, build, and deploy without risk. Use your credit across the Google Cloud platform to find what works best for your needs. After your credits are used, continue building with free monthly usage products. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Cut Data Warehouse Costs up to 54% with BigQuery
Migrate from Snowflake, Databricks, or Redshift with free migration tools. Exabyte scale without the Exabyte price.
BigQuery delivers up to 54% lower TCO than cloud alternatives. Migrate from legacy or competing warehouses using free BigQuery Migration Service with automated SQL translation. Get serverless scale with no infrastructure to manage, compressed storage, and flexible pricing—pay per query or commit for deeper discounts. New customers get $300 in free credit.
UglifyJS is a JavaScript compressor/minifier written in JavaScript. It also contains tools that allow one to automate working with JavaScript code. A parser which produces an abstract syntax tree (AST) from JavaScript code. A codegenerator which outputs JavaScript code from an AST, also providing the option to get a source map. A compressor (optimizer). it uses the transformer API to optimize an AST into a smaller one. A mangler, reduce names of local variables to (usually) single-letters. ...
Implementation of the LZW algorithm in C#, adhering to the built-in System.IO.Compression.
The algorithm and code is much improved, compared to projects like SharpLZW.
The LZW algorithm is for arbitrary lossless data compression and are noticeable for simplicity and low (compared to others) memory consumption. Making it interesting for eg. embedded use.
There're many other LZW implementations out there. This one is focused on KISS and C#.
[2014-10-31] This project is obsolete, for latest version (6.1.3) see GitHub https://github.com/digital-preservation/droid (source) and http://www.nationalarchives.gov.uk/information-management/manage-information/preserving-digital-records/droid/ (binary)
DROID (Digital Record Object Identification) is an automatic file format identification tool. It is the first in a planned series of tools developed by The National Archives under the umbrella of its PRONOM technical registry service.
[2013-01-24] The binary download of the latest version of DROID has now been moved to The National Archives website: http://www.nationalarchives.gov.uk/information-management/projects-and-work/droid.htm
The source code for the latest version of DROID remains available via Github: http://digital-preservation.github.com/droid/
[2012-09-07] DROID 6.1 has been released. ...
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
ctsplit is a program designed to split a large binary file into smaller byte sized pieces. Included with this project will be source code, linux binaries, windows binaries, User interface (using QT), and documentation.
Languages: C++ and QT