parameterized test

parameterized test
параметризованный тест

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Нужно решить контрольную?

Смотреть что такое "parameterized test" в других словарях:

  • Parameterized post-Newtonian formalism — Post Newtonian formalism is a calculational tool that expresses Einstein s (nonlinear) equations of gravity in terms of the lowest order deviations from Newton s theory. This allows approximations to Einstein s equations to be made in the case of …   Wikipedia

  • Test script — A test script in Software Testing is a set of instructions that will be performed on the System Under Test to test that the system functions as expected. These steps can be executed manually or automatically.There are various means for executing… …   Wikipedia

  • Uniformly most powerful test — In statistical hypothesis testing, a uniformly most powerful (UMP) test is a hypothesis test which has the greatest power 1 eta among all possible tests of a given size α . For example, according to the Neyman Pearson lemma, the likelihood ratio …   Wikipedia

  • Generics in Java — Generics are a facility of generic programming that was added to the Java programming language in 2004 as part of J2SE 5.0. They allow a type or method to operate on objects of various types while providing compile time type safety. [… …   Wikipedia

  • Unit testing — In computer programming, unit testing is a method by which individual units of source code are tested to determine if they are fit for use. A unit is the smallest testable part of an application. In procedural programming a unit may be an… …   Wikipedia

  • Tests of general relativity — General relativity Introduction Mathematical formulation Resources Fundamental concepts …   Wikipedia

  • General relativity — For a generally accessible and less technical introduction to the topic, see Introduction to general relativity. General relativity Introduction Mathematical formulation Resources …   Wikipedia

  • Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

  • Likelihood function — In statistics, a likelihood function (often simply the likelihood) is a function of the parameters of a statistical model, defined as follows: the likelihood of a set of parameter values given some observed outcomes is equal to the probability of …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • C Sharp syntax — The correct title of this article is C# syntax. The substitution or omission of the # sign is because of technical restrictions. Main article: C Sharp (programming language) This article describes the syntax of the C# programming language. The… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»