Tags

A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.
Npgsql is the .NET data provider for PostgreSQL. It allows any program developed for .NET framework to access a PostgreSQL database server. It is implemented in 100% C# code.

0 Questions

HtmlUnit is a "headless browser". Which means that there is no browser GUI and it does no rendering. Though it has a CSS and JS engine to simulate a real browser. Primary purpose is testing and information extraction.

0 Questions

xarray (formerly xray) is an open source library that provides a range of N-dimensional data structures.

0 Questions

Discord.py is an API wrapper of the Official Discord API written in Python. Tagging: Questions regarding the rewrite branch (v1.0) of discord.py should be tagged the following tags [python] + [discord] + [discord.py] + [discord.py-rewrite]. Only when using the rewrite branch (v1.0) of discord.py should the question be tagged with this tag (if you're not sure, do not use this tag).

0 Questions

Visual Studio Team Services and Team Foundation Server Release Management.

0 Questions

May refer to Linux init, an abbreviation of initialization - giving variables a "starting" value, or Python's __init__ class initiation method.

0 Questions

COM interop is the layer that allows .NET assemblies to communicate with standard COM objects and libraries.

0 Questions

Instruments usually refers to the performance analysis developer tool provided by Apple for Mac and iOS development.

0 Questions

The Facebook SDK for .NET helps developers build web, desktop, phone and Windows Store applications that integrate with Facebook.

0 Questions

A profile used by Apple for verifying code signing for an application.

0 Questions

Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra is a graph search algorithm that solves the single-source shortest path problem for a connected graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.

0 Questions