-
1 держать себя в рамках
держать себя (держаться) в рамках (рамочках, границах) < приличия>keep within the bounds (limits) of propriety; observe the rules of propriety; mind one's manners; keep calm- Вагаршак! - негромко крикнула Люба. - Держись в рамочках! - Но разве Саинян умел держаться в рамочках, когда речь шла о деле? Разве он понимал, что такое "рамочки", когда сидит перед ним эдакая жирная размазня, вдруг сделавшаяся ему врагом? (Ю. Герман, Я отвечаю за всё) — 'Vagarshak,' Lyuba called out warningly. 'Mind your manners.' But was Vagarshak capable of 'minding his manners' when the matter concerned his work? Could the warning mean anything to him when he was confronted by a fat slug who had suddenly turned enemy?
Русско-английский фразеологический словарь > держать себя в рамках
См. также в других словарях:
Bounds checking — In computer programming, bounds checking is any method of detecting whether a variable is within some bounds before its use. It is particularly relevant to a variable used as an index into an array to ensure its value lies within the bounds of… … Wikipedia
Immanuel Kant — Kant redirects here. For other uses, see Kant (disambiguation). See also: Kant (surname) Immanuel Kant Immanuel Kant Full name Immanuel Kant Born 22 April 1724 … Wikipedia
Critique of Pure Reason — Part of a series on Immanuel … 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
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Stein's method — is a general method in probability theory to obtain bounds on the distance between two probability distributions with respect to a probability metric. It was introduced by Charles Stein, who first published it 1972,[1] to obtain a bound between… … Wikipedia
Beer die — is a drinking game. Standard rules call for four players, a die, table, four cups, and beer. Unlike most beer based games, drinking and scoring are unrelated.OriginsThere is no consensus on where the sport originated as numerous colleges and… … Wikipedia
UNITED STATES OF AMERICA — UNITED STATES OF AMERICA, country in N. America. This article is arranged according to the following outline: introduction Colonial Era, 1654–1776 Early National Period, 1776–1820 German Jewish Period, 1820–1880 East European Jewish Period,… … Encyclopedia of Judaism
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Parables — • A comparison, or a parallel, by which one thing is used to illustrate another. Catholic Encyclopedia. Kevin Knight. 2006. Parables Parables … Catholic encyclopedia
