instance variables - définition. Qu'est-ce que instance variables
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Qu'est-ce (qui) est instance variables - définition

SIMPLE TYPE OF DATA DEDUPLICATION
Single Instance Store; Single instance store; Single Instance Storage; Single instance storage; Single instance; Single-instance; Singleinstance; Single instances; Single-instances; Singleinstances; Single instanced; Single-instanced; Singleinstanced; Single instance storing; Single-instance storing; Singleinstance storing; Single-instance store; Singleinstance store; Single instance stores; Single-instance stores; Singleinstance stores; Single instance stored; Single-instance stored; Singleinstance stored

instance variable         
VARIABLE IN AN OBJECT THAT IS DEFINED BY ITS CLASS
<programming> In object-oriented programming, one of the variables of a class template which may have a different value for each object of that class. Instance variables hold the state of an object. (1998-01-16)
free variable         
  • Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>
CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER
Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable
1. A variable referred to in a function, which is not an argument of the function. In lambda-calculus, x is a {bound variable} in the term M = x . T, and a free variable of T. We say x is bound in M and free in T. If T contains a subterm x . U then x is rebound in this term. This nested, inner binding of x is said to "shadow" the outer binding. Occurrences of x in U are free occurrences of the new x. Variables bound at the top level of a program are technically free variables within the terms to which they are bound but are often treated specially because they can be compiled as fixed addresses. Similarly, an identifier bound to a recursive function is also technically a free variable within its own body but is treated specially. A closed term is one containing no free variables. See also closure, lambda lifting, scope. 2. In logic, a variable which is not quantified (see quantifier).
bound variable         
  • Tree summarizing the syntax of the expression <math>\forall x\, ((\exists y\, A(x)) \vee B(z)) </math>
CLASSIFICATION OF VARIABLES IN A LOGIC FORMULA BASED ON WHETHER OR NOT THEY ARE INSIDE THE SCOPE OF A QUANTIFIER
Free variable; Bound variable; Variable binding operation; Variable-binding operation; Free variables; Bound variables; Unbound variable; Unbound variables; Variable-binding operator; Variable binding operator; Free and bound variables; Bound variable clash; Free and bound variable; Placeholder (computer programming); Free variables & bound variables; Free occurrence; Placeholder variable; Apparent variable
1. A bound variable or formal argument in a function definition is replaced by the actual argument when the function is applied. In the lambda abstraction x . M x is the bound variable. However, x is a free variable of the term M when M is considered on its own. M is the scope of the binding of x. 2. In logic a bound variable is a quantified variable. See quantifier.

Wikipédia

Single-instance storage

Single-instance storage (SIS) is a system's ability to take multiple copies of content and replace them by a single shared copy. It is a means to eliminate data duplication and to increase efficiency. SIS is frequently implemented in file systems, e-mail server software, data backup, and other storage-related computer software. Single-instance storage is a simple variant of data deduplication. While data deduplication may work at a segment or sub-block level, single-instance storage works at the whole-file level and eliminates redundant copies of entire files or e-mail messages.