Command–query separation
Principle that every method should either be a command that performs an action, or a query that returns data to the caller, but not both; asking a question should not change the answer
Command–query separation (CQS) is a principle of imperative computer programming. It was devised by Bertrand Meyer as part of his pioneering work on the Eiffel programming language. It states that every method should either be a command that performs an action, or a query that returns data to the caller, but not both.
Nº Q3954590 ★★
Incomum · Saberes
Command–query separation
Principle that every method should either be a command that performs an action, or a query that returns data to the caller, but not both; asking a question should not change the answer
Command–query separation (CQS) is a principle of imperative computer programming. It was devised by Bertrand Meyer as part of his pioneering work on the Eiffel programming language. It states that every method should either be a command that performs an action, or a query that returns data to the caller, but not both.
Último preço
—
Preço mínimo
—
Mediana 7 d
—
Vendas 30 d
0
Faixa 30 d
—
Em circulação
0
Cotação
mediana
mín – máx
vendas
Sem vendas no período
Ver tabela
| Data | mediana | Mín | Máx | vendas |
|---|
Histórico de vendas
- Última venda
- —
- Média 30 d
- —
- Mínima 30 d
- —
- Máxima 30 d
- —
- Vendas 7 d
- 0
- Vendas 30 d
- 0
Ainda sem vendas.
Vendas anônimas: sem comprador nem vendedor. Os números contam só vendas entre jogadores.
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
Command–query separation (CQS) is a principle of imperative computer programming. It was devised by Bertrand Meyer as part of his pioneering work on the Eiffel programming language. It states that every method should either be a command that performs an action, or a query that returns data to the caller, but not both. In other words, asking a question should not change the answer. More formally, methods should return a value only if they are referentially transparent and hence possess no side effects.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Quadtree
Tree data structure in which each internal node has exactly four children
Nº Q934791 ★★
Sem ofertas
-
Linguagem de consulta
Nº Q845739 ★
Sem ofertas
-
C
Commit
Nº Q1115672 ★
Sem ofertas
-
P
Princípio de Landauer
Nº Q657486 ★★
Sem ofertas
-
Programação imperativa
Nº Q275596 ★★★
Sem ofertas
-
Q
Question answering
Research area in computer science
Nº Q1074173 ★
Sem ofertas