Resource Acquisition Is Initialization (RAII) is a common idiom used in C++ to manage the lifetime of resources, including memory allocations, file handles or database connections. In brief, every resource should be wrapped in an owning class, whose lifetime controls the lifetime of the resource.

msysGit was formerly the development environment to compile Git for Windows 1.0. It was never the actual Git for Windows package, and it is not current. Do not use this tag for general Git questions, use the git tag. Do not use this tag for Git for Windows specific questions, use the git-for-windows tag.

SubSonic is A Super High-fidelity Batman Utility Belt that works up your data access (using LINQ in 3.0), throws in some much-needed utility functions, and generally speeds along your development cycle.

deflate is a lossless data compression format, and also refers to implementations that compress to the deflate format. The deflate format was created by Phil Katz of PKWare for the PKZip (.zip) archive format. Public domain software provides deflate and inflate functionality in the gzip utility and the zlib library.

INET Framework for OMNeT++ to simulate network communications.

ClosedXML is a .NET library for reading, manipulating and writing Excel 2007+ (.xlsx, .xlsm) files.

This tag is to be used for rstudio-server, which provides a browser based interface for R / Rstudio running on a remote server. Note that this is different from accessing the Rstudio IDE directly via remote access.

Nim (formerly known as "Nimrod") is a statically typed, imperative programming language that tries to give the programmer ultimate power without compromises on runtime efficiency. This means it focuses on compile-time mechanisms in all their various forms.

PureScript is a functional language with strong, static types which compiles to JavaScript.

pygame object for representing images. Use this tag only if you are using the pygame library and not if you have a question about programming a game in python in general.

A DFA is a deterministic finite automaton, a simple model of computation. It is one way to model regular languages. Each DFA consists of a finite set of states and a transition function between those states describing how the state of the machine changes in response to new input. DFAs are closely related to regular expressions in the sense that they can be converted into each other. Thus, DFAs are often used to implement regular expression matchers.