+
Point of view
All features
class PYRAMID
Summary
top
Solving the problem of the Pyramid for small pyramid only.
This program uses the back-tracking method. Its goal is to try to fill a pyramid by making a subtraction between two successive columns and to take its absolute value. The result is put on the next line. Example: 
 6   14   15   3   13
   8    1   12  10
      7   11   2
        4    9
           5
See also pyramid2, which run faster than this first solution.
Direct parents
Insert list: ARGUMENTS
Overview
top
Creation features
{ANY}
Features
{ANY}
{}
{ANY}
{}
Implementation of ARGUMENTS (do not use directly):
{}
size: INTEGER_32
writable attribute
{ANY}
top
make
effective procedure
{ANY}
top
effective function
{ANY}
top
out_in_tagged_out_memory
effective procedure
{ANY}
top
Append terse printable representation of current object in tagged_out_memory.
belongs_to (nb: INTEGER_32): BOOLEAN
effective function
{ANY}
top
propagate (col: INTEGER_32, val_column_1: INTEGER_32): BOOLEAN
effective function
{ANY}
top
fill_up (col: INTEGER_32): BOOLEAN
effective function
{ANY}
top
writable attribute
{}
top
case_vide: INTEGER_32
is 0
constant attribute
{}
top
biggest_one: INTEGER_32
is 10
constant attribute
{}
top
indice (lig: INTEGER_32, col: INTEGER_32): INTEGER_32
effective function
{}
top
clear_column (col: INTEGER_32)
effective procedure
{}
top
argument_count: INTEGER_32
effective function
{ANY}
top
Number of arguments given to command that started system execution (command name does not count).
argument (i: INTEGER_32): STRING
effective function
{ANY}
top
i th argument of command that started system execution Gives the command name if i is 0.
command_name: STRING
effective function
{ANY}
top
command_arguments: FAST_ARRAY[STRING]
frozen
once function
{}
top
Give access to arguments command line including the command name at index 0.
se_argc: INTEGER_32
{}
top
To implement command_arguments
se_argv (i: INTEGER_32): STRING
{}
top
To implement command_arguments