In computing science and informatics, nesting[1] is where information is organized in layers, or where objects contain other similar objects. It almost always refers to self-similar or recursive structures in some sense.
Nesting can mean:
In a spreadsheet functions can be nested one into another, making complex formulas. The function wizard of the OpenOffice.org Calc application allows to navigate through multiple levels of nesting, letting the user to edit (and possibly correct) each one of them separately.
For example:
=IF(SUM(C8:G8)=0,"Y","N")
In this Microsoft Excel formula, the SUM function is nested inside the IF function. First, the formula calculates the sum of the numbers in the cells from C8 to G8. It then decides whether the sum is 0, and it displays the letter Y if the sum is 0, and the letter N if it is not.
Naturally, to allow the mathematical resolution of these chained (or better: nested) formulas, the inner expressions must be previously evaluated, and this outward direction is essential because the results that the internal functions return are temporarily used as entry data for the external ones.
Due to the potential accumulation of parentheses in only one code line, editing and error detecting (or debugging) can become somehow awkward. That is why modern programming environments -as well as spreadsheet programs- highlight in bold type the pair corresponding to the current editing position. The (automatic) balancing control of the opening and closing parenthesis is known as brace match checking.
In structured programming languages, nesting is related to the enclosing of control structures one into another, usually indicated through different indentation levels within the source code, as it is shown in this simple BASIC function:
sPath="C:\Test.dsv" if FileExists(sPath) then open sPath for input as #1 do while not EOF(1) line input #1, sLine if sCode=left(sLine, 3) then 'Action(s) to be carried out End if loop close #1 End if LookupCode=iReturnValueend function
In this small and simple example, the conditional block “if... then... end if” is nested inside the “do while... loop” one.
Some languages such as Pascal and Ada have no restrictions on declarations depending on the nesting level, allowing precisely nested subprograms or even nested packages (Ada). Here is an example of both (simplified from a real case):
type Buffer_type is array(Integer range <>) of Integer;
procedure Decompress(compressed : in Buffer_type; decompressed: out Buffer_type) is -- Here are the legacy sources, translated: package X_Globals is index_in, index_out: Integer; -- *** ^ These variables are local to Decompress. -- *** Now Decompress is task-safe. end X_Globals; -- Methods 1,2,3,... (specifications) package X_Method_1 is procedure Decompress_1; end X_Method_1; -- Methods 1,2,3,... (code) package body X_Method_1 is use X_Globals; procedure Decompress_1 is begin index_in:= compressed'First; -- Here, the decompression code, method 1 end Decompress_1; end X_Method_1; -- End of the legacy sources begin X_Method_1.Decompress_1; end Decompress;
test_in, test_out: Buffer_type(1..10_000);
begin Decompress(test_in, test_out);end Nesting_example_1;
Nested data structures are also commonly encountered in programming.
In the functional programming languages, such as Lisp, a list data structure exists as does a simpler atom data structure.[2]