CONSTRUCTING AND REFERRING OBJECTS IN A COMPUTING ENVIRONMENT

Abstract: A system of constructing, referring and manipulating new types of uniform, strictly defined and generically connective objects in computing environments, allowing identification, connection, insertion and re-definition of fully as well as partly defined objects and providing a new self-organizing, open computing space for referring these objects in several independent tree structures, so that the system, its constructed systems, scopes of connections and objects all share the same space lifetime. The invention provides a new approach and architecture for building structures of objects, useful for generic knowledge systems, interactive and automatic language processing and other applications requiring automatic next order processes and global referring in deterministic and non-deterministic environments. The invention also provides a method to develop tools to adapt computer systems to the logic of specific users.

Description: CONSTRUCTING AND REFERRING OBJECTS IN A COMPUTING ENVIRONMENT BACKGROUND OF THE INVENTION This invention relates to three central issues of computing: - the global referring of objects in computer systems and networks, - the adaptive properties of computers and software in relation to users, - the capability to automate and to continue next higher order processes, These issues have been at the center of research and development since the invention of he computer. To this day, computing is severely limited in all three areas. There are many attempts in prior art to solve some of them separately or in isolated development 'bubbles' of highly specialized applications. Most of these attempts have concentrated on algorithmic approaches, providing better and more complex algorithms to overcome limitations considered as given by the underlying architecture of computing. This architecture, however, has not been altered considerably, at least not in a general and systematic way and is still the foundation of all major operating system platforms. The invention considers this architecture to be the main cause for the limitations mentioned above. They are: - Current computer architectures provide very limited access and orientation in their referring and data spaces in general and specifically in non-deterministic data spaces and object bases, like the Internet, where not all elements are known or fully defined. Generally, no global and direct data-to-data is provided in prior art. It is the object ofthe invention to generically provide direct data-to-data access as well as a method to identify objects which are not fully defined and thus to enable orientation in non-deterrrunistic systems. - Computers today require the user to predefine both the satisfactory fulfillment ofthe task of an operation and tne initialization ofthe operation itself. These predefinitions in turn require a predefined user, provided in prior art as the statistically pre-defined 'common user', and force the specific human users to adapt to this statistical model. Prior art computers can principally deal only with this 'common user', leading to an overemphasis on 'user friendly' gimmicks that bloat software without being able to adapt to specific users. It is the object ofthe invention to provide a method to develop computer systems that can indeed adapt to the logic of specific users. - Closely related to this issue is the automation of tasks, or, as it is also commonly called, the 'intelligence' of computers. The key topics here are 'insertion' and 'next higher order' processes. Computers today generally offer a low degree of automation, no continuous next order processes and extremely limited insertion. These general limitations are considered to be mainly responsible for the failure .ofthe 'Artificial Intelligence' (Al) project in computing. Both prior art 'AF approaches, 'top-down' Al and 'bottom-up' (Artificial Neural Networks) have not been able to deliver generic, simple and programmable methods or tools solving these problems. It is the object of the invention to provide a method to increase the level of insertion beyond prior art and to facilitate automatic next higher order processes with decreasing human intervention to redefine next steps, eventually, in future embodiments ofthis invention, allowing automatic programming and related applications . Description of Related Art There are many methods known in prior art which attempt to overcome some of these limitations. They illustrate not only the problems which need to be solved, but also the different approaches in prior art and in this invention. Most prior art solutions attempt to selectively overcome some ofthe basic limitations of hierarchical structures such as access, search and navigation in trees, without, however, changing the underlying architecture. One such method is "Access Support Relations", suggested as an "Indexing Method for Object Bases" by Alfons Kemper and Guido Moerkotte in a 1992 paper ofthe same name. It maintains "separate structures (disassociated from the object representation) to redundantly store those object references that are frequently traversed in database queries." To achieve this, an object-oriented new "Generic Object Model" (GOM) was suggested, which does not represent data, but rather acts as a container of references to a data object, stored separately in another structure. Another approach (Steven P. Nickel, US Pat.19890414045 19890928) uses prefix indexes in nodes of tree structures to better refer data records. Yet another approach (Simon Williams, US Pat. 19980108078P 19991112) provides a data management architecture that associates data records and relations with unique identifiers and records data and their relations in separate hierarchical structures. All these and similar methods and systems use additional and external attachments to traditional data objects. The approach ofthe invention is fundamentally different. It provides first an architecture and mechanism to systematically break hierarchical structures at every computing step. It achieves this by well balanced and integrated elements, rules and orders, ranging from the exclusive use of novel, strictly defined, uniform objects representing as well as referring the represented data objects in any numbers of separate, yet integrated hierarchical structures as well as in a dimensional scale of unique identifiers. The main paradigm o the invention is to record data not in the traditional set theory or object oriented way as 'containers' encapsulating the represented data information, but as connections. The 'connective objects' ofthe invention are several identifiers grouped together and related by mathematical equations, thus behaving like executable code. The system ofthe invention records these 'connective objects' into an open, 'meta-hierarchicaP space, where all objects share the same lifetime. The term 'meta- hierarchicaP refers to the property o the system to integrate more than one independent hierarchical trees, to achieve non-linear effects like setting new beginnings as roots in any point of its structures without requiring the structures to be rebuilt, and automatic next order processes. In the self-organizing, non-linear connection space of the invention data are constructed primarily just from connections. Traditional data are represented in the system ofthe invention as sequences ('wholes') and sub-sequences ('parts') described by the connective objects ofthe system. All possible (or desired) sequential combinations of such subsequences are available for reconstruction of whole sequences or for re-combination into other sequences, together with sub-sequences of other data. Such a system, although highly desirable, has been considered incomputable up to now. The reason is, that the combinatory information required to connect sub-sequences or parts is based on a known formula from the German mathematician Gauss, leading to exponential growth ofthe combinatory information with increasing number of parts. One ofthe main achievements of this invention is to provide not only a method to dramatically compress these combinatory information, but also to automatically scale connectivity based on punctuations it recognizes in the data sequences. For example, text data would be recognized as such and not connected on a letter-to-letter basis, but rather on a word-to-word and sentence-to-sentence basis. The paradigm ofthe invention is to provide data parts with their possible connections, and to globally access all these parts and connections. Every part only exists once in the system, so compression of required storage space is increased as more parts are recorded to the system. Again an example from word processing: once a system ofthe invention has recorded all possible words of a language (as well as many different combinations of those as sentences or parts of sentences), it would be able to produce new texts just by recombining the existing parts. Another unique feature ofthe system ofthe invention is its capability to perform next orders of its objects and the parts referred by its objects in a continuous process. Since the system uses only small uniform objects that are fully self connected and can refer data parts of any size, the system can form next orders not only of words or short queries, like in prior art search engines or dictionaries, but can also form next orders of all its parts (like sentences or other data sequences) regardless ofthe size of these parts. The system ofthe invention can perform such operations without running into size problems, and will be able, in respective embodiments, to translate sentences from one language into another language based on knowledge about the use of these sentences in both languages. This allows new generations of language and speech processing systems. The 'connective objects' ofthe invention are not objects in the object oriented sense containing or encapsulating the represented data. The invention objects consist mainly of several combined identifiers and only exist as objects (holding a Global Unique Identifier) when they have the identifiers of all ofthe at least 2 hierarchical structures of the system. These connections are conditions of every object's existence, not external attachments to an already existing object. The invention objects are not only generically connected to all the structures ofthe invention system, but also to other invention objects, so touching one starts a chain reaction leading to others. These features constitute a fundamental difference to and departure from prior art objects. It is precisely this new object type, always strictly defined, uniform and by definition self-connected in more than one hierarchical structure and additional in one dimensional structure, that allows, together with the invention's mechanism for systematically differentiating and unifying all connections of an object at every step, global access to and global referring of all objects (connections, relations, orders etc.) ofthe system, to perform next higher order processes, and to adapt to logics outside ofthe system. While the prior art inventions and methods cited here all relate to database management and database architectures, and are restricted to referring -'associatively' or otherwise- of predefined, 'tagged' and indexed traditional data objects, the invention provides a generic open, indexless referral system for all computing activities. The invention in fact creates a 'bottom-up' standard unifying all computing activities, because the objects ofthe invention can describe all such activities, including data, connections, program code, orders and standards, without needing a top-down meta-standard. SUMMARY OF THE INVENTION An object ofthe invention is to allow constructing and referring objects in a computing environment. The present invention comprises the features ofthe independent claims. Preferred embodiments ofthe invention are defined in the dependent claims. The invention provides a novel system and space for global referring of a new type of generically connective and insertable objects, allowing high level manipulations, like automatic next order processes, including adapting to logics outside ofthe system. Inclusion and Connection Referring of objects in prior art computer systems is generally based on hierarchical structures. Since the layers of these structures are only accessible when active, referring is principally limited and difficult. Prior art uses methods for constructing or connecting objects that usually are within the "object oriented" paradigm or generally are methods derived from the "traditional theory of sets" . B ased on both, prior art constructs and connects generally by building hierarchical structures of inclusion in scopes, using identifiers in such a way that the addressing ofthe constructed objects is exclusively a result of determination external ofthe addressed object. According to set theory, the primary definition of connection is based on inclusion, so that elements are connected together with each other, if and only if, they are included together m a set. Inclusion, however, is only one specific conditioning case of connection. The reverse characterization of inclusion based on connection is not possible in prior art. The invention does exactly that, so when the included is the connected, which is conditioned by the including, the connected which is not conditioned is not included, but still connected. By this characterization, prior to condition there is always connection, because being included is a specification of being connected. The difference between prior art and the invention thus can be summarized in one simple sentence: all of inclusion does not include all of connection, but all of connection connects all of inclusion. Suppose A' is an element in a set 'B', then 'A', which is included in 'B', does not include 'B'. But suppose 'A' and 'B' are connected, then A', which is connected to 'B', connects 'B'. In the first, asymmetric case, 'A' and 'B' are conditioned asymmetrically, because when 'A' is included in 'B', then the reverse statement " 'B' is included in 'A'" is false, and because when 'B' does not exist and 'A' is included in 'B', then also 'A' does not exist. In the second, symmetric case, both statements " 'A is connected to 'B' " and " 'B' is connected to 'A " , are true, and when 'B' does not exist and 'A' is connected to 'B', then 'A can exist. Set theory is considered here also as a hierarchical system of connecting and naming, since the theory connects one set to several elements, all being equivalent to an hierarchical layer. By those distinctions the main limitation of set theory and ofthe prior art systems based on it appears as the limitation of 'asymmetrical' versus 'symmetrical': Being included constitutes only an asymmetrical specification of being connected. The following specifies these limitations: Lifetime, Traversing Trees and Global Access Prior art restricts connection just to the condition of inclusion, thus hides all the connections prior to that condition. This hidden part ofthe connection is also well demonstrated in the fundamental problem of hierarchical structures, structured by asymmetrical conditioning. While in a structure of two-dimensional points, 'A' and 'C can be connected by going through point 'B', or directly, bypassing 'B', in hierarchical structures bypassing 'B' is ill defined, when 'A' conditions 'B', and 'B' conditions 'C. In prior art, this problem of traversing trees is partially solved by additional pointers used as 'shortcuts'. Those pointers, however, do not have the property of what they point to and are not globally available. They are also not visible to the hierarchical structure and to the object they point to, creating problems when objects are moved in the structure, and in general adding to the complexity of structures. The invention generally enables traversing trees by connecting all of its objects simultaneously and necessarily in two or more independent trees and also uniquely in a dimensional structure, all sharing the same lifetime. 'Lifetime' in hierarchical structures is the time during which an object is 'active' or 'alive' in its active scope. Access is only provided during this lifetime, enabling referring and making the object valid. Without the ability of referring, an object is 'ill defined'. The lifetime providing access of prior art objects is defined by their scopes, therefore bypassing scopes of objects is also ill defined. Although this problem can be reduced in prior art by constructing paths of layers of conditions of inclusion, or of layers of characterizations, this alone does not provide global access. Global access of all objects of an hierarchical system is required when all objects, connections and scopes (contexts) of a system or of a network need to be available, as in language computing, data mining or complex search operations in unstructured or semi-structured environments (like the Internet). To be able to do this, one must be able to bypass all layers and traverse all sub-trees, yet the layers of hierarchical systems of prior art are in different scopes with different lifetimes. Only when all scopes ofthe system have the same lifetime, can the system fully refer all of its objects, and only then bypassing of any ofthe objects and connections is available. In prior art, like the Internet, additional non-hierarchical structures like dimensional scales of global unique identifiers are employed to ease data access. These systems generally do not, however, provide direct data-to data access, but only access to containers (HTML pages, files, documents etc.), which again are structured hierarchically. The invention provides a system that allows to refer all of its objects in all scopes of various trees, all sharing the same system lifetime: Since it conditions by connections, not only by inclusion, and also prior to inclusion, it defines scopes of connections and scopes connected or not connected to other scopes having the same lifetime. It connects and identifies and constructs within and between all scopes ofthe entire system, since all scopes have the lifetime of the system. Insertion level As long as an operation is initiated 'outside of itself or fulfilling its task to a satisfaction defined 'outside of itself , the well defined distinction ofthe operation, based just and only on the distinction made up by inclusion, can be made only, when that 'outside-of-itself is predefined. That is why prior art requires predefinition ofthe satisfaction ofthe task fulfilled by the operation as well as predefinition ofthe initialization ofthe operation. The hierarchical form of addressing can distinguish very well the specification from the generalization ofthe addressing. This quality, together with the quality ofthe dimensional form to unify specification and generalization, are used to limit the pre-defmition problems. This limitation ofthe predefinition problems being related to all possible objects being uniquely identified, can be measured as follows: When a dimensional structure in its scale of unique identifiers uniquely identifies all the possible objects being identified also by an hierarchical structure sharing the same lifetime ofthe dimensional, and when that same lifetime enables bypassing, then the ratio ofthe smallest scale of any layer ofthe hierarchical structure to the scale ofthe dimensional structure can be called the 'level' ofthe insertion. The insertion is measured by this level as an insertion of any possible object to be an 'outside-of-itself intended to be inserted into the layer ofthe object. This level corresponds to the one lifetime ofthe range of possibilities being the specification distinguished from the generalization. The higher this 'insertion level' is, the less the 'outside-of- itself is required to be predefined. This 'insertion level' can be applied also to operations in a system. Although prior art provides solutions by constructing specification and generalization of addressing in a form of a pointer to be distinguished or unified by lifetimes of scopes, its maximum insertion level is always one, such as in the standard notation for an address in the memory (RAM), which takes the form 'segment : offset', when the 'segment' (base addresses) and the 'offset' have different lifetimes, or in the hierarchical form of 'directories' addressed also by unique dimensional form of addressing in the hard disk, when both forms of addressing designing the form ofthe hard disk share the same lifetime. The invention's method of constructing addresses uses the numerical base technique, because this technique allows to apply a referring system in hierarchical fonn to a number in dimensional form, thereby achieving one lifetime in both hierarchical and dimensional structures with the insertion level of one (maximum of prior art) as the minimum ofthe invention (with a predefined maximum). The level ofthe insertion is determined by the number ofthe digits corresponding to the number ofthe special pointers ofthe invention, constructing a path to the object ofthe invention, instead of just one such digit used in prior art. The digits are of an equivalent number being a property (and not an attribute) ofthe addressed object, when the used digits in their locations of numbers construct the addresses ofthe invention object, and the unused digits construct the 'defined void' addresses ofthe object. Both the used and the unused digits provide the 'outside-of-itself defined by the insertion level as the 'defined void' addresses, which are intended to be inserted as object addresses. Number of objects and inclusion of domain In prior art, when a domain includes another, both being domains of objects having identical size, the included has less objects then the including domain, whereas in this invention a domain including another has not just objects but also potential objects ('defined voids'), so that the included domain (in hierarchical layer form) defines 'insertion level number' times more objects and potential objects than its including domain (in dimensional form ) does. Furthermore, prior art distinguishes absolutely between the address ofthe object and the object itself, corresponding to the inclusion logic ofthe 'traditional theory of sets' . Therefore, prior art pointers have only the address property ofthe objects they point from and not the property ofthe objects they point to, so prior art does not, as the invention does, have an external domain belonging to the addressed object which determines the addressing specification of the object in both the included and the including domains. Domains and using dependency and independency of identifiers Prior art unifies laws of orders determined by sizes of ranges to be equal or smaller than the including ranges, activated in scopes defining lifetime of their objects, so that the object shall be uniquely identified for being accessed. Thus, when the objects have one common lifetime, the insertion level necessarily is smaller than one. The invention constructs two equivalent types of laws of order: the global order in the including domain constructed by a global unique identifier, and the scopal order constructed by two or more different types of scopal identifiers: the 'outer identifier', defining the included domain and the 'inner identifier', identifying in the included domain. Any of the three (in the preferred embodiment, or more in other embodiments) identifiers independently constructs a domain of objects, while only the equivalences ofthe three (or more) construct an object address. The domains of objects refer to totalities which can but don't have to be identical or connected and all the invention laws of order, identifiers, objects and connections share the same lifetime. Dimensional form, hierarchical form and new beginnings of a form Prior art distincts between dimensional and hierarchical forms of addresses, whereas this invention unifies dimensional together with different, yet coexisting, hierarchical forms of addresses, so any object attributed by several addresses is 'crossed' by the forms of these addresses. The invention first replaces 'inclusion' with 'crossing' for relating forms constructing objects and then can separately set precedence(s) between the crossing forms, after which any such precedence corresponds to a form of inclusion of forms defining its beginning or root. The invention thus enables methods to set the beginning of their forms corresponding to all the invention objects together with their input/output forms, such as the beginning ofthe form being the data scope form starting in an invention object, and in the data scope the beginning ofthe form set as invention object being input or output forms, or being ownership, or being identical combination of figures upon their locations etc. This property ofthe system to allow setting new beginnings as new roots anytime and anywhere in the system, is another fundamental departure from prior art, which, since it is based on set theory architectures, requires generally to start at one predefined root and to continue searching the established tree structures until reaching the requested node. Objects and connective objects Prior art distinguishes between objects and connection of objects, in the limitation ofthe forms ofthe objects. 'Objects' in prior art are generally treated as 'containers' encapsulating the represented data or code. According to this paradigm, objects can have very different sizes. They are connected by attaching attributes of connection like identifiers, tags, metadata etc. The invention object is a 'connective object' defined to be generically self-connected as a connection of objects sharing the same lifetime ofthe object itself. It does not, like prior art, require external identifiers, tags or metadata. It is also not a container of traditional, encapsulated data or code. The object ofthe invention consists mainly of several identifiers (qualifiers, pointers) which are strictly defined. The object ofthe invention may also hold values, but not in the sense of prior art, encapsulating represented data. When an object is not used as a connection of objects, then its address is a connection. If the address shares the lifetime ofthe object then it or the object is a connective object. If the address shares lifetime ofthe structure containing it as well as of other structures too, then the object is connective in the invention sense. This applies to one-dimensional, multi-dimensional and traversing tree structures. Data and recording It can be said that data is whatever a system records and afterwards recalls or constructs to the satisfaction ofthe user. Data can be recorded and reproduced in different ways. One is representation by digital description languages, another by analog representation (as in photography), yet another by literary description. Our brains have long been thought to record data by methods similar to photographic representation ofthe 'outside world', until neuroscientists argued that the brain neither has a data storage device that could store the amount of data that our sensory cells transmit as signals in response to environmental stimuli, nor does it have a logic mechanism or 'master brain' to interpret such representations. All that scientists can find is an active switching mechanism (synapses) as part of a complex network of neurons. Unlike in current computers, there is no data storage for representations to be found in the brain, and thus no 'memory' in a computing sense. Data are constructed by a complex mechanism of connecting and re-connecting in an associative connection space in ways currently not known in any detail. The invention uses a similar metaphor and analogy for recording and producing data in computers. It constructs a 'live' network (having system lifetime) of connections (invention objects) that do not contain traditional data, but can describe and refer, and thus construct and reconstruct, data in the traditional sense. Data in the invention system are constructed exclusively by referring, so that the invention can be described as a system of referring connections or of 'connective objects'. The variety of connections available in the system ofthe invention indicates its flexibility and wide range of usage. Variety of connections The number of different types of connections of 'connective objects' is defined here by the minimum equivalent number of different or separate structures of inclusion required to include these objects. This number corresponds to the variety of connections crossing a 'connective object'. Since prior art determines itself by inclusion, and since lifetime is restricted there to a scope, this number in prior art is always one, whereas in the invention this number is constructed for at least two different types of connections: for one dimensional type this number equals one, and for the other types the minimum of this number equals two, as described above. Together with the insertion level applied to the invention variety of connections, the invention 'connective object' is crossed by symmetric (bidirectional) forms of addresses versus the prior art using asymmetric (unidirectional) forms of addresses. Limitation of insertion General attributes such as 'logic value' (true/false), decision, activity and data as defined in prior art are 'connective objects'. Generally, insertion is limited to the insertion level ofthe 'connective objects' available in one lifetime, and also by minimal variety and mostly fixed precedence ofthe connections of these 'connective objects'. Additionally, insertion is limited by inclusion logic applied to such general attributes: since the including conditions the included, the already defined precedence necessarily also determines precedence ofthe applied general attributes such as 'logic value' prior to decision prior to activity prior to data, and when the objects connected to these 'connective objects' being the general attributes set in such a predefined precedence, then this predefined precedence applies also to precedence ofthe connection of these connected objects. Insertion in prior art is not only limited to an insertion level of max one and to a lifetime restricted to a scope, but also by inclusion unifying connections with fixed variety and definition generally tied to what is described above. Prior art can be improved by the methods ofthe invention, which set precedence while still having their 'connective objects' share one lifetime, expand the insertion level ofthe 'connective objects' and provide more varieties of connection because their connections distinct and unify inclusion, so the 'connective objects' are crossed by mutual forms of connections. Open Connection Space and Next Orders When manipulation of objects includes their construction, removal or insertion, then it is only available in the space where they are 'connective objects'. Definition of this space is a condition for defining 'connective objects' in relation to their potential for manipulation and connection. Since any object ofthe present invention is a 'connective object', uniquely identified by a one-dimensional integer, an existing manipulation argument in the invention space is an integer that can be applied to all the 'connective objects' ofthe system. This constitutes a generically open space in the sense of connection and manipulation. The open connection space ofthe invention is designed for high level generic manipulation as the next orders ofthe space of activities, when the insertion is redefined as the 'next order of activities' by and as a scale of insertion into interrupted continuous activity being the previous order, with the first order as continuous activity being an order empty of activities, and when every insertion interrupting continuous activity creates the next (a new higher) order. Prior art limits insertion also by permanently distinguishing between identities and between 'logic values' of connections of identities and the identities themselves and also between different scales of their next order of activities such as data next to executing next to logic values like program variables in either linear or non-linear (considered as hierarchical) paths. Fields of Applications The system ofthe invention provides qualities and tools that are highly desirable in many different fields of applications: 1. Global referring (any system object can be addressed and can address any other) 2. Global changing of priorities of connecting (any system object can be prior to any other in any order of connection) 3. Global insertion (any system object can be inserted into any connection of system objects) 4. Uniform objects (strictly defined with defined size) 5. Global unique identifier for every object, self connecting in at least two independent hierarchical structures 6. Global visibility (of any object from any object) 7. 'Things' (one or more objects or defined by one or more connections) 8. 'Void Things' (a 'Thing' but not an object, taking no capacity) 9. Reaction/insertion: turning any Void Thing into an object (global referring and global changing of priority of connection can also be applied to Void Things) 10. Integration of several independent hierarchical structures in any connection 11. Symmetric (mutual) connections (every object visibly points to and is pointed to by others) 12. Flattening of hierarchical structures (linearized on ordered global unique identifier scale) 13. Elimination of complexity (defined by dependency and depth, when the top layer is more complex than the bottom layer and the degree of complexity depends on the depth) 14. Combinations of identifiers defining connections ofthe owners 15. Next orders of connections (when the owner is an object, the second order ofthe connection is provided) 16. Connections defined by equations (unique identifier being one side of equations) 17. Standard levels (unique identifier defined in specific or common parts ofthe system, when the common is identical in other systems) 18. High efficiency of manipulation (size of argument of any combination of identifiers is the size of addressing one object in all the system and between common parts of different systems. No size restriction for input/output arguments to/from the system) 19. Simple and few transformations required to interpret the data model between the machine and the user (the number and the complexity of those transformations can be used to compare data models). 20. Automation, integration and next orders available for all and by all, or parts of all, features, fulfilling all requirements for an open system in terms of connection. These features ofthe invention enable future applications to solve some ofthe most pressing limitations of current computing, like automation, next order processing (as in natural language dialogue), orientation in non-deterministic systems and adaptive man-machine interfaces. Application fields like knowledge systems, pattern recognition and - discovery systems, data mining, language computing, bio-informatics, robotics, hardware design, system simulation, curve prediction, to name but a few, can profit directly from the invention. The system can also be embedded in hardware applications like chip design, communication devices and parallel computing. Further features, objects and advantages ofthe invention will be apparent from the following detailed description of sample embodiments in connection with the appended drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 Notation and symbols ofthe system as used in the drawings: A: Scope (layer) ofthe 'normative' hierarchical structure ofthe system, connecting one parent object as apex ofthe open triangle to many child objects at the base. The form ofthe drawing is referred to as a "fan". B: Notation of connections in the 'associative' hierarchical structure ofthe system. The curved arrow goes from a 'mentioning' object being an associative child, to a 'mentioned' object being its 'associative parent'. C: Many-to-one connections ofthe 'associative' hierarchical structure ofthe system D: Dynamic insertion E: Input argument 'la' symbolizing input to the system F: Connection between two parents referring by link symbolizing a 'sharing connection'. G: Symbol of a connection of an object in the circle having exclusive value 'Ev' pointing to the object at the end ofthe curved line. , H: Exclusive value as calculated data without connection. Fig. 2 Global Unique Identification Structure with three objects A, B and C Fig. 3 Equations of identifiers make connections: Example of objects A, B and C. Fig. 4 Input connection: connecting an Input argument (la) to an object C in the normative tree ofthe system as a new beginning of an associative tree. Fig. 5 Sharing connection: the child objects C and D share two normative parents A and B. Cp: Combinative pointer Fig. 6 Connecting object D as 'associative parent' shared with R to child objects M, Q and K. Fig. 7 Bitmap ofthe object ofthe invention showing base and offset of all 4 identifiers: 'Matching identifiers' Oi and Ii, Private characteristic Pc, being either an Exclusive value Ev or Combinative Pointer Cp, and Unique identifier Ui having its most significant bit (MSB) marking the system variation. The least significant bit (LSB) of identifier Oi is signed. Cp has its MSB unused. Fig. 8 Two objects (A and B) ofthe system referring by their Cps to a third object C, also referring to a layer of objects (containing C) in a different tree. The layer is defined as a base in a different subsystem by the linear structure in which the other object refers to the offset, together by one subsystem defining C. Fig. 9 Two-dimensional representation of one sub-system, where x is the base of Ui and y is the offset of Ui. The diagonal line represents the Cp values, any of each being a link of a layer of two trees, each layer represented as a perpendicular line. Any object (such as C) is defined by the crossing of these two lines (layers) and as a parent refers to another point in the diagonal line. Any such referring constructs a two- dimensional connection ofthe perpendicular in a next higher order (new dimension). Fig. 10 Four sub-systems in a linear structure defined by four trees Fig. 11 Dynamic insertion modes ofthe system. A is a static mentioning object. B is a 'mentioning bypass' object on the negative side ofthe normative hierarchical layer's address space ( -1 * 2 Λ (x-2) ) and is prior to C — J. C-J are dynamic domains: C: lead domain, dynamic, but in the foreground ofthe static; D: similar domain in the background ofthe static; E: latter domain, added after the static; F: contrary domain, added instead ofthe static; G: former domain, added before the static; H: conditioning domain, dynamic under condition ofthe static, formulated by dynamic=function of static; I: conditioned domain, static under condition of dynamic, formulated by static=function of dynamic; J: last domain, finishing if enabled. Fig. 12 Data features ofthe system: crude data case. A: Input data parent (N=0); B: crude figure = input argument la; C: parent of crude objects (N=0); D: crude object (N=l). N: number of represented data objects, such as B Fig. 13 Data features, ordinary case: figures 4,3,2,1 represent a data sequence 1,2,3,4 in a LIFO order. The sub- sequences 43 and 21 are connected in the M =1 layer under the normative parents 3 and 1, mentioning parent 4, respectively parent 2. The complete sequence 4321 is connected in the M = 2 layer under parent 21, mentioning child 43. At any M, 2 Λ M objects are represented. M represents 'magnification' factor. Fig. 14 Data features: proving the sequence 1,2,3,4 A: Data parent. B: parent of crude objects C: parent of children being added before their normative parent of where they are associated and from where one reads. Fig. 15 Data features, proving the sequence 1,2,3,4,5,6,7,8. The system requires M=3 to connect all sub-sequences ofthe sequence. Fig. 16 Dimensional and relational features ofthe system: A: Input argument = ordinal number of dimension or relation r B: Input argument = dimensional or relational values C: mentioning dimensional or relational attributes of dimensional or relational points. D: as a relation with a dimensional feature mentioning connection and is mentioned as a hand of connection (table) E: the first dimension value c: (connection) corresponds to a row in a table h: (hand of connection) corresponds to a table r: (relation of connection) corresponds to a column in a table (h, r, c) corresponds to a cell in a table DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS OF THE INVENTION The invention relates to architectures of referring systems in computing and to systems of formation and transformation of globally valid connections of elements. The invention provides elements and structures to connect, relate and manipulate elements. Any element alone takes no capacity and is defined as an address in one ofthe three or more structures, the linear or one ofthe two or more hierarchical, the normative or the associative, structures. The hierarchical structures represent trees. The system defines unlimited numbers of trees. In its preferred embodiment described here, the system has two trees. In the linear structure the elements are unique elements, whereas in the tree structures the elements, normative or associative, are matching elements. A matching element uniquely identifies the element's parent in its corresponding tree and matches the many children in the corresponding layer containing the element. Only two matching elements, each defined in a different tree, together define the unique element defining an existing or a non-existing object. Only an existing object takes capacity. One ofthe matching elements defines a unique element in the scope of its parent, which is defined by the other matching element defining the same unique element. The equivalence ofthe unique element ofthe one to the absolute value ofthe matching elements ofthe many of one ofthe trees defines the corresponding, normative or associative, layer of connections ofthe one bi-directionally to and from the many in the tree. The two (or more) trees connect the same one existing (parent) object bi-directionally to and from two layers of elements (ofthe children ofthe parent) in the two (or more) different trees. The size of any existing object is half x bytes, where any layer of each tree has 2 Λ x matching elements, and the linear structure has 2 Λ ( x - 1 ) unique elements. Although all the elements are previously defined in one or even two ofthe three (or more) structures, most ofthe elements are reserved addresses of non-existing objects and as such they are only partly defined. The three elements defining an existing object are uniquely identified by its three corresponding identifiers, the unique, the normative and the associative. Any existing object is an associative parent as well as a normative and associative child, and consists of its three identifiers together with a private characteristic and an x bit size exclusive value. The private characteristic includes the link ofthe normative parent to its children together with the part ofthe associative identifier which is not contained in the unique identifier. An existing normative parent object includes also its link to its children in the normative tree. The existing children in the normative tree exist also in the associative tree. A special mechanism, enabled by the link ofthe normative parent ofthe object and by its associative parent, automatically combines for any existing or non-existing object the equivalence of its unique identifier to its two matching identifiers. The system provides collection of one object by only its unique identifier, and also collections of many objects by only one of their matching identifiers. The collection is done by two (or more) normative and associative, sub-systems, one of which is the leading and the other is the following and where, for the matter ofthe connections resulted by equalities, the objects in the following sub-system are mirror objects and only the objects in the leading sub system are the objects. The default leading sub system is the normative sub-system. Any layer of elements of each tree is set, ready for collecting, in a sequence in the linear structure. Only two steps of accessing an obj ect are required for the accessing from the parent to any of its children in the two (or more) tree layers and only one such step is required for access from a child to any of its two parents. Two steps of accessing from parent to child are needed because one ofthe two trees is of referring arguments through gates. The provided visibility by these three methods of accessing covers bi-directional connections together with collecting horizontally the normative and peripherally the associative layers of connections of parents and children ofthe two (or more) trees. Owing to this visibility, since children of a parent of any tree are ready for collecting, children of a parent of one tree being also parents of children ofthe second tree, although they are spread in connections to many layers ofthe first tree, are ready for collecting due to them being also the children ofthe parents ofthe second tree. The system provides several types of connections: The 'normative connections' bi-directionally connect many normative children to and from one normative parent. (Fig. 1A) The 'sharing connections' connect many sharing objects uni-directionally to one shared object, when the link ofthe sharing objects is equal to the link of a normative parent object being the shared object, so that the sharing objects share the normative children ofthe normative parent. If the associative tree refers by link, then the associative parents also can be shared. (Fig. 5) The 'associative connections' are either 'mentioning connections' connecting objects, or 'input connections' each connecting an object to an argument. Although all associative connections refer by more then one referring arguments through gates, the distinction here between mentioning and input connections is, that the first make a tree defined by referring to objects ofthe system and the second is a beginning ofthe first, referring to other arguments than ofthe first. (Fig. IB, IC) The 'mentioning connections' connect many mentioning objects as children bi-directionally to and from one mentioned parent object. (Fig. IC) The 'input connection' connects an input object to an input argument equal to the associative identifier of an input object. The argument ofthe input connection is an associative parent ofthe input object and is not assigned to the system by the exclusive value of its objects, when this argument is intended to be memorized, so that the input connection connects many (times the same) parent(s) to and from the one input object child. Any new normative parent of a layer of input objects is a new additional root (beginning) in the associative tree ofthe system, additionally to the single root ofthe normative tree. (Fig. 12) The exclusive value is distinguished by one bit from being a pointer to an object or being calculated data.(Fig. IG, 1H, 7) The counter object mentions an attached object, 'attached' being defined as attached to the counting, where the counting uses the counter object's exclusive value and is specified by a specific counting type defined by the parent specifying the type ofthe counting in its layer. The Model ofthe System ofthe Invention (Fig 8-16) Any order defining one or more elements by one element, such as the methods following the 'Traditional Theory of Sets' or the 'Fuzzy Theory of Sets' (the latter using the exclusive value as the membership value ofthe element), can be designed by a layer of input objects of input arguments representing the distinctions of elements included in any such set represented by the normative parent associatively connecting ('mentioning') the input object, which represents the distinction of this set, as an element in its containing set. The normative tree, beginning in the layer ofthe normative children ofthe input objects, will represent then all such sets, where the set of all such sets is the normative and associative child ofthe first input argument and the restriction of following layer by layer the steps ofthe definitions is achieved by following the normative tree order. All orders other than those only mentioning the input objects are out ofthe range of these design theories. New beginnings (roots) and the depth in the normative tree between the mentioned and the mentioning objects are arguments of describing orders in the invention system. Both dominant theories of sets have one beginning and increase depth following their orders, while dimensional orders, i.e., have a fixed depth. The simulation ofthe specification ofthe object is applied to its unique identifier. The simulation of a matching request is applied by the object's unique identifier and by the generalizations and specifications ofthe matching request. One ofthe two connections -the normative or the associative- specifies, and the other generalizes the simulation ofthe matching request applied by the object. In the system's default, the reverse being optional, the associative connection specifies and the normative generalizes. Still, the generalizations ofthe matched request applied to an object are independently applied to both the normative and associative parents of that object by its corresponding identifiers. The object specified by the two types of generalizations then optionally generalizes, by two types of specifications, the specific matching requests applied to some specific objects. In short, any object of the system in its preferred embodiment is required to have two parents and most every object potentially functions as a parent in two families. The number of parents required always depends on the design ofthe system ofthe invention. When it is designed with more than two trees, its objects will require to have a parent from each ofthe designed trees. As long as a potential object ofthe system does not have both of its two (in the preferred embodiment) parents, it does not take capacity in the system and does not exist as an object, although it is partly defined. In addition every existing object is automatically assigned, and independently accessed by, a unique identifier. In the system ofthe invention, the object is not a record of an act of inclusion in a domain being a scope of its parent, as is the case in prior art, but instead is a record of an act of movement between, or of a touch of, or of a contact with such domains. The recorded movement has a unique identifier and as a record creates automatically one associative domain or optionally two domains, where the movement is a direct available movement, either to or from the domains ofthe roots ofthe system or between the other domains. The connections in the system ofthe invention set the order ofthe system. The system sets order by recording acts of movements. Except for the orders of modifications ofthe existing orders, the plurality of beginnings together with the fact that all the system objects are valid to refer to and to be referred by any object together with the record of the movement between the domains, which creates domains, provides any next order ofthe existing orders ofthe system. The system ofthe invention also provides different times for any new definitions of its objects always requiring two definitions, with an unlimited gap of time allowed between them. Since the definition as an address is always previous to the defined, a new sense of definition is added as 'hard' -being the last definition- and 'soft' being previous to the last definition. Both are required for any address defining any object. Interactive Features (Fig. 11) The system ofthe invention further provides interactive features for its objects: 'Dynamic insertion' is a feature of reaction of any existing object to redefine the object according to its redefining condition. This feature enables to define only the change of dependencies applied to the object, instead of rebuilding the dependencies all over. A redefined object is called 'static', and is redefined by the 'dynamic(static)' objects and by the order ofthe stream ofthe mentioning connections which begins with the dynamic(static) and remains in the same normative domain. The redefining condition of an object belongs to the enabling conditions applied to the static and to all dynamic(static) by executing the 'exclusive value' and the normative link of dynamic(static), where an object which is not ignored is enabled. The enabling conditions are: if the object does not exist, it is ignored; if its normative identifier is negative and if dynamic(it) are ignored, then ignore it also, otherwise do the redefining condition of dynamic(it); if its normative identifier is positive, then ignore all dynamic(it) and either do its redefining condition when it is dynamic(static), or do its connections with no feature of reaction. In the preferred embodiment ofthe system the associative parent has, and the normative parent does not have, a signing bit in their referred unique identifier although the associative and the normative identifiers are signed integers. The dynamic(static) is either the object defined by the normative parent ofthe static and by the negative associative identifier ofthe static if enabled, or are the positive mentioning(static) objects in the following eight normative domains: the 'last alone', there the eight domains begin, and the dynamic insertion ends if the dynamic(static) is enabled, or the 'conditioned': the static is under the condition ofthe dynamic(static) formulated by static = function(dynamic); the 'conditioning': the dynamic(static) is under the condition ofthe static formulated by the dynamic = function(static); the 'former': the dynamic(static) is added before the static; the 'contrary': the dynamic(static) is added instead ofthe static; the 'latter': the dynamic(static) is added after the static; the 'similar': the dynamic(static) is accompanying the static in the background; the 'lead': the dynamic(static) is accompanying the static in the foreground. Orientation The system ofthe invention (except for the exclusive value of its objects) can be described as a conjunction of orientations by objects, or of orientations in a space by points. The system provides conjunction of four (in the preferred embodiment) such orientations, with each orientation having its own flow or order and all the orientations cross and are encapsulated by any object. The first three orientations are non-dimensional and are allowed to continue the flow ofthe order to any object. The four orientations are: the 'Normative' as the basic or the primary orientation providing the place for, or the condition of, the other orientations; the 'Associative' orientation being the occurrence ofthe conjunction, the 'Interactive' orientation as the most recent, being the change ofthe conjunction, the 'Global' orientation as combination or unique key ofthe conjunction in a linear order, containing a part of one of the first two orientations enabled by the two sub-systems ofthe preferred embodiment. Standard Level Feature of an Object Different groups of unique identifiers of objects can be marked in the system as different 'Standard Levels' of use. In any normative layer all the children have the same standard levels of use. Alternatively, if the associative tree refers by the link, the layer of associative children is defined by the same link ofthe normative tree and the associative children thus would be effected by the standard level. All the objects by their unique identifier and all their children by their matching identifiers are marked to belong to the same standard level and are differentiated from other standard levels of use. This provides a technique to assign objects and their children to regions specified by their applications, although they are spread in different depths. When common uses are identical, but specific uses are not necessarily identical in different such systems, the cost of information transmitted by the absolute value of one unique identifier containing any amount of layered connections of common use between the systems or of specific and common uses in one system is x - 1 bit size only and the arguments between the systems ofthe specific use for building in one ofthe systems the missing parts ofthe transmitted information are of half x byte. This allows in many cases to transmit information without transmitting blocks of large size data. This feature can be implemented not only in local and wide area networks but also embedded in machines and hardware chips performing communications between components of machines or nodes in parallel computers and clusters. Modifications Features Various modifications of an existing object are provided by the system ofthe invention: Modification of its exclusive value; disabling or enabling dynamic insertion to it; associating it; having or sharing normative domains of objects due to the modifications ofthe normative link of it or of other sharing objects, creating or deleting it. A group of existing obj ects can be modified by the modifications of a single existing obj ect under the provided visibility ofthe system. If necessary, objects only in one ofthe two sub systems can be modified, but this requires to check both systems in any real-time step of reading. Any next order of any order recorded by the connected movements is available in, or can be applied to, this system, as well as between such or to such systems. Terminology and definitions: The 'normative' is applied by the normative or 'outer' identifier ('Oi'); the 'associative' is applied by the associative or 'inner' identifier ('Ii'); the 'interactive' is applied by the dynamic insertion enabled by the object's normative identifier; the 'global' is applied by the unique identifier ('Ui'); the exclusive value is marked by 'Ev' and the private characteristic by 'Pc'. Pc includes the link ofthe normative parent which is the combinative pointer marked by 'Cp' and the part ofthe Ii which is not contained in the Ui. The object contains the following 4 attributes each of x bit size: Ui, Pc, Oi and Ev. The input argument is marked by 'la'. An existing object is defined by having a specific unique identifier and a capacity equal to half x bytes (x being the same x as defined previously by the conjunction ofthe size ofthe object, the range ofthe linear addresses and the range ofthe number of objects in a layer of a parent). A 'Thing' is one or more existing objects or is defined by one or more connections. All Things are valid in all the system. A 'Void thing' is a Thing, but not an existing object (so Void things have no capacity and no specific unique identifier). The Unique identifier is a number, not a media location, which is searched by a binary tree of maximum x cycles of memory access (so no cost of capacity is applied to Void things and no restriction for Void things is required). A Void thing having an existing parent can also be referred exclusively by an existing object, when the object's inner identifier is equal to the inner identifier ofthe Void thing and when its parent's inner identifier is equal to the outer identifier ofthe Void thing. Insertion is the action of turning a void thing into an object. Things record events of connections. A 'System thing' is a Thing of, or connected by, the system. Dimensional Features (Fig.16 ) Any dimensional point as a specific combination of identifiers perpendicular to each other and set in an order of previous to next can be simulated by the system: The different perpendiculars are simulated by different domains; the inner identifiers defining certain objects in the different domains are simulated as the identifiers in the different perpendiculars; objects either are parents of specific domains, or an object can itself be a specific domain if the perpendicular is the first one; the specific domains are set in the order ofthe identifiers given in the dimensional point and the recording ofthe movements between the specific domains simulates the dimensional point combination. The dimensional perpendicularity is simulated by the restriction ofthe recorded movements to be only to that specific domain which simulates an identifier in the next perpendicular ofthe dimensional point. Relational Features (Fig. 16 ) The system ofthe invention can simulate relational features by a 'pipe of connections", defined by a line around the pipe in a length of max(h) units and in a form of a circle of which the center is a point in the axis ofthe pipe. The line is the pipe's revolving measurement of which any unit marked by the integer h defines a hand of connections. The hand is a table being an object extending from the pipe edge to its axis. The radius in the pipe, representing a column in any table, is marked by the integer r defining the relation ofthe connections from many hands to one hand. The row in any table, being parallel to the axis in the pipe, is marked by the integer c defining the connections defined by the relation r to the hand of which h=c; the cell in any table being defined by (h, r, c) contains the integer v marking non-existence ofthe connection if =0; max(c) = max(h) and min(h) = min(r) = min(c) = 0. In the pipe; all the connections are differentiated by the their relations; the relation alone has no specific direction. The connections are from many hands to one hand. The connection alone has a value, has direction from a hand defining the relation ofthe connection and is not a dimensional connection, since it is not connected to a connection alone, but to a one-dimensional point (h) being a hand or a set of two-dimensional points (r, c), each containing a one-dimensional value (v) and is defined by the hand (h), by the relation (r) and by the connection (c). The pipe of connections is simulated in the system by the three-dimensional point (c, v, r) mentioned in the domain ofthe parent simulating the identifier c = h, so that the domain simulates the connected hand. The first order of completing what constitutes a sentence can be represented by this pipe of connections, when r is defined by the predicate or by predicating, c is defined by the object and h is defined by the subject, all ofthe constituent. The next orders of completing constituents can be applied by the system ofthe invention, but not by the pipe of connection, when the orders consist of differentiating r, c or h after being defined (i.e. the completed constituents can be divided differently than being defmed) or when the orders consist of constituents being also at the position of r, c or h (i.e. for completing the sentence from its constituents and for completing the word string from its sentences and for completing a whole of word strings from its word strings and so on). Data Features (Fig. 12-15) Data in the invention system is defined here where all the following conditions are maintained: Data is a container of one or more data figures, any of which has complete capacity in different locations in the data, where the location in the data is the identifier ofthe data figure. The arrangement ofthe data sets one or more connections in the data and results in a sequence. One or more connections, being set by the arrangement ofthe data and being ofthe data figures or being ofthe sequences ofthe data, are the sub-sequences ofthe sequences ofthe data arrangement. The sub-sequence is connected also to other sequences arranged in one or more data. The linear arrangement ofthe data sets connections of sequences by connecting the previous to the next sequence and then changing the next to be the previous to its next of which the location is increased by 1, until the next is the last. Data as an input to the system is set in a linear arrangement and optionally and additionally in dimensional arrangement where all the following conditions are maintained: The data figures have an identical size smaller or equal to the input argument size. The integer L marks linear location of data figures, where last data figure is marked by L = 1 and first by L = maximum of data figures, so that L increases in the backward direction ofthe data. 'Crude' figure is one ofthe data figures without its location in the data, where crude figure is la equal to Ii of an input object which is a ' crude object' . All crude objects are normative children ofthe crade object's parent, which is a normative child ofthe input data parent. Any ofthe location objects mentions crude object or location object and is a normative child of crude object or of a location object. The integer M marking magnification is the ordinal number of layers in the normative tree, where crude objects have M = 0, and the integer H(M) = 1 / (2 Λ M). The location object(l) representing the sequence ofthe data of its figures from L = 1 - 2 Λ (M + 1) to L = 1, is created for any M as long as H(M) > 0 and for any 1 = 2 Λ (M + 1) * H (M + 1) as long as 1 < L + 1, as a child ofthe two parents, the normative being the location object (2 Λ M * H (M)) and the associative being the location object (2 Λ M * (H (M) + 1)), if (CH (M) > 0) and ((H (M ) & 1) equals 1)), so then the location object (1) is the ordinary child, or if ((H (M) > 1) and ((H (M) & 1) equals 0)), so then the location object (1) is the complementary child, and where the complementary child is also a parent ofthe child ofthe associative parent being the location object (2 Λ M * (H (M) + 2)) and ofthe associative parent being the associative child ofthe associative child ofthe location object (2 Λ M * (H (M) - 1)) being normative child ofthe parent ofthe children being added before their normative parent which of their association when they are read. The integer 'S' represents a sequence of S data figures, where the crude objects parent and the input data parent represents S = 0, crude object represents S = 1 and location object represents S equal to the sum of S of its mentioned object and of its normative parent. 'Ordinary object' represents input data by going to the mentioned object while collecting in a LIFO order the ordinary parents ofthe mentioning objects in the path until reaching the crude figure, laying out its Ii as an la and continuing representing input data from the first out collected ordinary parent, until there is no ordinary parent. Ui ofthe following distinct cases are marked by different Standard levels 'Sl', when the cases are: the case ofthe input data parent, the case of children ofthe input data parent, the case of crude objects and the cases of ordinary or complementary children having identical M. The dimensional arrangement of data sets linear arrangement of data in B dimensions, where all dimensions marked by the integer b are set in order of previous to next and where all the following conditions are maintained: 0 <= b < B, where all objects of b > 1 and M = 0 are normative children ofthe input data parent and crude(b) object is associative parent of crude object(b+l). Each b has maximum marked by max(b) and location marked integer 1, where 0 < 1(b) < max(b) + 1. The data defined by 1(b) is created as linear data ending with last(b) location object. All mentioning objects mentioning the last(b) location objects are created as linear data ending with last(last(b)) location objects. For all b the mentioning objects mentioning the last(last(b)) location objects are created as linear data being in dimensional arrangement . Data Sequences and Sub-sequences By the ordinary and the complementary cases all the data sequences being the sub-sequences (sub-intervals) of linear or dimensional data arrangement are accessed from parents to children as were created, and their children are collected by both trees, where the linear order ofthe sub-sequences is distinguished by the complementary children through increasing M, so all the sub-sequences are connected by their arrangement of data, so that sub-sequences are connected to the next and the previous sub-sequences for completing the data sequence, in addition to and distinct from being connected to other sequences of other data. Using Exclusive values and/or counter objects ofthe data objects containing the checking marker together with T results in equality of parts ofthe data in different '1', where checking marker repeats when the data is accessed from the parents to the children. Beside the connectivity performed by the data features, only m instead of 1 layers are used for defining information being in a size of 1 figures each of a size of x bits, where the size ofthe total information is ( x/ 8 ) Λ ( 2 Λ m ) bytes and 1 = 2 Λ m. Programming Features The 'where_in' specifications are scopes of specifications in one or more machines, data, connections and/or data representations. An instruction is an instruction of a simulation by a thing, when the instruction is prior to the simulation by the thing. The matched request applied to a thing can be simulated directly by the thing or can also contain instructions. The primary instruction simulates one or more instructions, each can be general having no specification of where_in and/or specific having the required specification of where_in, when the specific primary instruction is the most prior instruction and is executable, so that in addition of its being simulated it can also be executed in its where_in as required. The programming arguments are Ev and Pc. In the beginning of a block of instruction the programming arguments are input received from the previous block and in the end ofthe block they are output given to the next block, where the instruction in the block follows the order ofthe flow of control. The flow of control is under the condition ofthe dynamic insertion of its objects and goes to the next object in the order defined by the following priority of blocks and flow of control in each block: First block: if Ev is a pointer, go to the pointed; Second block: if the object is a mentioning object, go to its associative parent; Third block: if the object is a normative parent, go to its children, and if the child is an input argument, begin with zero, where this block is an instructions block, otherwise this block is a conditioning block containing a static object as the condition and their dynamic as 'else' ofthe condition; Alternatively, to achieve a much bigger variety ofthe programming feature, both trees can be referred by the link. Fourth block: if the object is an input argument, go to the bigger input argument in the normative layer. The calling direction of instructions is from the calling block of instructions to the executable block of instructions and back to the next calling block of instructions until the simulated thing, when the simulation ofthe calling goes from the simulation of one by one ofthe many, to the simulation ofthe one connected by the many and is considered as having the direction from the active to the passive. Instruction can call or be one or many primary instructions or instructions or direct simulated things. (Note: this invention refers also to the earlier patent application "A Method for Constructing Objects in a Computing Environment" (EP 00 108 378 A). The entirety of this document is incorporated into the present document by reference. The current invention is based on the earlier one and extends it. In some cases, the terminology has evolved, since there is no prior art terminology for multi- or meta-hierarchical systems available, some terms had to be newly introduced. The main difference from the prior invention are: 1. the prior invention was restricted to two hierarchical trees, the new one is not. 2. The prior invention is a subsystem ofthe current system with the normative tree leading the collection of objects. The new invention has as many subsystems as there are trees. 3. The preferred embodiments ofthe new invention have been optimized and simplified (i.e. where the earlier system required two up-to-down steps for accessing a layer, the current invention requires just one) The preferred system and embodiment ofthe system of this invention is a system of two trees only, the normative and the associative, both being referred by link, where the associative parent does have, and the normative parent does not have a signing bit in their referred unique identifier, where the system has 2 subsystems, the leading being the normative in which the Ui defines the connections of he object, where the system defines 64 standards and where all the following conditions are maintained: 1. most_left_only is defined by 32 bits of which only the most significant bit (MSB) equals one and any one ofthe other bits equals zero and full_most_left_only is defined by 64 bits of which only the MSB equals one and any one ofthe other bits equals zero. 2. The object is of 32 bytes including 4 attributes of 8 bytes each, where each is defined by its most significant 32 bits base and by its most less significant 32 bits offset and where the four are Ui and Pc being encapsulated by P_by and Oi and Ii being encapsulated by P_to. 3. The matching identifiers (Mi) ofthe object are Oi ofthe normative tree and Ii ofthe associative tree, both are signed integer, where their least significant bit (LSB) is a sign bit, so that when is 0, then is positive and when is 1 then is negative, where the absolute value of Mi equals Mi / 2, so that when Mi is negative then equals 2 * (absolute value of Mi) + 1, and when Mi is positive then equals 2 * (absolute value of Mi), and where (Mi and 1) equals 1 then Mi is negative, otherwise Mi is positive. 4. The combinative pointer, Cp, having 31 bits only (MSB being unused), is the link ofthe object to its children. 5. The private characteristic, Pc, ofthe object ofthe leading subsystem contains in its base either Cp or most_left_only if the object is not a parent, and contains ofthe other subsystem the exclusive value, Ev, of the object. 6. ACp is the Cp of the link of the associative parent of the object. 7. NCp is the Cp ofthe link ofthe normative parent ofthe object. 8. is_minus is the sign bit ofthe Ii ofthe object. 9. The most significant bit (MSB) ofthe unique identifier, Ui, ofthe object marks the subsystem ofthe object so that 0 marks the associative and 1 the normative, where the other bits define the unsigned integer of Ui ofthe object, so that AUi is the Ui ofthe associative subsystem, where base of AUi equals ACp and offset of AUi equals ( NCp * 2 ) + isjninus and NUi is the Ui ofthe normative subsystem, where base of AUi equals NCp + most_left_only and offset of AUi equals ( ACp * 2 ) + is__minus. 10. The conversion of Ui of associative subsystem to Ui of normative subsystem, where FUi is the converting Ui and TUi is the converted Ui is where the base of TUi equals ((offset of FUi) / 2) + most_left_only and the offset of TUi equals ((base of FUi) / 2) + (LSB of FUi), where LSB of FUi is the most less significant bit (LSB) of FUi. 11. The conversion of Ui of nonnative subsystem to Ui of associative subsystem, where FUi is the converting Ui and TUi is the converted Ui is where the base of TUi equals ((offset of FUi) / 2) and the offset of TUi equals ((base of FUi) / 2) + (LSB of FUi), where LSB of FUi is the most less significant bit (LSB) of FUi. 12. When the object is created and its Ui is set, then its Ii is set to AP * 2 , its Oi is set to NP * 2 and the base of its Pc is set to most_left_only if the object is ofthe leading subsytem, where AP is the unsigned integer of Ui ofthe associative parent ofthe object" and NP is the unsigned integer of Ui ofthe normative parent ofthe object. METHODS The following four methods are given to further describe a sample embodiment ofthe invention: 1. The method the_Ui receives the RUI of 8 bytes and the to_write of 1 bit arguments and then sets the global pointer P_0 to the unique object of which Ui equals RUI with setting the global bit is_old to the statement equivalent to the object is found. The method returns the managing arguments ofthe type Ob_pile_access belonging to the object. When the method is terminate, then if to_write is true, then the object is created and its Ui is set to RUI and if to_write is true or the is_old is true, then the pointer P_0 is set to the object having Ui equals RUI. 2. The method set_step_block receives the in the following order the following arguments the 4 byte base being the base of Ui ofthe first in a row of objects requested and the 4 byte offset being the offset of Ui o the first in a row of objects requested, and then calling the method the i and setting global buffer of objects manageable by the argument ofthe type manage_collection including stop being bit which if equals one, then the row can not be found, left_to_do being amount of possible objects in the row which are in the buffer and P_0 pointer in the buffer to the first object in the the row which is in the buffer and returns the being set argument ofthe type manage_collection. 3. The method step_block_back receives the argument ofthe type manage_collection and returns argument ofthe same type ofthe next buffer of objects having bigger Ui. 4. The method P function The general methods: 1. isjnotJSTP equals most_left_only, to_make equals 1, to_get equals 0, no_st equals 0, Is_associative_sys equlas 1, Is_normative_sys equals 0, of_default equals 0, of_up equals 1, of_class equals 2, of_content equals 3, of ist equals 4, of_counter equals 5, of null equals 6, of_remove equals 7, of HW equals 8, of_crude equals 9, pileJSIP equals 0, data_NP equals - 1, classes_NP equals 2, content_NP equals 3, listJSTP equals 4 , counter_NP equals 5, JLLDATA_parent equals 6, remove_before_NP equals 7, add_before_NP equals 8, crude_NP equals 9, max_M equals 32, and PileMAXframe equals 10. 2. The method as_signed or Ia_of or as_Mi receives the 64 bit integer H and returns H * 2. 3. The method as_abs receives the 64 bit integer H and returns H / 2. 4. The method is_NEG receives the 64 bit mteger H and returns the bit set to the statement equvivalent to( ( H and 1 ) equals 1 ). 5. The asJS i receives the 64 bit integer H and returns (H / 2) + full_most_left_only. The standard methods: 1. standard_log equals 25 and standard_log_plus_one equals 26. 2. The method set_the_standards sets the integer standard_level to 0 and as long as standard_level is smaller then standard_max the method sets the two 32 bits global variables ofthe array marker marker[ standard_level ] to ( standard_level being left shifted standardjog bits ) and markerf standard_level + 1 ] to ( ( standard_level + 2 ) being left shifted standard_log ) - 1 and then the standard_level to standard_level + 2. 3. The method mark_of receives the integer standard and if ( standard and 1 ) equals one, then returns the global markerfstandard] decreasing by one after the method is terminate, otherwise the global marker[standard] increasing by one after the method is terminate. 4. The method of_associative_sys receives the 64 bit integer H and returns the bit set to the statement equivalent to( ( H & fulljrnost_left_only ) equals 0 ). 5. The method st_level receives the 64 bit integer x and calling with the argument x the method of_associative_sys, if the returned bit equls one then st_level returns ( offset of x ) right shifted standard_log_plus_one bits, otherwise it returns ( ( base of x ) and except_of_most_left ) right shifted standard_log bits. The 'combinate' method ofthe system ofthe invention The 'combinate' method is the method ofthe invention 'combinative pointer' and receives in the following order the following arguments: the P_by NP being the P_by ofthe normative parent, the P_by AP being the P_by ofthe associative parent, the bit to_write set as a default to to_get, the bit is_minus set as a default to zero, the 4 byte Nst being the standard ofthe normative parent set as a default to no_st, the 4 byte Ast being the standard ofthe associative parent set as a default to no_st, and the bit associative_sys set as a default to Is_normative_sys. The method first checks and prepares the coherence and then is applied from the the fifth instruction. The instructions ofthe method are following: The first instruction is: if to_write equals zero, then if most significant bit (MSB) of (base of Pc of NP) equals one or * most significant bit (MSB) of (base of Pc of AP) equals one, then the method is terminate with error number 103, otherwise go to the fifth instruction. The second instruction is: if ( ( (Nst equals equals -1) or( Nst equals ( base of Pc of NP) right shifted standard_log bits ) and most significant bit (MSB) of( base of Pc ofNP) equals zero ) ) and ( (Ast equals equals -1) or ( Nst equals ( base of Pc of AP) right shifted standard_log bits ) and most significant bit (MSB) of( base of Pc of AP) equals zero ) ) is false, then the method is terminate with error number 103. The third instruction is: if( most significant bit (MSB) of( base of Pc of NP) equals one and Nst is not equal no_st ) is false, then go to the fourth instruction, otherwise call with the arguments NP and bit being set to zero the method theJUi and then if ( is_old equals one and most significant bit (MSB) of( base ofthe Pc of object pointed by P_0 ) equals one ) is false, then the method is terminate with error number 103, otherwise set the base of Pc of NP to the return argument ofthe method mark_of called with the argument Nst and then the base of Pc of object pointed by P_0 to base of Pc of NP. The fourth instruction is: if( most significant bit (MSB) of( base of Pc of AP) equals one and Ast is not equal no_st ) is false, then go to the fifth instruction, otherwise call with the arguments AP and bit being set to zero the method the_Ui and then if ( is_old equals one and most significant bit (MSB) of( base ofthe Pc of object pointed by P_0 ) equals one . ) is false, then the method is terminate with error number 103, otherwise set the base of Pc of AP to the return argument ofthe method mark_of called with the argument Nst and then the base of Pc of object pointed by P_0 to base of Pc of AP. The fifth instruction is: initiate the 8 byte variables AUi so that its base is set to the base of Pc of Ap and its offset is set to ( the base of Pc of Np ) * 2 + is_minus and NUi so that its base is set to ( the base of Pc of Np ) + most_left_only and its offset is set to ( the base of Pc of Ap ) * 2 + is_minus. The sixth instruction is: if ( to_write equals one ), then go to the seventh instruction, otherwise if ( associative_sys equals one ), . then call with the arguments AUi and bit being set to to_write the method the_Ui, otherwise call with the arguments NUi and bit being set to to_write the method theJUi and the method is terminate. The seventh instruction is: call with the arguments AUi and bit being set to to_write the method the_Ui and then if ( is_old equals one ) then call with the arguments NUi and bit being set to to_write the method the_Ui otherwise set the Ii ofthe object pointed by P_0 to AP * 2 and set the Oi ofthe object pointed by P_0 to NP * 2 and then call with the arguments NUi and bit being set to to_write the method the_Ui and then set the Ii ofthe object pointed by P_0 to AP * 2 and set the Oi ofthe object pointed by P__0 to NP * 2 and set the base of Pc ofthe object pointed by P_0 to most_left__only. (End ofthe combinate method) The method collection_of receives in the following order the following arguments: the bit associative_sys, the object tHis, the integer max, and the integer function and then if ( the most significant bit (MSB) of( base of Pc of tHis ) equals one ), then the method returns max otherwise if (associativejsys equals zero), then the method sets the base of Pc of tHis to the base of Pc of tHis + most_left_only and then the method initiates object ofthe type manage_collection, so that it is set to the return argument ofthe method set_step_block called with the arguments base of Pc of tHis and zero and then if stop ofthe object equals zero, then as long as the ( base of Ui ofthe object pointed by P_0 ofthe object equals the base of Pc of tHis and max decreased by one is not equal zero ) doing the following instructions: first instruction of calling with the following arguments and the following order function , pointer to object and associative_sys the method P_function, second instruction of if left_to_do of object is bigger then zero, then moving the pointer to object back one step and decreasing the left_to_do ofthe object, otherwise setting the object to the return argument ofthe method step_block_back called with the argument object and then if the stop ofthe object equals one, then the method returning max. The method returns max when it is terminate after its loop fails. (End ofthe method collection_of) The method old_under receives in the following order the following arguments: the P_by NP being the P_by ofthe normative parent, the P_by AP being the P_by ofthe associative parent, the bit is_minus set as a default to zero and the bit associative_sys set as a default to Is_normative_sys and then call with the following arguments and the following order NP, AP ,bit set to zero, is_minus, no_st, no_st and associative_sys the method combinate, and returns the P_by ofthe object pointed by P_0. (End ofthe method old_under) The method of_input_argument_under receives in the following order the following arguments: the P_by NP being the P_by ofthe normative parent, the P_by la being the P_by ofthe input argument parent and the bit is_minus set as a default to zero and then sets the base ofthe Pc ofthe la to the offset ofthe Ui ofthe la and then call with the following arguments and the following order NP, la ,bit set to zero and isjninus the method combinate, and returns the P_by ofthe object pointed by P_0. (End ofthe of_iαput^_argument_under method) The method new_under receives in the following order the following arguments the P_by NP being the P_by ofthe normative parent, the P__by AP being the P_by ofthe associative parent, the 4 byte Nst being the standard ofthe normative parent set as a default to -1, the 4 byte Ast being the standard ofthe associative parent set as a default to -1, the bit isjninus set as a default to zero and the 4 byte Cst being the standard of object as a default to -1, and then call with the following arguments and the following order NP, AP -bit set to one, is_minus, Nst and Ast the method combinate, and then if ( ( the most significant bit (MSB) of base of Pc ofthe object pointed by P_0 ) equals one and Cst > -1 ), then set the base of Pc of object pointed by P_0 to the return argument ofthe method mark_of called with the argument Cst and then returns the P_by ofthe object pointed by P_0. (End ofthe method new_under) The method new_of receives in the following order the following arguments: the P_by AP being the P_by ofthe associative parent, the 4 byte Nst being the standard ofthe normative parent set as a default to -1, the 4 byte Ast being the standard ofthe associative parent set as a default to -1, the bit is_minus set as a default to zero and the 4 byte Cst being the standard of obj ect as a default to - 1 , and then call with the following arguments and the following order P_by ofthe object pointed by P_0, AP ,bit set to one, is_minus, Nst and Ast the method combinate, and then if ( ( the most significant bit (MSB) of base of Pc ofthe object pointed by P_0 ) equals one and Cst > -1 ). then set the base of Pc of object pointed by P_0 to the return argument ofthe method mark_of called with the argument Cst and then returns the P_by ofthe object pointed by P_0. (End ofthe method new_of) The method new_input_argument_under receives in the following order the following arguments: the P_by NP being the P_by ofthe normative parent, the P_by la being the P_by ofthe input argument parent, the 4 byte Nst being the standard ofthe normative parent set as a default to -1, the bit isjninus set as a default to zero and the 4 byte Cst being the standard of object as a default to -1, and then sets the base ofthe Pc ofthe la to the offset ofthe Ui ofthe la and then call with the following arguments and the following order NP, la ,bit set to one, isjminus, Nst and no_st the method combinate,- and then if ( ( the most significant bit (MSB) of base of Pc ofthe objcet pointed by P_0 ) equals one and Cst > -1 ), then set the base of Pc of object pointed by P_0 to the return argument ofthe method mark_of called with the argument Cst and then returns the P_by ofthe objcet pointed by P_0. (End ofthe method new_input_argument_under) The method install_Pile The instructions ofthe method are following: The first instruction is Call the method set_the_standards and then initiate two obj ects, one of which Ui = zero and the other of which Ui = full_most_left_only, so that their Oi = zero,Ii = zero and Pc = zero and then set the pointer P_0 pointing to the object of which Ui = full_most_left_only and then set the base of Pc of object pointed by P_0 to the return argument of the method mark_of called with the argument of_default. The second instruction is Initiate the 2 byte variable last_frame, so that last_frame is set to zero and then initiate the P_by global variables of an array in the size of PileMAXframe named frame and then set frame[ last_frame ] to P_by ofthe object pointed by P_0 and then initiate the P_by variable a_a and then set Ui of a_a to 4 and then set frame[ last_frame ] to the return argument of the method new_input_argument_under called with the following arguments and the following order framef last_frame ] , a_a , of_default , bit set to zero and of_default and then set lastjnrame to last rame + 1 and then set frame[ last_frame ] to the return argument ofthe method new_input_argument_under called with the following arguments and the following order frame[ pileJMP ], framef pileJSfP ], of_default, of_default , bit set to zero and of up and then set last_frame to last_frame + 1 and then initiate the P_by variable up , so that up is set to frame[data_NP ] and then as long as ( last_frame < PileMAXframe) set frame[ last_frame ] to ■ the return argument ofthe method new_under called with the following arguments and the following order up,frame[ last_frame -1] , of_up , last_frame-l , bit set to zero and lastjrame and last_frame to lastjrame + 1. (End ofthe method install_Pile) The following methods are derived from C language The method write_data receives in the following order the following arguments: The pointer to 1 byte figure and the 4 bytes byte_size. The first instruction is: initiate the 4 bytes variable Location set to 1, the 4 bytes variable open set to 0, the 4 bytes variable M_bits, the 4 bytes variable M_bits_or the 1 byte variable M, the 1 byte variable last_M set to 0, the 1 byte variable of_st set to of_crude, the pointer to 8 byte figures, the Pj y variable crude_figure, the P_by variable crude_data_NP set to frame[crude_NP ] the array in the size of max_M of P Joy variables prev_ordinJNP, the array in the size of maxJVf of P_by variables ordin_NP, the array in the size of maxjvl of P Jay variables complJNP, the P Joy variable HW, the P_by variable HW_parent set to frame[add_beforeJStP], the P_by variable last_ordin, the P_by variable last_compl, the bit tojoositate set to zero. The second instruction is: set crade_figure.Ui to 0 figure to figure + byte_size and then figures to figure being formed as pointer to 8 bytes. The third instruction is: for ( ; Location <= byte_size; Location++, of_st = of_crude ) {if(!((Location-l)&7)) figureS~;//txt crude_fϊgure.Ui.C[0] = fιgureS->C[ 7 - ( ( Location - 1 ) & 7 ) ]; last ordin = new_input_argument_under ( crude_dataJNP, crude_fιgure, of_crude,tojoositate, of_crude+l); M = 0; MJoits = 1; M_bits_or = 0 ; if( !( Location & l )) do {of_st++; last_compl = last_ordin; last_ordin = new_under(ordinJSrP[M],last_ordin,of_st,of_st, to_positate,of_st+l);//S=l,ordinary open Λ = MJoits; M_bits_or += MJoits ; if ( ( Location > ( MJoits «= true )) && ( ! ( Location & M_bits_or ))) {PJoy between = new_under(compl_NP[M],ordmJS[P[M],of_st,of_st,to positate,of _st+l); new_of(last_compl,of_st+l); HW = new_under( HWjparent, ρrev_ordin_NP[M], of HW ,of_st,to_positate,of_HW ); new_under(between,HW,of_st+l,of_HW); } complJNP [M] = last_compl; HW = new_under( HW_parent, ordinJNP[M], ofJHW ,of_st,tojpositate,of_HW ); new_under(complJNP[M], HW, of_st);//,of _HW); //S=l,compl,HW M++; } while ( !( Location & MJoits ) ); if ( Location < byte_size )// else belongs to the remaineS {prev_ordin_NP[M]=ordin_NP[M]; ordin_NP[M] = last_ordin; if ( last_M < M )last_M = M; open Λ = MJoits; //for the remaineS }} The fourth instruction is if(M < lastjvl ) {for( Location-, last_M++, M++; M < lastjvl ; M++ ) {M_bits_or += MJoits; MJoits «= true; iast_compl = last_ordin; of_st = (short)(of_crade + 1 + M ); if( open & MJoits ) last_ordin = new_under(ordinJSrP[M],last_ordin,of_st, (last_ordin.Pc.D.base»25), to_positate,of_st+l); if ( ( Location > ( MJoits )) && ( ! ( Location & M_bits_or ))) {PJoy between=τιew_under(complJSIP|M],ordmJSlP[M],of_st J of_st,to ositate,of_st+ new_of(Iast_compl,of_st+l); new_under(between,HW,of_st+l,of _HW); > complJSTP[M] = last_compl; HW = new_under( HWjparent, ordin_NP[M], of HW ,of_st,to_positate,of_HW ); new_under(last_compl, HW); }} return (last_ordin); (End ofthe method write_data) The method read_dat receives in the following order the following arguments the 8 bytes variable last_where, the 8 bytes variable operate, the pointer to 1 byte figures, the 4 bytes max_size and the bit show. The first instruction is: initiate the 8 bytes variable N ast where set to last_where. The second instruction is: if( of_associative_sys( last_where ) ) {NJast_where.H=last_where ; last_where = (as_normative_sys(NJast_where )).H; } The third instruction is: initiate the 8 bytes array of variables in size maxjvl named NP, the 8 bytes variable crude_dataJSTP set to framefcrudeJSLP ].Ui, the pointer to 8 bytes variable b8_figures set to figures being formed as pointer to 8 bytes, the 8 bytes Ii, the 2 bytes variable LIFO Jd set to 0, the variable object in the type ofthe global object pointed by the pointer P_0, and the 4 bytes variable outSIZE set to 0. The fourth instruction is: theJJi(last_where, false ); if (!is_old) {*figures = '\0'; return(O); } else if(show&& of_crude > stJevel(P_0->by.Ui) ) the_Ui(as_Ni(P_0->to.Ii.H), false ); if( of Jist >= stJevel(P_0->by.Ui) ) {*figures = '\0'; return (outSIZE); } The fifth instruction is: if( is_old ) object = *P_0; else terminate with error number 25 if isJSTEG(object.to.according) react_obj ect(obj ect); else {object.to.according = asJ>Ii(object.to.according); Ii.H = asJSri(object.to.Ii.H); if( of null == stJevel(object.by.Ui) ) the_Ui( Ii.H, false ); else {if ( object.to.Oi.H = crude_dataJNP) {if ( outSIZE >= max_size )return (outSIZE); else {*fϊgures = Ii.C[0]; figures++; outSIZE++; if( LIFOJd ) theJJi( NP[ -LIFOJd ], false ); else {*figures = '\0'; theJJi( objectby .where, false ); return (outSIZE); }}} else {if( of_HW == stJevel(Ii) ) {the_Ui(Ii.H, false ); NP[ LIFOJd++ ] = asJSfi(P_0->to.Ii.H); the_Ui(object.to.according, false ); } else {if(of_counter < stjevel(object.to.θi)) NP[ LIFOJd++ ] = object.to.according; the_Ui( Ii.H , false ); }}} go to the fifth instruction . (End of the method read_dat) Some sample embodiments of functions in the C programming language are attached as an Appendix. These sample embodiments serve to demonstrate the use ofthe previous teachings. The full sample embodiment ofthe system is given as preferred embodiment in a C language program under the following headers: Piletypeji, pileglobalji and ρile_c . It can thus be seen that the invention can be used for constructing and referring objects in a computing environment in a variety of ways. The particulars contained in the above description of sample embodiments should not be construed as limitations ofthe scope ofthe invention, but rather as exemplifications of preferred embodiments thereof. A wide range of variations are possible and will be readily apparent to persons skilled in the art. Accordingly, the scope ofthe invention should be determined not by the embodiments illustrated, but by the appended claims and their legal equivalents. APPENDIX signed long read_data (unsigned int64 last_where, unsigned int64 operate, short to,bool show) {if ( !last_where) return(O); else {Is_txt = true; signed long ret = 0; b8 normative_sys_last_where; norrαative_sys_last_where.H = last_where; ret = read_dat ( normative_sys_last_where.H, operate, inputjouf, input ouf_max, show ); if( ret) P_spread_ou ( to); return (ret) ; } }//read_data ////////////////////// whole reading/////////////////////////////////// signed long read_content ( P_by Class , short to ) {//if( of_associative_sys ( Class. Ui.H ) ) // Class .Ui=as_normative_sys (Class. Ui) ; // use to convert Ui (normative_sys) to Ui (associative_sys) read_N_Ui(Class. Ui.H) ; Class=P_0->by; old_under ( Uses, frame [ contentJSIP ] , Class, to_negate ); if ( ! Uses. old ) { P_err(14); return(O);} read_where ( as_associative_sys (P_0->by.Ui) .H) ; b8 operate = P_0->by. Pc; //get_Ev ( ) ; // old_under ( Uses. frame [ content_NP ] , Class); if ( SUses.old ) { P_err(15); return (0);} read_where ( as_associative_sys (P_0->by.Ui) .H) ; b8 where = P_0->by.Pc; signed long ret = read_data ( // P_0->to.Ev.H // get_Ev() .H where. H , operate. H, _ to, false ) ;// read_data ( P_0->by. value, operate. H, to ) , if(!ret) P_err(16); return (ret ) ; } //read_content signed long read_data_by_list (P_by index, short to ) {of_input_argument_under ( Uses, frame [ listJSTP ] , index); if ( ! Uses. old ){ P_err(17); return(O);} else {Uses .list_index = index. here; P_by Class; read_where ( as_associative_sys (P_0->by .Ui) .H) ; b8 where=P_0->by.Pc; Class. here = where. H // getJSv() .H //P 0->to.Ev.H return (read_content ( Class , to ) ) } }//read_data by list unsigned long get_last_list ( ) {return (as__abs (Uses . last_list_index) ) ; } //Uses . last_list_index»l) ; } unsigned long get_current_list ( ) { return (as_abs (Uses .list__index) ) ; } //{return (Uses . list_index»l) ; } void mSgList() {sprintf( input ->uf, "current in the list is %-121u last is %-121u " , get_current_list ( ) , get_last_list ( ) ) ; P_spread_out ( 5 ) ; } void read_from_list (int seting) {seting += seting; if ( seting <= Uses . last_list_index && seting > 1 ) { P_by index; index.where = seting; read_data_by_list ( index ,1); } mSgList ( ) ; } //read_from_list //////////////////////parts ///////////////////////////////////////////////// //////////////////////parts out///////////////////////////////////////////////// ■ I l l l/ lllll I Sub-sequence///////////////////////// int get_containing_Interval ( P_object *interval, int max, int function = 2 ) {//max -= collection_of ( Is_associative_sys, *interval, max, 200+Is_associative_sys) ; //function) ; //by associative_sys representing the PREVIOUS intervals also containing the current interval //max -= collection_of ( Is_normative_sys, *interval, max, 200+Is_normative_sys) ; // function) ; //by normative_sys representing the NEXT intervals also containing the current interval return (max) ; } int Grow_by_Interval ( P_object ^interval, int maximim, int function = 2 ) {int max = 4, stck_control = maximim; P_object stack[0x2000] ; Uses. stack_Pjθ = stack; while (stck_control—) {//max -= collection_of ( Is_associative_sys, *interval, max, 100+Is_associative_sys) ; //function) ; //by associative_sys representing the PREVIOUS intervals also containing the current interval //max -= collection_of ( Is_normative_sys, *interval, max, 100+Is__normative_sys) ; // function) ; //by normative_sys representing the NEXT intervals also containing the current interval if ( Uses . stack_P_0 == &stack[0] ) return (max) ; else {Uses. stack_P_0—; *interval = *Uses . stack_P_0; }} return (max) ; } signed long lay_data_part_out (Pjoy object, short to,bool to_cmp,bool show)//,bool to_show=true) // (unsigned int64 last_where, short to^bool to_cmp,bool show)//, bool to_show=true) {if (! object .where) return (0); // P_by object; object . where=last_where; // old_under (Uses . frame [counter_NP ], object); //if ( lUses.old) //retur (0) ; // b8 last = get_Ev(); //P_0->to.Ev; signed long size; //size = read_data (object .where, 0,to ); if ( show ) {size = read_data (object .where, 0,200 , show) ; } else size = read_data (ob ect .where, 0, to, show ); if (size) {if( to_cmp ) {memcpyt working_pointer, input_buf, size ); working_pointer+=size; } //object=P_0->by; if ( show ) { //read_where read_N_Ui ( object. where ) ; //object .where // Grow_by_Interval(P_0, 20, 2); get_containing_Interval ( P_0, 20, 2 );//// int get_containing_Interval ( P_object *interval, int max, int function = 2 ); } old_under (Uses . frame [counterJSFP ], object); //if ( !Uses .old) // return (0) ; /* b8 first = get_Ev ( ) ; sprintf ( input_buf "\r\n\ the automatic counters of THE SUB INTERVAL were:\r\n\ (of the first, of the last)\r\n\ usage = (%lu ,%lu)\r\n\ essentiality = (%lu ,%lu)" , first . D . offset//P_0->to . Ev. D . offset , last .D. offset , first . D . base//P_0->to . Ev. D . base , last . D.base ) ; P_spr ead_ out ( to ) ; * / } return (size) ; } //lay_data_part_out bool collect_out (P_double_by collect, short to, bool to_cmp,bool show) {bool ret = false; if (lay_data_part_out (collect .m[0] , to, to_cmp, show)) ret = true; if (lay_data_part_out (collect ,m[l] , to, to_cmp, show)) ret = true; return (ret) ; } //collect_out /* P_double — by collect_from(P_double_by to_read, short to, bool with_crossing,bool show) {if (with_crossing) collect_out (to_read, to, true, show) ;//, false) ; return ( to_read) ; } //collect_f rom */ bool comparE ( unsigned char *cmp,long cmp_size, unsigned char *data, long size , short to, char str_of[] ) {//scan in the range cmp_size for to find all parts of cmp in data unsigned char *c = cmp, *d = data; while ( size > d - data && cmp_size > c - cmp ) {//if cmp is found in data then increses both else increses just cmp pointer/s while (*c == *d) { C++; d++; } //if ( size == d - data break; else for ( c = cmp; *d; ) C++; } bool ok = ( size <= d - data ) ; if ( ok ) //if true then all the parts are found { sprintf (inputJouf, "\r\n\ ! ! ! all %s crossed!!!" , str of) P_spread_out (to ) ; } else { char *out_to_put; if ( ( out_to_put = ( char * ) malloc size+1 )) == NULL) P err (2) rαemcpy (out_to_put, data, size) ; out_to_put +=size; *out_to_put='\0' ; out_to_put -=size; sprintf (input_buf, "\r\n\! ! ! FAILE of %s at %d I I I \r\n%s ,str_of,d - data , out_to_put) ; if (to) { P_spread_out (-103 ) ; P_spread_out (to );} else P_spread_out (2 ); free (out_to_put) ; } return (ok) ; } //comper //////////////////////parts matching /////////////////////////////////////////// //At any m, when building the next seq from the current seq, //bouth of the current m, //so that the next m uses the next seq of the previous m as its current seq, //when ft == true the case is SH starting with the complentrary case //and when ft == false the case is UN starting with the ordinary case, //the next->m[0] [1] and the next->m[2] [1] of SH are used for building //the next m from_SH, when the case is denoted as SH 0,2 -> //and the next->m[l] [1] and the next->m[3] [1] of UN are used for building //the next m fromJN, when the case is denoted as UN 1,3 -> . inline bool check_first_m_ft ( seq * current, seq * next , bool ft) {//TO DO return true; } P_double_by make_first_seq ( seq *current, seq *next, . bool ft , short n)//m==l { P_double_by to_read ; to_read.msg=0 ; to read.m[0] . Pc.D. offset = 0; to_read.m[l] .Ui.H = 0; if ( n == 3 )//n==3 4 figures {if (ft) { //return (m_SH (current, next) ); //ft, m == 1 any sequance//n==3, 4 figures // P_by up = Uses. frame [data_NP] ; // <== any M , s = 0, next->m[l] [1] = old_under ( next->m[0] [0] , current->m[l] [1] ); //between if ( !Uses.old ) to_read.msg = 7; else {next->m[2] [0] = current->m[2] [1] ; // UPUPUPUP//2th_q s_0 =(up,2th_q s_l) next->m[3] [1] = old_under ( next->m[2] [0] , current->m[3] [1] ) ; if ( lUses.old) to_read.msg = 2; //between | ->2th_q s_l =(2th_q s_0, 2th__ordin s_l) else {to_read.m[l] = next->m[3] [1] ; //to_read.by . where=P__0->b . where; next->m[3] [0] = current->m[3] [1] ; // UPUPUPUP//2th_ordin s ^ l= (up, 2th_ordin s_l) next->m[l] [0] = current->m[l] [1] ; // UPUPUPUP//lth_ordin_s_0 =(up, lth_ordin_s_0 ) next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ) ; if ( [Uses . old) to_read.msg = 5; //lth_ordin_s_l = (lth_ordin_s_0, 2th_compl_s_l, ) else {old_under (next->m[l] [1] , current->m[2] [1] ) ; to_read.m[0] = P_0->by; }}}} else { //return (m_UN (current, next) ); //not ft,m == l,any sequance//n==3, figures next->m[2] [1] = old_under ( next->m[l] [0] , current->m [2 ] [1] ); //between if ( lUses.old ) to_read.msg = 7; else {old__under( next->m[2] [1] , current->m[3] [1] ) ; next->m[l] [1] = old__under ( next->m[0] [0] , current->m[l] [1] ) ; if ( lϋses.old ) to_read.msg = 2; //lth_ordin_s_l = ( lth_ordin_s_0 , 1 th_compl_s_l ) else {next->m[3] [1] = old_under ( next->m[2] [0] , current->rα[3] [1] ) ; if ( lUses.old ) {to_read ' msg = 3;//2th_ordin_s_l = ( 2th_ordin_s_0, 2th_compl_s_l) to_read.m[0] = next->m[l] [1] ; } else to_read.m[0] = P_0->by; }}}} . else {if ( n == 2 ) //n==2 3 figures {if (ft) //return (m_3 3H (current, next) ) ; {//P_by up = Uses. frame [data_NP] ; // <== any M , s = 0, next->m[0] [1] = old_under ( next->m[3] [0], current- >m[0] [1] ) ;//ordinS_l if ( lUses.old ) to_read.msg = 9; else {next->m[l] [1] = old_under ( next->m[0] [0] , current- >m[l] [1] ) ; //between if ( lUses.old ) to_read.msg = 7; else {next->m[2] [0] = current->m[2] [1] ; // UPUPUPUP //2th_q s_0 =(up,2th_q s_l) to_read.m[0] = next->m[l] [1] ; next->m[l] [0] = current->m[l] [1] ; // UPUPUPUP//lth_ordin_s_0 =(up, lth_ordin_s_0) next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ) ; if ( lUses.old ) to_read.msg = 5; //lth_ordin_s_l = (lth_ordin_s_0, 2th_compl_s_l, ) else to_read.m[l] = next->m[2] [1] ; } }} else//return ( m_3_UN (current, next) ) ; {next->m[2] [1] = old_under ( next->m[l] [0] , current->m [2 ] [1] ); //between if ( lUses.old ) to_read.msg = 1; else {to_read.m[0] = P_0->by; next->m[l] [1] = old_under ( next->m[0] [0] , current->m[l] [1] ) ; if ( lUses.old ) to_read.msg = 2; //lth_ordin_s_l = ( lth_ordin_s_0 , lth_compl_s_l ) to_read.m[0] = next->m[l] [1] ; //} } to_read.m[l] = next->m[2] [1] ; }} else//n==0| |1 {if( n ) //n==l//2 figure {to_read.m[l] = next->m[3] [1] ; next->m[l] [1] = old_under (next->m[0] [0] , current->m[l] [1] ) ; if ( Uses. old ) to_read.m[0] = next->m[l] [1] ; //to_read.by = P_0- >by;//ft-» ordin // ! ft-»between else {to_read.msg = 3; return (to_read) ;} // collect [l+init[0] ] [0] = collect_from(to_read, 0) ; } else//n==0 1 figures { to_read.m[l] = next->m[0] [0] ; //current->m[0] [1] .where; next->m[0] [1] = old_under ( next->m[3] [0] , current- >m[0] [1] ) ; ////seconde between or seconde ordin when m==0 if (lUses.old ) {to_read.msg = 2; return (to_read) ; } else to_read.m[0] = next->m[0] [1] ; // collect [l+init[0] ] [0] = collect_from (to_read, 0) ; }}} return (to_read) ; }//make_first_seq //if (st_level (P_0->by.Ui . D.base )==of_null) P_err (3) ; void Switch (signed char m, unsigned long *calculate, bool *sw ,bool *full, bool *ft) {*calculate += (1 « m) ; //the writing begining - the reading begining *sw = true;// if (*ft) *full Λ = true; //becouse ft didn't complete the n=3 ( for to re begin the sequence) for ( ;m<max_M; m++, ft++ ) *ft =true; } long set_pile_objectS_to ( unsigned char *figure, unsigned long byte_size, short to, bool with_crossing, bool show) //COMPLETING REQUIRES THE FOLLOWING: // // 0. testing on written data decreased from end and/of from beginning // 1. check_first_m_ft // // 2. applying the remains case which pass through NULLDATA NP // // Ξ covering the alternatives by // a. P_erroring the alternatives like the 100 // b. for( short ft=0; ft<32; ft++) if (ok) for . // // the growing data which will use II S = 3 and fan_op and gate_density (pilecon. { // SH_fr_UN_fulll UN_fr_SH_ful01 SH_fr_ SH JϊuOll UN_fr_ UN fuOOl II SH_fr_UN_hall0 UN_fr SH hal00 ~ SH fr SH haOlO UN_fr_UN_ha000 //x {3,2,1,2}{0,1,0,3}{3,0,3,2}{2,1,0,1} 2, 1,0,1} {0,3, 2, 3} {3, 2, 1,2} {0,1, 0,3} I/Y {3, 1,1, 3} {1,3, 3,1} {0,2, 2,0} {2, 0,0, 2} 2,0,0,2}{2,0,0,2}{3,1,1,3}{1,3,3,1} //z {2, 1,1,1} {0,3, 3,1} {3, 2, 2,0} {1,0, 0,0} 2,1,1,2}{0,3,3,2}{1,0,2,3}{1,0,0,3} P_by t[ll]; //SH fr UN hall0(AND init) //x{0, 0, 0 0}, {l, 0,0,0}, z{4,0, 0,0}; t[8] .Ui.C[0]=0; t[8] .Ui.C[l =0; t[8 .Ui.C[2]=0; t[8] .Ui.C[3]=0;//x t[8] .Ui.C[4]=l; t[8] .Ui.C[5 =0; t[8 .Ui.C[6]=0; t[8] .Ui.C[7]=0;//y t[8] .Pc.C[0]=4; t[8] .Pc.C[l =0; t[8 .Pc.C[2]=0; t[8] .Pc.C[3]=0;//z //SH_fr_SH_ha010(AND init)/ x{0,0,0 0}, y{2, 0,0,0}, z{4, 0,0,0}; t[9] .Ui.C[0]=0; t[9] .Ui.C[l =0; t[9 .Ui.C[2]=0; t[9] .ϋi.C [3] =0; //x t[9] .Ui.C[4]=2; t[9] .Ui.C[5 =0; t[9 .Ui.C[6]=0; t[9] .Ui.C[7]=0;//y t[9] .Pc.C[0]=4; t[9] .Pc.C[l =0; t[9 .Pc.C[2]=0; t[9] .Pc.C[3]=0;//z //UN ' fr UN haOOO (AND init) //x{0, 1, , }, {l, 3,3,4}, z{l, 0,4,4}; t[10] .Ui.C[0]=0; t[10] .Ui.C 1]=1 10] .Ui.C[2]=0; t[10] .Ui.C [3] =4; //x t[10] .Ui.C[4]=l; t[10] .Ui.C 5] =3 10] .Ui.C[6]=3; t[10] .Ui. C [7] =4; //y t[10] .Pc.C[0]=l; t[10] .Pc.C 1]=0 10] .Pc.C[2]=4; t[10] . Pc.C [3] =4; //z // SH fr UN fulll t[7 Ui . C [ 0 ] =3 ; t [ 7 ] . Ui . C [ 1 t[7 .Ui.C [2 t[7 ,Ui.C[3 =2;//x t[7 Ui.C[4]=3; t[7] .Ui.C[5 t[7 .Ui.C [6 t[7 ,Ui.C[7 =3;//y t[7 Pc.C[0]=2; t[7] .Pc.C[l t[7 .Pc.C[2 t[7 ,Pc.C[3 =l;//z //SH _fr_UN_hall0 (NOT init) t[6 .Ui.C[0]=0; t [6] .Ui.C[l t[6 .Ui.C[2 t[6 ,Ui.C[3 =3;//x t[6 .Ui.C[4]=l; t [6] .Ui.C[5 t[6 .Ui.C [6 t[6 .Ui.C[7 =l;//y t[6 .Pc.C[0]=0; t[6] .Pc.C[l t[6 .Pc.C [2 t[6 ,Pc.C[3 =l;//z //UN fr_SH_ful01 t[5 .Ui.C[0]=3; t [5] .Ui.C[l =0 t[5 ,Ui.C[2 t[5 ,Ui.C[3 =2;//x t[5 .Ui.C[4]=0; t[5] .Ui.C[5 =2 t[5 .Ui.C [6 t[5 , Ui.C [7 =0;//y t[5 . Pc.C[0]=3; t [5] .Pc.C[l =2 t[5 ,Pc.C[2 t[5 ,Pc.C[3 =0;//z //UN fr SH halOO t[4 Ui . C [ 0 =2; t[4] .Ui.C[l t[4 .Ui.C [2 t[4 ,Ui.C[3 =1 //x t[4 Ui . C [ 4 =2; t[4] .Ui.C[5 t[4 . Ui . C [ 6 t[4 ,Ui.C[7 =2 //y t[4 Pc.C[0 =1; t[4] .Pc.C[l t[4 .Pc.C[2 t[4 ,Pc.C[3 =0 //z //SH _fr_SH_ fuOll t[3 .Ui . C [ 0 =2; t[3] .Ui.C[l =1; t[3 .Ui.C [2 t[3 .Ui ,C[3 =1 //x t[3 .Ui.C[4 =2; t[3] .Ui.C[5 =0; t[3 .Ui.C [6 t[3 .Ui ,C[7 =2 //y t[3 .Pc.C[0 =2; t[3] .Pc.C[l =1; t[3 .Pc.C[2 t[3 . Pc ,C[3 =2 //z //SH fr SH haOlO (NOT init) t[2 .Ui.C[0 =0; t[2] .Ui.C[l t[2 .Ui.C [2 t[2 .Ui.C[3 =3;//x t[2 .Ui.C[4 =2; t[2] ' .Ui.C[5 t[2 .Ui.C [6 t[2 .Ui.C[7 =2;//y t[2 .Pc.C[0 =0; t[2] .Pc.C[l t[2 .Pc.C[2 t[2 .Pc.C[3 =2;//z //UN _fr_UN_ fuOOl . t[l .Ui.C[0 =3; t [1] .Ui.Cfl =2 t[l .Ui.C[2 t[l .Ui.C[3 =2;//x t[l .Ui.C[4 =3; t[l] .Ui.C[5 =1 t[l . Ui . C [ 6 t[l .Ui.C[7 =3;//y t[l .Pc.C[0 =1; t[l] .Pc.Cfl =0 t[l ,Pc.C[2 t[l .Pc.C[3 =3;//z //UN_fr_UN_ha0O0 (NOT init) t[0] .Ui.C[0]=0; t[0] .ϋi.C[l]=l; t[0] .Ui.C[2]=0; t[0] .Ui .C [3] =3; //x t[0] .Ui.C[4]=l; t[0] .Ui C[5]=3; t[0] .Ui.C[6]=3; t [0] .Ui .C [7] =1; //y t[0] .Pc.C[0]=l; t[0] .Pc C[1]=0; t[0] .Pc.C[2]=0; t [0] . Pc.C [3] =3; //z P by THE [max M] [4] [2] // the figure mirror THE [m] [n] [s] P_double_by to_read, //to_read=P_0->by collect [3] [max_M] ; //collect [col] =to_read. by. where; //for out put // to_RE_read; // seq last_switched[max_M] ; //for the case of ok=false and calculate>0 unsigned long calculate=0; // calculate+= l«m; //the writing begining - the reading begining bool ft [max_M] , //shift sw [max_M] , //switch full [max_M] , //seconde sequnce init [max_M] , //first time at current m init_0, ok; //maxji] ] ; //ok unsigned long Location = 1; //of the data figure figure += byte_size; //backward writing for reading with no size b8 *data_figureS = (b8*) figure; signed char col=0, //; // [3] ; // m, //=0,// m = M + 1 // s,// s is fan layer step increases from 0 down max_m=0, n; // when M < 1, n = ( ( Location ft)- l s == 0 ) ) & // otherwise n = ( ( Location ft)» ( M - 1 ) - ( == 0 ) P_by crude_figure, crude_data_NP = Uses . frame [crude_NP] ;//, //figuers with no loaction at s = 1 // up = Uses. frame [data_NP] ; // <== any M , s = 0, crude_figure . Ui . H 0 to_read.m[0] .Ui.H 0 to_read.m[0] .Pc.H 0 to_read.m[l] .Ui.H 0 to_read.m[l] :Pc.H 0 to_read.msg = 0; //for (short ft=0; ft<2; ft++) for ( ok = true, m=0; m < max_ ; m++ ) {full [m]=true; init [m]=true; ft [m]=false; sw[m]=false; collect [0] [m] = to_read; collect [1] [m] = to_read; collect [2] [m] = to_read; } // object.by. Ui.C[4] crude // object .by . Pc.C [0] »1 association // object. to.0i.C[4] init_0=true; if (with_crossing) working_pointer = (unsigned char working buf->C; for ( m = 0; Location <= byte_size && ok ;Location+=4 , m = 0 {unsigned char last_def ; if (byte_size - Location + 1 > 4) last_def = 4; else last_def = (unsigned char) (byte_size - Location + 1 ); for ( n = 0; n < last def; n++ ) // m = 0, when m = M + 1 , M == -1 {if ( 1 ( ( Location + n - 1 ) & 7 ) ) data_figureS—; crude_figure.Ui.C [0] = data_figureS->C [ 7 - ( ( Location + n - 1 ) & 7 ) ]; THE[0] [n] [l] = of_input__argument_under (crude_data_NP, crude_f igure) ; if ( lUses.old ) return (Location+n) ; //not any such data figure!!! if ( n == 3 ) {if( !init[0]) {init_0 = false; THE[1] [0] [1] = old_under(THE[l] [3] [0],THE[0] [0] [1] ) ; if ( lUses.old | | lcheck_first_m_ft( (seq*)THE[0] , (seq*)THE[l] ,ft[0] ) ) return (Location+n) ; // ok = false;//fail of sequances_check! 11 n=3 } else {seq *current=(seq*)THE[0] , *next= (seq*) THE [1] ; //if (ft [0] = set_first_ft( (seq*) THE [0] , (seq*) THE [1] ,ft[0] ) ) = old_under ( next->m[l-ft [0] ] [0] , current->m[2- if ( Uses. old ) //between {if(ft[0]) old_under( between, current->m[2] [1] ) ; // [2*ft] [ ft] else {P_by HW_parent = Uses . frame [add_before_NP] , ~ HW = old_under( HW_parent, next->m[0] [0] ) ; //l_th if ( Uses. old ) old_under ( between, HW) ; /* if ( lUses.old ) {b8 as_HW; as_HW. D.base = next->m[l-ft [0] ] [0] . Pc. D.base | most_left_only ;// force normative_sys as_HW.D. offset = (current->m[2] [1] . Pc. D.base « 1 ) ;// Cp has no first bit read_N_Ui(as_HW.H) ;// if ( lUses.old ) return (Location+n) ; } */ }// old_under( between, next->m[0] [0] ) ; //l_th if ( lUses.old ) //ft ->the_lth_fm_s2 [m] [0] = !ft- >//the_4th_fm_s2 [m] [1]= {ft[0] Λ = true; between = old_under ( next->m[l-ft [0] ] [0] , current->m[2-ft [0] ] [1] ) ; if ( Uses. old ) {if(ft[0]) old_under( between, current->m[2] [1] ) ; // [2*ft] [ ft] else old_under ( between, next->m[0] [0] ) ; // if ( lUses.old ) return (Location+n) ; }}} if( ft[0]) {to_read.m[0] = THE [1] [0] [0] ; to_read.m[l] = P_0->by; collect [0] [col++] = to_read; Switch ( m, -.calculate, &sw[m], &full[m], &ft[m] ); ft [m] Λ =true; //the for of the Switch shold start at m=l so here recoracting } if ( lUses.old) return (Location+n) ; else {init[0] = false; if (with crossing) collect out (to read, to, true, show) }}} THE[1] [n] [0] = THE[0] [n] [1] ;// UPUPUPUP } //when m = M + 1 to__read = make_first_seq ( (seq*) THE [m] , (seq*) THE [m+l] , ft [m] , — ); if (to_read.msg) {if( init[ m ] && to_read.msg == 100 ) {to_read.m[0] = THE [m+l] [0] [0] ; // to_read.m[0] . Pc. F64. base . t_lc=true; collect [0] [col++] =to__read; if (with_crossing) collect__out (to_read, to, true, show) ;//, false) ; // collect [0] [col++] = collect_from(to_read, to, with_crossing, show) ; Switch ( m, {.calculate, &sw[m], &full[m], &ft[m] ); . } else {collect [1] [ ++max_m ] =to_read; if (with_crossing) collect_out (to_read, to, true, show) ;//, false) ; //collect [1] [ ++max_m ] = collect_from(to_read, to , with_crossing, show) ; ok = false; break; }}//the prove of sequance of making failes collect [ 1 + init_0] [ m ] = to_read; if (with_crossing) collect_out (to_read, to, true, show) ; //collect_from(to_read , to , with__crossing, show) ; m = 1; do {if ( m > 1 && init[ m - 1 ] ) init [ m - 1 ] = false; f ull [ m ] Λ = true; //first f ull [m] =false or second full[m]=true bool fϋ = full[m], sW = sw[m], fT = f t [ ] , iN = init [m] ; /* if( ( iN && IfU ) && ( fT I I ( IfT && IsW ) ) ) to_read = make_seq( (seq*) THE [m] , (seq*) THE [m+l] , t[10-sW- fT] ); else to_read = make_seq( (seq*) THE [m] , (seq*) THE [m+l] , t[ (sW«2) + (fT«l)+fU] ); */ seq *curreht= (seq*) THE [m] , *next= (seq*) THE [m+l] ; P_by op; if ( ( iN && !fU ) && ( f T I I ( IfT && !sW ) ) ) op = [10-sW- fT] ; else op = t[ (sW«2) + (fT«l)+fU] ; // P_object to_read; // P_by up = Uses . frame [dataJSTP] ; to_read.msg = 0; if (op. Pc.C [0] ==4) {next->m[op.Ui.C[0] ] [0] = current->m[op.Ui.C [4] ] [1] ; // UPUPUPUP to_read.m[0] = next->m[op.Ui.C [0] ] [0] ; // to_read.msg = 1; //bzzzzzzzzzz } else {next->m[op.Ui,C[0] ] [0] = current->m[op.Ui.C [4] ] [1] ; // UPUPUPUP to_read.m[l] = next->m[op.Ui . C [0] ] [0] ; next->m[op.Ui.C[l] ] [0] = current->m[op.Ui.C [5] ] [1] ; // UPUPUPUP to_read.m[0] = next->m[op.Ui. C [1] ] [0] ; next->m[op.Ui.C [1] ] [1] = old_under (next->m[op.Ui. C [2] ] [0] , current- >m[op.Ui.C[6] ] [1] ) ; if ( lUses.old ) to_read.rαsg = 3; else {to_read.m[0] = next->m[op .Ui.C [1] ] [1] ; // SH_fr_UN__fu UN_fr_SH_fu SH_fr_SH_fu UN_fr__UN_fu // SH_fr_UN_ha UN_fr_SH_ha SH_fr_SH_ha UN_fr_UN_ha (init) //x {3,2,1,2} {0,1,0,3} {3,0,3,2} {2,1,0,1} {2,1,0,1} {0,3,2,3} {3,2,1,2} {0,1,0,3} {0,1,0,4} //y {3,1,1,3} {1,3,3,1} {0,2,2,0} {2,0,0,2} {2,0,0,2} {2,0,0,2} {3,1,1,3} {1,3,3,1} {1,3,3,4} //z {2,1,1,1} {0,3,3,1} {3,2,2,0} {1,0,0,0} {2,1,1,2} {0,3,3,2} {1,0,2,3} {1,0,0,3} {1,0,4,4} ////////////// //TO DO for entries 1234 and 235 solving request 234 // by marking the alternative to the corrent SH or UN possibility although having success // by HW of the not requested ////////////// if (op.Ui.C[3]<4) {next->m[op.Ui.C[0] ] [1]= old_under (next->m[op.Ui.C [3] ] [0] , current- >m[op.Ui.C[7]] [1]) ; if( lUses.old ) //Location+n==byte_size??? m==l//////////bzzzz to_read.msg = 4; ////15; //cheack_seq else to_read.m[l] = next->m[op.Ui .C [0] ] [1] ; } if (op.Pc.Cfl] < 4 && !to_read.msg ) {//old_under (next->m[op. Pc-.C [0] ] [0] , next->m[op. Pc.C [1] ] [0] ) ;//HW P_by HW_parent = Uses . frame [add_before_NP] , HW = old_under( HW_parent, next->m[op. Pc.C [1] ] [0] ) ; if ( Uses. old ) old_under (next->m[op. Pc.C [0] ] [0] , HW) ; //HW if ( lUses.old) to__read.msg = 100; else {if (op.Pc.C[2]<4) {//old_unde (next->m[op. Pc. C [0] +1] [0] ,next- >m[op.Pc.C[l]+l] [0] ) ;//SW_HW HW ='old_under( HW_parent, next->m[op. Pc.C [1] +1] [0] ) ; old_under (next->m[op. Pc.C [0] +1] [0] ,HW) ; //SW_HW if( Uses. old) {bδ Mi; Mi.H = P_0->to.0i.H ; //b8 Ev= get_Ev () ; sprintf ( inputJouf , "possible shift to forward is noticed but the use for prevention fail cases is not yet implemented\r\nSW_HW : ( %d %d ) Ui=%c Mi=%c Ii=%c" ,op.Pc.C[0]+l ,op.Pc.C[l]+l ,P_O->by.Ui.C[0] , i . C [0] " , P_0- to.Ii.C[0] ) ; P_spread_out ( 103) ; } old_under (next->m[op. Pc.C [2] ] [1] , current->m[op. Pc.C [3] ] [1] ) ; if ( lUses.old) to_read.msg = 5; //the 4th or ordin s_l }}}}} //} //old_unde (Uses .NULLDATAfm] [0] , current->m[y [to_read.by. Pc. D. offset- 1]] [1]); // return (to_read) ; /////////// if ( 1 to_read.msg) { collect [ 1 ] [ m ] =to_read; if (with_crossing) collect_out (to_read, to, true, show) ;// collect_from(to_read , to , with_crossing, show) ; if ( m > max_m ) { max_m = m; collect [ 2 ] [ m ] = collect [ 1 ] [ m ]; 1 else {if ( init[ m ] ) {init[ m ] = false; collect [ 2 ] [ m ] = collect [ 1 ] [ m ] ; else if ( init [ m ] && to_read.msg == 100 ) //to_read.m[0] . Pc. D. offset == 100 ) {collect [0] [col++] = to_read; if (with_crossing) collect_out (to_read, to, true, show) ; //collect_from (to_read, to, with_crossing, show) ; Switch ( m, -.calculate, &sw[m], &full [ ] , &ft[m] ); } else {collect [1] [ ++max_m ] = to_read; if (with_crossing) collect_out (to_read, to, true, show); //collect_from( to_read, to , with_crossing, show) ; ok = false;// ok = false; //the prove of sequance of making failes break; }} while ( full [ m++ ] ); //increasing m after checking full [m] } //Location += n ;//if (n) Location += n - 4 ; if ( lok && Location < byte_size ) return ( Location ); else { // , str_of collecting crossing if (with__crossing) {comparE( ( unsigned char *) working_buf->C, working_pointer- (unsigned char *) working_buf->C, figure - byte_size, byte_size, to, "crossing" ) ; sprintf ( input__buf, "\r\nscond compare \r\n"); P_spread_out ( to) ; } working_pointer = (unsigned char *) working_buf->C; //col—; m = 0; if (col—>0) do{if (collect_out (collect [0] [col] , to, true, show) ) { sprintf ( input_buf, "\r\n\ 11 ! switch of col=%d! I 1 \r\n", col) ; P_spread_out ( to) ; }} while ( col—>0) ; do {for (col=l;col<3;col++) if (collect_out (collect [col] [m] , to, true, show) ) { sprintf ( input_buf , "\r\n\ 1 1 ! collect %d of rα=%d ! ! ! \r\n" , col, m) ; P_spread_out ( to ) ; } } while ( max_m > m++ ) ; comparE ( ( unsigned char * ) working_buf->C, working_pointer- (unsigned char * ) working_buf->C, figure - byte_size, byte_size, to , "collecting" ) ; } if ( int ( -l*calculate) >0 ) return ( -l*calculate ) ; retur ( -l*calculate ) ; } Piletype_h #ifndef piletype_def #define piletype_def // pilecon //#define of_gate 0 //Is . standard_level = 0 //#define of_qualified_up 2 //Is . standard_level = 2 //#define of_qualified_dn 3 //Is . standard_level = 3 #define of_default 0 //Is . standard_level = 1 ttdefine of_up 1 // (of mentioned+1) #define of_class 2 #define of_content 3 #define of_list 4//associated //Is . standard level = 4 #define of_counter 5 #define of null 6 //nulldata #define of_remove 7 #define of_HW 8 // (of_mentioned+l) #define of_crude 9 //—==»> st_of_sys_b//7 of_mentioned + 2 #define pile_NP 0 // .. the corent pile apex (is negative) #define data_NP 1 // , . the data apex ...Up (is negative ) #define classes_NP 2 // , . the classifying apex.. such as the directory struct #define conteήt_NP 3 // ... the child mentioing the class which holdes the data and the child's Ev=Ui for beigin to read data #define list_NP 4 // ... free ordering the content by Uses . For_h by Ev=Ui content #define counterJSIP 5 // ... the counter of usage apex #define NULLDATA_parent 6 // ... NULLDATA #define remove_before_NP 7 //...compresing the first part of string #define add_before_NP 8 //...HW #define crude_NP 9 // ... the crude data apex there data begin #define PileMAXframe 10 //#define of_complementary ( ι3f crude + 1 + max M ) / #define max_M 32 //5 #define standard_max 0x40 //64 #define max_cache .0x4FF//0x4FF //0x4//Ox4FF //0x4//0x4FF//0xFFF//F #define shellSize sizeof (shell ) //0x3C// (0x40-4) //sizeof ( shell ) // sizeof (shell) == 64=4* (3*2)+8* (2+l)+2*8 «( #define max_shell_memb 0x10000 // * 2 * shellSize #define P_objectSize 0x20 // 32 = sizeof ( P_object ) #define max_P_obj ect_memb 0x80 //0x8000//\\0x80//0x800 //OxlOO//! 10x8000// // = P_object__buf_size / P_objectSize #define P_object_buf_size 0x1000 //0xl00000//0xl000//0xl0000//2000 //! 10x100000 // = max_P_object_memb * P_objectSize #define Max_P_object_arry OxFFFF //d400//FFFF #define input_buf_max 0x4FFFF//0xFFFF //#define input_buf_max OxFFFF #define working_buf_size (8*2*input_buf_max) #define max_fold 0x20 #define max s fold 0x10 //0xl00//0x20*0x8//0xl0 #define maxWhereO Oxffffffff // 4294967295L = 2 32 - 1 #define maxWherel 0x7fffffff // 2147483647L = 2 31 - 1 #define minWhat NEG OF (maxWhereO) // /* #define The_entity_id Oxfe // #define The_entity NEG_OF (The_entity__id) // #define The_entity_figue_path NEG_OF(0xff) // #define The_sharingness NEG_OF(0xfd) // #define The exclusiveness NEG OF(Oxfc) // */ #define idP 0 // cuP(kos) #define idL 1 // bowL(keara) #define idG 2 // #define id ' S 2 // Shell #define idC 3 // cache #define idMIN 1 #define idMAX 0 #define idMID 2 //- -globals types typedef union { // sizeof (bl) == 1 signed char c; unsigned char C; } bl; typedef union { // sizeof (b2) == 2 signed char c[2]; unsigned char C[2]; signed short i; unsigned short I; '' } b2; typedef struct { // sizeof (flag32) ) == 4 unsigned int t 00 : 1; unsigned int t 01 : : 1 unsigned int t_02 : 1; unsigned int t 03 : : 1 unsigned int t_04 : 1 ; unsigned int t 05 : : 1 unsigned int t_06 : 1; unsigned int t 07 : : 1 unsigned int t_08 : 1 ; unsigned int t 09 : : 1 unsigned int t_0a : 1; unsigned int t 0b : : 1 unsigned int t_0c :1; unsigned int t Od : : 1 unsigned int t_0e : 1; unsigned int t Of : : 1 unsigned int t_10 : 1; unsigned int t 11 : : 1 unsigned int t_12 :1; unsigned int t 13 : : 1 unsigned int t_ 14 :1; unsigned int t 15 : : 1 unsigned int t_16:l; unsigned int t 17 : : 1 unsigned int t_18:l; unsigned int t 19 : : 1 unsigned . int t_la:l; unsigned int t lb : : 1 unsigned int t_lc:l; unsigned int t Id : : 1 unsigned int t le:l; unsigned int t If : : 1 }flag32; typedef union { // sizeof (b4) == 4 signed char c[4]; unsigned char C[4]; signed short i[2]; unsigned short I [2]; signed long 1; unsigned long L; } b4; typedef union { // sizeof (b8) == 8 signed char c[8]; unsigned char C[8]; signed short i[4]; unsigned short I [4]; signed long 1[2]; unsigned long L[2]; //L [0]==D. offset, L [1] ==D.base struct { unsigned long offset, base; } D; struct { flag32 offset, base; } F64; unsigned int64 H; // void *v; } b8; typedef struct {// sizeof (P_by) == 16 union { unsigned int64 where; b8 Ui; }; //where is the unique identifier Ui of the pile object, union { unsigned int64 value; b8 Pc; }; //value is the private characteristic Pc of the pile object } P_by; // and those are the pile object charectrsics // in the matter of one ( being pointed ) by many pile objects. typedef struct {// sizeof (P_to) == 16 union { unsigned int64 according; b8 Oi; } ; //according is the outer identifier Oi of the pile object, // union { unsigned int64 exclusive; b8 Ev; } ;//resereved for data included in the object union { unsigned int64 what; b8 Ii; } ;//what is the inner identifier Ii of the pile object } P_to; // and those are the pile objects charectrsics // in the matter of many ( pointing to ) ' one pile object typedef struct { P_by by; P_to to; } P_object; //the pile object has P_object stracture including //the matte of one ( being pointed ) by many pile objects //and the matter of many ( pointing to ) one pile object. typedef struct {P_by m[4] [2] ; } seq; //[n][s] typedef struct {P_by m[2] ;unsigned long msg;} P_double_by; typedef struct {P_object *ram[2]; } Ram; typedef struct { //sizeof (cache) =32 b8 edge; P_object *rarα[2]; //2 * 32bit pointer to U_P_0 signed long uses [2],// amount of using that arry. to_S, // updated when moving in S to_I; //appear;//, //oredered by appear the int . cach_index [max_cache] ; returns the M_S-UM S } cache; typedef struct { //sizeof (cache__i) =8 signed long to_C; // updated when moving in index signed long appear;//, //oredered by appear the int cach_inde [max_cache] ; returns the M_S-UM_S } cache_i; typedef struct { // sizeof (shell) == 32 b8 edge; // those are whereL at the edeges of arry , // and Is. id = // ( S->edge[idL] .L[l] > WHERE. L[l] | | // ( S->edge[idL] .L[l] == WHERE. L[l] && S->edge [idL] . L [0] > WHERE. L[0] ) ) ; // and if S->uses[idL ] ==0 edge [idG] ==edge [idL] // and S->edge[idP] > S->edge[idL] => S->edge[idG] // and i ( total [idS] > S - US ) S->edge[idG] > ++S- >edge [idP] . signed long appear, //if appear <0 so not in ram but in the file// for discision if file or ram . file [2],// location in the "P_object .p64" file . uses [2],// amount of using that arry. bit_size; // if bit_size==0 so it is the default case // else bit_size is the number of bits // for a value in R[r], // so that at is_step * bit_size // according is sheard // what == the_general_what + is_step // where. L == the general_where + is step } shell; typedef struct { // sizeof (Ob_pile_access) == // void ■ // *forrα bool id, // Is. id == false as idP or Is. id == true as idL. // old, // Is. old == false as new or Is. old == true as old bleft, bright; // unsigned long // r; // (is)?f=S->ram[idL] :f=S->ram[idP] so then R[r] b8 midle, //those left, //are right; //for to get back if there was no writing } Ob_pile_access; typedef struct { P_object *stack_P_0; bool old; signed long P_objectEOF, // Is.P objectEOF == filelength (A. P_object_) . total [4] , // the total uses amount by id P,L,S // if ( Is. total [3] ' < Is.RAMcounterEND - 2 ) RAMcounterEND; // bu er units maximum number of R arry unsigned long marker [standard_max] ; //marker [standard_level] unsigned int list_index, last_list_index; // short // last_frame; P_by // NULLDATA[max_M] , frame [PileMAXframe] ; //frame [last_frame] bool pile_state_is ; } g_pile_access; typedef struct { unsigned long old; P_by action_outcome ; } out_write_data; typedef struct { shell *S; cache *C; P_object *P_0; b8 first; unsigned long left_to_do; // bool is_object; bool id; bool stop; } manage__collection; /* typedef struct { bool is_base_l, is_base_2; unsigned long compare_l, compare_2; range step_l, step Z;- } manage_range; */ #endif /* typedef struct { bool old, id; signed long lefted; shell *S; P_object *ram[2]; cache *C; P_object *R; l } alt_obj; typedef struct { alt_obj min , max; } Out_RangE; typedef struct { Out_RangE x, y; signed long size_x, size_y; unsigned long min; } pre_comp; typedef struct { unsigned char P,last_P; signed long L; union{unsigned long L;bool b[32];}S; P_object asked_what; //int t = 0;for( int i= 0 ;i < d.last_P; i++ ) t += d.S[i] * 2 Λ d.P[i]; //d.L == 2 A d.last_P + d. S [d. last_P] * ( 1 + t ); } data_location; */ Pileglobal_h #ifndef pileglob_def #define pileglob_def #include "piletype.h" // the pile types //////////////////// extern P_object *P_0; //pilecon // the object pointer extern g_pile_access Uses; //pilecon // the globals for opreating pile objects extern char *input_buf; //pileout // in a size of input_buf_max bytes extern b8 *working_buf ; //pileout// in a size of working_buf_size bytes extern unsigned char *working_pointer, //pileout//in a size of input_buf_max bytes *output_buf ; //pileout//in a size of input_buf_rαax bytes extern bool Is_txt ; //pileout//Input, Output , ///////////////////// extern Ob_pile_access IS ( ) ; //pileio extern unsigned long at_shl (); //pileio extern shell *shl(); //pileio extern P_object *P_obj(); //pileio extern void destruct_io ' ( ) ; //pileio extern void intall_io(); //pileio extern bool consruct_io ( ) ; //pileio extern unsigned long at_P_obj(); //pileio extern P_object *P_obj(); //pileio extern unsigned long at_cch(); //pileio extern cache *cch(); //pileio /* extern //bool void get_object (unsigned int64 ,bool ); //pileio extern void Write_it_what ( unsigned int64 ,bool , int ); //pilecon extern void Write_what (unsigned int64 ,bool , int ); //pilecon //extern void Read_What (unsigned int64 ,bool );//pilecon extern void ReadWhere ( unsigned int64 ); //pilecon extern P_by mentions_under ( P_by , P_by ,bool ); //pilecon extern P_by is_to_mention_under ( P_by , P_by , bool , short , bool , ool ) ; //pilecon * extern P_by is_to_mention ( P_by ,bool , short ,bool, bool ■ ) ; //pilecon extern unsigned long st_level ( b8 ,bool ); //pilecon //extern unsigned int64 A_bs_of_not_Ui ( unsigned int64 ) ; //pilecon extern bool con_Pile (); //pilecon extern void des_Pile (); //pilecon extern signed long read_data_for ( P_by , short );//piledata extern signed long read_data_by_list (P_by , short );//piledata extern signed long read_content ( P_by , short ) ; //piledata extern signed long read_data ( int64 , int64 , short );//piledata //extern out_write_data write_data ( unsigned char *, unsigned long, P_by, signed long ) ; extern out_write_data write_data ( unsigned char *, unsigned long, bool ) ; //piledata extern out__write_data make_content (out_write_data , P_by , signed long, bool ) ; //piledata extern long set_pile_objectS_to ( unsigned char *, unsigned long , short , bool ); //piledata */ extern void note_frame ( P_by , short ); //pileout extern void P_err (short );//pile_out extern void P_mSg ( ) ; //pile_interface extern void P_ll_msg ( ) ; //pile_interface extern void P_12_msg ( ) ; //pile_interface extern void P_ed_log ( ) ; //pile_interface extern void P_in_file ( ) ; //pile_interface extern void P_eding ( ) ; //pile_interface extern void P_edingf ( ) ; //pile_interface extern void P_get_in_file ( ) ; //pile_interface extern void P_get_eding ( ) ; //pile_interface extern void P_switch_eding ( ) ; //pile_interface extern void P_switch_in_file ( ) ; //pile_interface //extern void P_interup ( ) ; //pile_interface extern void P_spread_out (short ) ; //pile_interface extern void P_function (int ,P_object *,int ) ; //pile_interface #endif Pile c // piledos #ifndef piledos_def #define piledos_def #include "pileglob.h" // the pile types #include <stdio.h> // fopen, fclose, fseek, fread, fwrite, ftell, sprintf #include <dir.h> // MAXDIR, getdisk, setdisk, chdir, getcurdir, mkdir #include <io.h> // access typedef struct { FILE *shell_, // file number of "shell. p64" -> S *P_object // file number of "P_object .p64" -> U_P_0 *session_ // file number of "session. 64" -> &ses *cache_i__, // file number of "cache. pβ4* -> UI [max_cache] *cache ; // file number of "cache. p64* -> UC dos_access; dos_access A; // dos hard disk extern cache *C, // the shell cache pointer *UC, // the base pointer of the shell cache C_collect; extern shell *S, // the shell pointer *US; // the base pointer of shell extern cache i UI [max_cache] // the cache index extern signed long malloc_P_objects ( signed long , signed long ,bool ); extern void set_P_object_bufs ( ) ; void to_HD_from(P_object *RamP, signed long fileP, P_object *RamL, signed long fileL) { fseek( A.P__object_, fileP, SEEK_SET) ; fwrite ( RamP, P_object_buf size ,1 A.P_object_ ) ; fseek ( A.P_object_, fileL, SEEK_SET) fwrite ( Ra L, P_object_buf_size ,1 A.P_object_ ) ; } void to_HD() { fsee ( A.P_object_ S->file[idP] , SEEK SET); fwrite ( C->ram[idP], P_object_buf_size ,1 , A.P_object_ ); fseek( A.P_object_, S->file [idL] , SEEKJ3ET) ; fwrite ( C->ram[idL], P_object_buf_size ,1 , A.P_object_ ); } void set_get_it (bool x) { if (x) { memset ( C->ram[idP], 0x00, P_object_buf_size ); memset ( C->ram[idL], 0x00, P_object_buf_size ); } else { fseek( A.P_object_, S->file [idP] , SEEKJ3ET) ; fread( C->ram[idP], P_object_buf_size ,1 , A.P_object_ ); . fseek ( A.P_object_, S->file [idL] , SEEKJ3ET) ; fread( C->ram[idL] , P_object_buf_size ,1 , A.P_object_ ) ; }} void dos_to_disk( ) { f close ( A.P_object_ ) ; fseek(A.cache_i_, 0L, SEEK_SET ) ; fwrite ( UI, (Uses . total [idC] +1) * sizeof ( cache_i),l , A. cache_i_) ; f close ( A.cache_i_); fseek(A.cache_, 0L, SEEK_SET ) ; fwrite (UC , (Uses .total [idC] +1) *sizeof (cache) , 1 ,A.cache_ ) ; fclose ( A.cache_); fseek ( A.shell_, 0L, SEEK_SET ) ; fwrite ( US, (Uses . total [ids] +1) * shellSize, 1 ,A.shell_ ); fclose ( A.shell_ ) ; fseek ( A.session_, 0L, SEEK_SET ) ; fwrite ( &Uses, sizeof ( Uses ), 1 ,A.session_ ); fseek ( A.session_, sizeof ( Uses ), SEEK_SET ) ; fwrite ( Uses. frame, sizeof (P_by ) * PileMAXframe , 1 ,A.session_ ); fclose ( A.session_); } bool dos_from_dis ( ) {int the_pile_drive_disk = 'D'-'A',//-65; // the dirve olddisk = getdisk(); char up_dir[] = "pile", // working directory down_dir[] = "pile", // system directory sf [] = "shell. p64", // file name associated to US token A.shell_ P_objectf[] = "P_object .p64", // file name associated to U_P_0 token A.P_object__ sesf [] = "session. p64", // file name associated to &ses token A.session_ c_cachef [] = "cache_i .p64", // file name associated to UCApp token A.c_cache_ s_cachef[] = "cache. 64" , // file name associated to UC token A.cache_ old_dir [MAXDIR] ; // old directory if ( getcurdir (. ' olddisk + 1, old_dir ) ) P_err(24); setdisk( the_pile_drive_disk ); chdir( "\\" ) ; if ( chdir ( up_dir ) ) mkdir ( up_dir ) ; if (chdir ( down_dir ) ) mkdir ( down_dir ) ; if ( access (sesf, 6) | | access (sf, 6) | | access (P_objectf, 6) ) { if ( ( A.session_ = fopen (sesf, "w+b" ) ) == NULL ) //&ses {sprintf ( inputjouf, "can not open %c",sesf); P_spread_out (-103) ; } else if ( ( A.shell_ = fopen(sf, "w+b") ) == NULL ) //US {sprintf ( inputjouf, "can not open %c",sf); P_spread_out (-103) ; } else if ( ( A.P_object_ = fopen (P_objectf, "w+b" ) ) == NULL )//U_P_0 {sprintf ( inputjouf, "can not open %c", P_objectf) ; P_spread_out (- 103);} else if ( ( A.cache_i_ = fopen (c_cachef, "w+b") ) == NULL ) //UCApp {sprintf ( inputjouf, "can not open %c", c_cachef) ; P_spread_out (- 103);} else if ( ( A.cache_ = fopen (s_cachef, "w+b") ) == NULL ) //UC {sprintf ( inputjouf, "can not open %c" , s_cachef) ; P_spread_out ( 3 ) ; } } else if ( ( A.session_ = fopen (sesf, "r+b") ) == NULL ) //&ses {sprintf ( inputjouf, "can not open %c"-,sesf); P_spread_out (-103) ; } else if ( ( A.shell_ = fopen (sf, "r+b") ) == NULL ) //US {sprintf ( input_buf, "can not open %c",sf); P_spread_out (-103) ; } else if ( ( A.P_object_ = fopen (P_objectf, "r+b" ) ) == NULL ) //U_P_0 {sprintf ( input_buf, "can not open %c", P_objectf) ; P_sρread_out (- 103);} else if ( ( A.cache_i_ = fopen (c_cachef, "r+b") ) == NULL ) //UCApp {sprintf ( input_buf, "can not open %c", c_cachef) ; P_sρread_out (- 103);} else if ( ( A.cache_ = fopen (s_cachef, "r+b") ) == NULL ) //UC {sprintf ( inputjouf, "can not open %c", s_cachef) ; P_spread_out (- 103);} else { fseek ( A.session_, 0, SEEK_SET ) ; fread( &Uses, sizeof ( Uses ),1 , A. session_) ; fseek ( A.P_object_, 0, SEEK_END ) ; if ( Uses.P_objectEOF == ftell ( A.P_object_ ) && Uses. P_objectEOF > 2 * P_object_buf_size - 1 ) ' { fseek ( A.session_, sizeof ( Uses ) , SEEK_SET) ; fread( Uses. frame, sizeof (P_by ) * PileMAXframe ,1 , A. session_) ; fseek ( A.shell_, 0, SEEK_SET ) ; fread( US, (Uses .total [ids] +1) * shellSize, 1 ,A.shell_ ) ; fseek ( A.cache_i_, 0, SEEK_SET ) ; fread( UI, (Uses .total [idC] +1) *sizeof (cache_i) , 1, A. cache_i_) , fseek ( A.cache_, 0, SEEK_SET ) ; fread(UC , (Uses . total [idC] +1) *sizeof (cache) , 1 ,A.cache_ Uses.RAMcounterEND = 0 ; C = UC; Uses.RAMcounterEND = malloc_P_objects ( Uses.RAMcounterEND, Uses . total [idC] + 1, false ) ; ' Uses . RAMcounterEND = mallocJ?_objects ( Uses.RAMcounterEND, max_cache, true ); C = UC; S = US ; Uses .pile_state_is = true; setdisk( olddisk ); chdirC'W") ; chdir ( old_dir ) ; return (true) ; }} setdisk( olddisk ); chdirC'W") ; chdir ( old_dir ) ; return (false) ; //goto install; } #endif // pileio #ifndef pileio_def #define pileio_def //#include "pileio. h" //#include "pileglob.h"// the pile types #include <stdlib.h> // maloc, realloc, free //#include <mem.h> // memcpy,memset//memmove extern void to_HD ( ) ; extern void set_get_it (bool ) ; extern void dos_to_disk ( ) ; extern bool dos_from_disk () ; extern void to_HD_from(P_object *, signed long ,P_object *, signed long ); ///////////////////////////////////////////////////////////////////////// /// void destruct_io ( ) { Uses .pile_state_is = false; free (C_collect. ram [ idP ]) free (C_collect. ram [ idL ]) for ( C=UC, Uses. RAMcounterEND = Uses .total [idC] +1 ; Uses.RAMcounterEND ; ) { S = US + C->to_S; to_HD ( ) ; free(C->ram[ idP ] ) ; free (C->ram[ idL ]); S->appear = - ( S->appear++ ) ; , C++; Uses.RAMcounterEND— ; } dos_to_disk ( ) ; free ( UC ) ; free ( US ) ; free (input__buf) ; free (working buf) ; } signed long malloc_P_objects ( signed long RAMcounterEND, signed long max, bool x) {if ( ( C_collect.ram[ idP ] = ( p_object * ) malloc ( P_objectjouf_size ) ) 1 = NULL ) if ( ( C_collect.ram[idL ] = ( P_object * ) malloc ( P_object_buf_size )) == NULL ) free (C j collect. ram [ idP ] ) ; while ( RAMcounterEND < max ) {C = UC + RAMcounterEND; if ( ( C->ram[ idP ] = ( P_object * ) malloc ( P_object_buf_size ) ) == NULL ) break; else if ( ( C->ram[idL ] = ( P_object * ) malloc ( P_object_buf_size ) ) == NULL ) { free(C->ram[ idP ] ) ; break; } if(x) set_get_it ( x) ; else {S = US + C->to_S; set_get_it ( x) ; S->appear = - ( S->appear++ ) ; } RAMcounterEND++ ; } return (RAMcounterEND) ; } void set_P_object_bufs ( ) { memset ( C->ram [idP] , 0x00 , P__obj ect_buf_size ) ; memset ( C->ram [idL] , 0x00 , P__obj ect_buf_size ) ; } bool consruct_io ( ) { if ( ( UC = ( cache * ) malloc ( max_cache *sizeof (cache) ) ) == NULL ) P_err(2); else C = ( cache * ) memset (UC, 0x00, max_cache *sizeof (cache) ) ; if ( ( US = ( shell * ) malloc ( max_shell_memb * ( shellSize + 1 ) ) ) == NULL ) P_er (2) ; else S = ( shell * ) memset ( US, 0x00, max_shell_memb * ( shellSize + 1 ) ); if ( ( working_buf = ( b8 * ) malloc ( working_buf_size ) ) == NULL ) P_err ( 2 ) ; return ( dos_from_disk( ) ) ; } #endif ///////////////////////////////////////////////////////////////////////// /// // pileϋi #ifndef pileUi_def #define pileUi_def ///used by this moudels///////////////////////////////////// cache *C, // the shell cache pointer *UC, // the base pointer of the shell cache C_collect; shell *S, // the shell pointer *US; // the base pointer of shell P_object *U_P_0; // the base pointer of the object cache_i UI [max_cache] ; // the cache index /////////////////////////////////////// //Ui=??? ;the_Ui (l=to_write, 0=to_read) ; //the fubction void theJJi (bool to_write) ; . //This fubction sets the pointer P_0 to the unique object of the type Recorded //and sets the bool Uses. old to the statement equvivalent to the object was there . //If to_write is true the object is created and P_0->by.Ui is set to Ui . //If to_write is true or the Uses. old is true //the pointer P_0 is set to the object P_0 having P_0->by.Ui == Ui . ///////////////////////////////////////////////////////////////////////// /// unsigned long at_shl ( ) { return (S - US);} unsigned long at_P_obj ( ) {return (P_0 - U_P_0) ; } unsigned long at_cch ( ) {return (C-UC) ; } shell *shl() {return(S);} > "■ P_object *P_obj() {return (P_0) ; } cache *cch() {return(C);} cache * evacuate_C ( bool new_use_on_right, shell *s, cache *c ) //evacuate_C(S-US > C->to_S) { Ram unusedjC; signed long i = c->to_I; signed long max_C = Uses . total [idC] , tHis_C = c - UC, // this_C points to the current C to_HD; // to_HD points to the most unused C // if (last_C_down) to_HD = max_C; else{ to_HD = UI [ max_C ] . to_C ; // if ( must_to_have 2 && tHis_C == to_HD ) // to_HD = UI[ max_C -l].to_C; //} cache *C_HD = UC + to_HD ; // C_HD is in the most unsued shell *S_HD = US + C_HD->to_S; // S_HD is in the corespond S_HD->appear = - (UI [C_HD->to_I] . appear++) ; //marked as not in the ram to_HD_from(C_HD->ram[idP] , S_HD->file [idP] , C_HD->ram[idL] , S_HD- >file[idL] ) ; unused_C.ram[idP] = C_HD->ram[idP] ; // after putting to the hard disk unused_C.ram[idL] = C_HD->ram[idL] ; // taking base pointers (P,L) if( to_HD 1= tHis_C ) //else retur ( unused_C );// don't move data {signed long items; if ( to_HD < tHis_C ) // so C is lefetd {if( items = ( ■ ( c -= !new_use_on_right ) - C_HD ) ) {for( cache * at_C = C_HD + 1; items—; at_C++ ) {UI [at_C->to_I] .to_C—;//updeting the index about the change of C * (at_C - 1) = *at_C; }}} else {if ( items = ( C_HD - (c += new_use_on_right) ) ) {for( cache * at C = c + items-1; items—; at_C— ) {UI [at_C->to_I] .to_C++; //updeting the index about the change of C *(at_C + 1) = *at_C; . }}}} // return ( unused_C ); signed long appear = (s->appear = -( s->appear—));// marked as in the ram if (//!last_C_down || UI [ i +1 ]. appear > appear) //???????????????????????? for ( i = Uses. total [idC] ; i && UI [ i - 1 ]. appear < appear; i— ) ( UC + ( UI[i] = UI[i-l] ) .to_C )->to_I++; //the correspond C->to_I s updated about being pushed UI[i] . appear = appear; UI[(c->to I = i)] .to C = c-UC; c->ram[idP] = unused__C.ram[idP] ; c->ram[idL] = unused_C . ra [ idL] ; c->uses [idP] = s->uses [idP] ; c->uses [idL] = s->uses [idL] ; c->to_S = s - US; c->edge.H = s->edge.H; set_get_it ( s->file[idL] > Uses . P_objectEOF if (c->edge. H 1= c->ram[idMAX]->by.where ) {sprintf ( inputjouf, "%lu, %lu) the first object is not in between the C edges" , c-UC, Uses . total [ids] ) ; P_spread_out (-103) ; } return (c) ; } //bool //void Ob_pile_access theJJi (unsigned int64 Ui, bool to_write ) {signed long Amount; //bool Is__old; Ob_pile_access Is; // the globals for opearting get_obj bool last_C_down=false; signed long i; bool new_use_on_right, must_to_have_2 ; Ram unused_C; // debag_inedeges ( ) ; if (Uses. total [idC] } {C = UC + Uses. total [idC] ; if ( Ui > C->edge.H ) {Amount = Uses . total [idC] + 1 ; C = UC + (Amount »= 1 ) ; while ( Amount ) //C->edge.H== ( C->ram[idP] )->by.Ui.H if Ui > C->edge.H ) // if ( Ui > ( C->ram[idP] )->by.Ui.H ) C -= i Amount & 1 ) + ( Amount »= 1 ) ; else if ( Ui > (C + l)->edge.H ) break; else C += ( Amount & 1 ) + ( Amount »= 1 } if (C<UC I I UC-OUses . total [idC] ) P_err (20 ) ; S = US + C->to_S; if (C->to_S&&S->edge . H ! =C->edge . H P_err(20 ) ; if( Uses. total [idC] — Uses. total [idS] ) {if ( Ui > C->edge.H I (Uses.total[idC] > C-UC&& Ui <= (C+l)->edge.H )) P_err(20 } else {if ( Ui > ' S->edge.H || Ui <= (S + l)->edge.H {////////C->to S .Ui >= C->edge[idMAX] .H ...Amount???? //try to avoid insert to ashell by intehr searcg (binary) by order of those which where to be insret Amount = Uses . total [ids] + 1 ; S = US + (Amount »= 1 ) ; while ( Amount ) if ( Ui > S->edge.H ) S -= ( Amount & 1 ) +( Amount »= 1 ); else if ( Ui > (S + l)->edge. H break; else S += ( Amount & 1 + ( Amount »= // debag_inedeges ( ) ; if ( 1 mount) if ( Ui > S->edge.H Ui <= (S + l)->edge.H P_err(20 ); if (C-UC == Uses. total [idC] ) last_C_down=true; //new_use_on_right=false; } else new_use__on_right = ( S - US > C->to_S ) ; must_to_have_2 = false; evacuate_C: //////// Ram unused_C = evacuate_C ( ( S-US > C->to_S false ) ; signed long max_C = Uses . total [idC] , tHis_C = C - UC, // this_C points to the current C to_HD; // to_HD points to the most unused C if (last_C_down) to_ HD = max C; else {to_HD = UI [ max_C ] . to_C ; if ( must to have 2 && tHis_C == to HD ) to HD = UI [ max C -1] .to C; } cache *C_HD = UC to_HD ; // HD is in the most unsued shell *S_HD = US C HD->to S; // ~ HD is in the corespond S_HD->appear = - (UI [C_HD->to_I] . appear++) ; //marked as not in the ram to_HD_from ( C HD->ram[idP] , S HD->file [idP] , C HD->ram[idL] , S HD- >file [idL] ) ; unused_C.ram[idP] = C_HD->ram[idP] // after putting to the hard disk unused_C. ram [idL] = C_HD->ram[idL] ; // taking base pointers (P,L) if ( to_HD 1= tHis_C ) //else return( unused C );// don't move data {signed long items; if ( to_HD < tHis_C ) // so C is lefetd {if( items = ( ( C -= !new_use_on_right ) - C_HD ) ) {for( cache * at_C = C_HD + 1; items—; at_C++ ) {UI [at C->to I] . to C— ; //updeting the index about the change of C *(at_C - 1) "at C; }}} else {if ( items = ( C_HD - (C += new_use_on_right) ) ) { for ( cache * at_C = C + items-1; items—; at_C— ) {UI[at_C->to_I] .to__C++; //updeting the index about the change of C *(at C + 1) = *at C; }}}} // return ( unused_C ) ; if ( must_to_have 2 ) goto back_to_shell; signed long appear = (S->appear = -( S->appear— ));// marked as in the ■ ram if ( !last_C_down || UI [ i +1 ]. appear > appear) //???????????????????????? for ( i = Uses. total [idC] ; && UI[ i - 1 ] .appear < appear; i— ) ( UC + ( UI[i] = UI[i-l] .to c ) ■ >to_I++; //the correspond C->to is updated about being pushed UI[i]. appear = appear; UI[(C->to_I = i)].to_C = C-UC; C->ram[idP] unused__C. ram[idP] ; C->ram[idL] unused_C.ram[idL] ; C->uses [idP] S->uses [idP] ; C->uses [idL] S->uses [idL] ; C->to S S - US; C->edge.H = S->edge.H; set_get_it( S->file[idL] > Uses . P_objectEOF ); if (C->edge.H != C->ram[idMAX] ->by. where ) { sprintf ( inputjouf, "%lu, %lu) the first object is not in between the C edges", C-UC, Uses. total [ids] ) ; P_spread_out (-103) ; }}}} for(signed long appear=UI [ (i=C->to_I) ] . appear;i&& UI [i-l] .appear == appear; i—) (UC + ( UI[i].to_C = UI[i-l].to_C ) ) ->to_I++; //the correspond C->to_I is updated about being pushed if ( C->to_I 1= i ) UI[( C->to_I = i ) ].to_C = C - UC; UI [i] . appear++; U_P_0 = C->ram[ Is. id = ( ( C->ram[idP] + C->uses[idP] - 1 )->by.Ui.H > Ui) ] ; if ( Is. id == idL && !C->uses [idL] ) // idL first new object {Uses. old = false; if ( to_write ) //add new object {Uses .total [idL] ++; P_0 = U_P_0 + max_P_object_memb - ++C->uses [idL] ; S->uses [idL] ++ ; P_0->by. where = Ui; }} else {if ( Is. id == idL ) // idL { P_0 = U_P_0 + max_P_object_memb - 1; if ( Ui > P_0->by. where ) {P_0 -= C->uses[idL] - 1; if ( Ui < P_0->by. where ) P_0 += ( Amount = C->uses[idL] » 1 ) ; else Amount = 0; } else Amount = 0; } else // idP {P_0 = U_P_0; if ( Ui < P_0->by. where ) P_0 += ( Amount = C->uses[idP] » 1 ); else Amount = 0; } while ( Amount && Ui 1= P_0->by.where ) ( Ui < P_0->by.where ) ? P_0 += ( Amount & 1 ) + ( Amount »= 1 ) : P_0 -= ( Amount & 1 ) + ( Amount »= 1 ) ; //if ( P_0 < U_P_0 + max_P_object_memb - 1 && Ui == ( P_0 + 1 )->by. where )P_0++; //else if( P_0 > U_P_0 && Ui == ( P_0 - 1 ) ->by.where) P_0—; if ( ( Uses. old = ( Ui == P_0->by.where ) ) == false && to_write==true ) ///////////////add new object///////////////////// {//if ( !Ui) {sprintf ( input_buf, " !W") ; P_spread_out (-193) ; } if ( Is. id == idP ) // to_P {if( Ui < P_0->by. where ) P_0++; signed long items; if ( C->uses[idP] < max_P_object_memb ) //P_TO_P_ {items = C->uses[idP] - 1; C->uses [idP] ++; S->uses [idP]++; Uses. total [idP]++; } else // P_TO_P_AND_TO_L {items = max_P_object memb - 1; P_obj ect *loc = U_P_0 + max_P_obj ect_memb - 1 ; P_obj ect las _of_P = *loc; loc = C->ram [ idL ] + max_P obj ect_memb - ++C->uses [ idL] ; S->uses [ idL] ++ ; *loc = last_of_P ; / /pas s to L Uses. total [idL] ++; } items -= P_0 - U_P_0; memmove ( P_0 + 1 , P_0, items « 5 P_0->by.where = Ui; if ( P_0 == U_P_0 ) {if (C->to_S) {C->edge . H=U_P_0->by. where; S->edge.H = U_P_0->by. where; }}} else // to_L {if( Ui > P_0->by. where ) P_0—; P_object *left = U_P_0 + maxJP_ object_memb - C->uses [idL] signed long items = P_0 - left " + 1; memmove ( left - 1, left, items « 5 ); ++C->uses [idL] ; ++S->uses [idL] ; Uses. total [idL] ++; P_0->by. here = Ui; } if ( C->uses[idL] == max_P_object_memb ) //add new shell {shell new_S; signed long sh_this_C = C - UC , oldS = S - US, appear = UI [ i ] .appear » true; new_S .edge.H = C->ram[idL] ->by. where; new_S .uses [idP] = S->uses [idL] ; S->uses [idL] = 0; new_S .uses [idL] = 0; new_S.file [idP] = S->file [idL] ; S->file[idL] = Uses .P_objectEOF; Uses . P_obj ectEOF += P_object_buf_size; new_S . file [idL] = Uses .P_obj ectEOF; Uses . P_objectEOF += P_object_buf_size; Uses . total [idL] -= max_P_object_memb; Uses. total [idP] += max_P_object_memb; Is . id == idP; S->appear == appear; new_S . appear == appear; if ( Uses. total [idC < Uses.RAMcounterEND ) // still not all ram is in used {Uses.total[idS] ++Uses . total [idC] ; cache *at_C UC + Uses. total [idC] ;// at_C at the first unused unused_C. ram[idP] = at__C ->ram[idP] ; // is taking to fill the new unused_C. ram [idL] = at_C ->rarα[idL] ; // if ( Uses. total [idC] - 1 > sh- this C ) // push_back_and_update_C { Uses. total [idC] - 1 , this_C ); {at_C—; for (signed long from_C = Uses .total [idC] sh this C; from C- ;at_C—) {at_C->toJ3++; //updeting C about the expected change of S UI[at_C->to_I] .to_C++; //updeting UI about the change of C (at C + 1) •at C; }} for(;i < Uses .total [idC] && UI [ i+l ]. appear > appear; i++ ) //set i in the new index corespond to new appear ( UC + ( UI[i] = UI[ i + 1 ] ) .to_C ) ->to_I— ; //so the correspond C->to_I is updated about being pulled i++; for (signed long next_i = Uses .total [idC] ; i < next_i ; next_i— ) //inserting new index ( UC + ( UI[next_i] = UI [ next_i - 1 ] ).to_C )->to_I++; //the correspond C->to_I is updated about being pushed —i; } else//all ram is in used {++Uses . total [ids] ; Ram used_C; // if ( Uses. total [idS] >12) used_C. ram[idMAX] = C->ram[idMAX] ; must_to_have_2 = true; new_use_on_right = ( C - UC < Uses .total [idC] ) ; used_C.ram[idMAX] = C->ram[idMAX] ; used_C.ram[idMIN] = C->ram[idMIN] ; for(;i < Uses .total [idC] -1 && UI [ i+l ]. appear > appear; i++ ) //set i in the new index corespond to new appear ( UC + ( UI[i] = UI[ i + 1 ] ).to_C )->to_I—; //so the correspond C->to_I is updated about being pulled if ( C->to_I != i ) C->to_I = i; if( i == Uses. total [idC] ) i = Uses .total [idC] - 1; goto evacuate_C; //unused_C = evacuate 2 (true, true) ; back_to_shell : if ( new_use_on_right) —C ; // so that new is on ++C . even if C- UC=0 so CJHD>C so C will come ++ sh_this_C = C - UC; C->ram[idMAX] = used_C. ram[idMAX] ; C->ram[idMIN] = used_C. ram[idMIN] ; for ( signed long next_i = Uses .total [idC] next_i && UI [ next__i 1 ]. appear < appear; next_i— ) ( UC + ( UI[next_i] = UI[next_i-l] ).to_C ->to I++; //the correspond C->to_I is updated about being pushed if ( Uses, total [idC] - 1 > sh_this__C ) // push_back_and_update_C ( Uses .total [idC] - 1 , this_C ); {cache *at_C = UC + Uses . total [idC] ; for ( signed long from_C = Uses .total [idC] - sh_this_C; from_C—; at_C— ) at_C->to_S++; //updeting about the expected change of S • } } I IC at its OLD original place UI[(C->to_I = i) ] . appear = appear; UI[i].to_C = sh_this_C; UI[( ( C + )->to_I = ++i) ] .appear = appear; UI[i] .to C ++sh_this_C; C->toJ3 = oldS; C->edge.H = S->edge.H; C->uses [idP] = S->uses [idP] ; C->uses [idL] = S->uses [idL] ; P_object *loc C->ram[idMIN] ; // originial gives its idL, C->ram[idMIN] unused C. ram[idMAX] ; // and takes instead the unused idP C++; // C at its NEW original place C->ram[idMAX] = loc; // New idp takes the the old idL C->ram[idMIN] = unused_C. ram[idMIN] ; // New idL takes the unused idL C->to_S = oldS + 1; C->edge.H = newJS.edge.H ; C->uses[idP] = new S .uses [idP] ; C->uses[idL] = new_S .uses [idL] ; memmove ( S + 1, S, ( Uses .total [idS] - oldS )« 5 );//* shellSize) ; //try to avoid by intehr searcg (binary) by order of those which where to be insret S++; *S = new_S;// debag_inedeges ( ) ; }}}// debagO ; Is.bleft = true; Is. bright = true; Is.midle.H = P_0->by. where; if(Is.id) {if ( P_0 == U_P_0 + maxJ?_object_memb - S->uses[idL] ) Is.bleft= false; else Is.left.H = (P_0 - 1 ) ->by. where; if ( P_0 == U_P_0 + max_P_object_memb - 1 )Is.bright= false; else Is. right. H = ( P_0 + 1 ) ->by. where; } else {if ( S->uses[idP] > 1 ) {if ( P_0 == U_P_0) Is.bleft = false; else Is.left.H = (P_0-1) ->by. where; if ( P_0 == U_P_0 + S->uses[idP] - 1 11 S->uses[idP] < 2 ) Is.bright= false; else Is. right. H = (P_0+1) ->by. where; } else {Is.bleft= false; Is.bright= false; }} if ( ( 1 Is.bleft | | ( Is.left.H > Is.midle.H ) ) && (1 Is. bright | | ( Is.midle.H > Is. right. H ) ) && S->uses [Is . id] <= max_P_object_rαemb ) {if ( Uses. total [idS] ) {if ( S->uses[idP] < 2 | | ( C->to_S == S - US && S->edge.H >= C- >ram[idP] ->by.ϋi.H )); else P_err (5) ; if ( S - US >0) {if( S->edge.H < ( S - 1 )->edge.H ); else P_err (6) ; }}} else P_err (4) ; return (Is) ; }// return (Uses .old) ; manage_collection arrange_by_Cp (manage_collection object) {bool this_from_right = true; unsigned long left_to_do = object . left_to_do, base = object . first .D.base; P_object *check_gate = object. P_0, // is at the mos right *this_ga.te = check_gate, old_this; while ( check_gate->by.Ui . D.base == base && left_to_do—) check_gate—; object. P_0 = check_gate; // is at the most left object .left_to_do -= left_to_do; left_to_do = object . left_to_do; signed long the_middle = left_to_do » 1, in_order_left = 0, in_order_right = 0; while ( —left_to_do ) {old_this = *this_gate; check_gate = object. P_0 + the_rαiddle; // go to the middle unsigned long to_check = in_order_right; while (old_this .by. Pc. D.base < check_gate->by. Pc. D.base ) if (to_check—) check_gate++; // as long as this_gate Cp is smaller go right else break; if ( to_check != in_order_right ) in_order_right++; else {to_check = in_order_left; while ( old_this .by. Pc. D.base > check_gate->by . Pc. D.base ) if (to_check— ) check_gate—; // as long as this_gate Cp is bigger go left else break; //if ( check_gate->by. Pc. D.base 1= is_not_NP ) ■ ? • ?? in_order_left++; } if (this_from_right ) {memmove ( this_gate - l,this_gate , this_gate - check_gate ); this_gate = object. P_0 + the_middle - (in_order_left+l) ; this_from_right=false; } else {memmove ( this_gate, this_gate + 1, check_gate - this_gate ); this_gate = object. P_0 + the_middle + in_order_right+l; this_from_right=true; } *check_gate = old_this; // the_middle += ( (in_order_right + in_order_left ) » 1 ) - in_order_left; } object. P_0 += object . left_to_do; return (object) ; } manage_collection step_block_forward (manage_collection step ) {if (step. id) {if( step.S -US< Uses. total [idS] ) {if ( ++step.S->edge.H != ++step.C->edge.H ) step.C = evacuate : ( true, step.S, step.C ); step, id = falser- step. P_0 = step.C ->ram[idP] ; } else { step. stop = true; return (step) ; }//break the loop } else {step, id = truer- step. P_0 = step.C ->ram[idL] + max_P_object_memb - step. C->uses [idL] ; } step.left_to_do = step. C->uses [step. id] ; ////////////??????????????////////////////// /* signed long i=step.C->to_I; for(signed long appear=UI [i] . appear; i&& UI [i-l] . appear == appear;!—) (UC + ( UI[i].to_C = UI[i-l].to_C ) ) ->to_I++; //the correspond C->to_I is updated about being pushed if ( step.C->to_I 1= i ) UI [ ( step.C->to_I = i ) ].to_C = step.C - UC; UI [i] . appear++; */ // C_collect return (step) ; } manage_collection step_block_back (manage_collection object, bool is_object=true ) {if (object .id) {object. id = false; object. P_0 = object. C ->ram[idP]+ object .C->uses [idP] -1; } else {if (object. S == US ) { object. stop = true ; return (object) ;} //break the loop else {if( —object.S->edge.H 1= —object . C->edge .H ) object. C = evacuate_C ( false, object. S, object. C ); if (object . C->uses [idL] ) {object. id = true; object. P_0 = object. C ->ram[idL] + max_P_object_memb -1; } else {object. id = false; object. P_0 = object. C ->ram[idP]+ object . C->uses [idP] -1; }}} object .left_to_do = object .C->uses [object . id] ; int x; if (object. id) x = max_P_object_memb - object. left_to_do ; pl op X == 0 * ////////////?? ? ? ? ??? ?? ??? ?////////////////// /* signed long i=step.C->to_I; for(signed long appear=UI [i] . appear; i&& UI [i-l] . appear == appear;i—) (UC + ( UI[i].to_C = UI[i-l].to_C ) ) ->to_I++; //the correspond C->to_I is updated about being pushed if ( step.C->to_I 1= i ) UI [ ( step.C->to_I = i ) ] . to_C = step.C - UC; UI [i] . appear++; */ memmove ( C_collect .ram[ is_object ] , object .C->ram[object. id] + x, object . left_to_do « 5 ); object. P_0 = C_collect . ram[ is_object ] + object . left_to_do - 1; // if ( !is_object) //arrange the baffer by the order of the Cp // return (arrangeJoyj^p (object) ) ; // else return (object); } manage_collection set_step_block (unsigned long base, unsigned long offset, bool is_object=true ) {manage_collection object; object. stop = false; object .first. D.base = base; object .first .D. offset = offset; object. id = ( theJJi ( object . first .H , false ) ).id; int x = 0; if ( obj ect . id ) object. left_to_do = (( object. P_0 = P_0 ) - C->ram[ idL ]) + 1- ( x = max_P_object_memb - C->uses[idL] ) ; // object. left_to_do = (( object. P_0 = P_0 ) - c->ram[ idL ]) - ( x = max_P_object_memb - C->uses[idL] ) ; else object. left_to__do = (( object. P_0 = P_0 ) - C->ram[ idP ]) + 1; object. S = S; object.C = C; if (lUses.old) if (object. P_0->by. Ui.H > object . first .H) {// if( C->uses [ step. id] - step. left_to_do++ ) step.P_0++; // else return ( step_block_forward (step )); } else { if( object. left_to_do— )//?????????????????// object. P_0— ; else object=step_block_back (object) ;//, is_object ); } memmove ( C_collect . ram[ is_object ] , object ,C->ram [object .id] + x, object .left_to_do « 5 ); object. P_0 = C_collect.ram[ is_object ] + object . left__to_do - 1; // if ( I is_object) //arrange the baffer by the order of the Cp // return (arrange_by__Cp (object) ) ; // else return (object) ; } #endif // pilecon #ifndef pilecon_def #define pilecon_def //#include "pileglob.h" // the pile types ///used by other moudels///////////////////////////////////// P_object *P_0; // the object pointer g_pile_access Uses; // the globals for opreating pile objects ///////////////////////////combinatative section//////////////////////////////// 11111111111111111 11111111 Igenreal description////////////////////////////////// // An object is defined by its following three identifiers: Ui, Oi and Ii, // when the identifiers hold the following six definitions: // 1) Ui is the Unique identifier of an object. // 2) Oi is the Outer identifier of an object, which uniquely identifies the // normative parent object of an object. 11 3 ) Ii is the Inner identifier of an object, which uniquely identifies the // child object in the scope of its normative parent object as well as the // associative parent object of an object. // 4) Mi is a Matching identifier of an object identifying many objects of the // object's kind. // 5) Both, Oi and Ii, are Mi . // 6) Ui <-> Mi together with Ii. // // Ev is the Exclusive value of an object, // used for including exclusive data in the object. // // An argument, which is not a connection to an object and which does not set the // Ev but sets the Ii of an object, is la functioning as an Input argument . // // When I Mi I == I Ui | , then Ui identifies the parent of the objects identified by // Mi, so that if Mi is Oi, then the parent is a normative parent of normative // children, otherwise, unless Ii is la, the parent is an associative parent of // associative children. // // Both, the normative parent object and the normative child object, are the_object // distinguished from gate_object, when both, the_object and gate_object, are // objects and the gate_object is a normative child of the normative parent object // and is a normative parent of the normative child object, so that the normative // parent object connects to its normative child object only via gate_object . // // Pc is the Private characteristic of an object, // used together with the Ui of an object for defining the Ii of the_object // and for connecting to the normative children of an object. // // RUi is the Resulted Ui of an object, when Ui(an object) defines two RUi of two // objects in two systems but only one RUi (an object) == Ui(an object) . // // associative_sys is designed for collecting in an associative manner objects set ' ■ // in a sequence order of RUI defined by their Ii. // // normative_sys is designed for collecting in an normative manner objects set // in a sequence order of RUI defined by their Mi. // // When the MSB (RUi (an object)) is set, then an object is an object (normative_sys) , // otherwise it is an object (associative_sys) . // // RUi (an object (normative_sys) ) == Ui(an object). // // The four attributes of an object are RUi, Pc, Mi and Ev, when each has an // identical size, of x_bits bits and all are .included in an object, //. so an object = { RUi, Pc, Mi, Ev }. // // Cp is the Combinative pointer of an object pointing to its normative connected // obj ects by setting its connected obj ects in a sequence order of their RUI . // sizeof (Cp) == sizeof (base (Ui) ) . // // CpC is the Cp connecting to normative Children of an object. // Only one CpC is given to two objects defined by two RUi defined by one Ui. // If CpC is given to a new parent object or to a new gate_object, then the // counter of the next such CpC is either decreases or increases by one (depend // on the standard level of use) . // base (Pc(gate_object) ) == CpC (gate_object) . // offset (Pc (gate_object) ) == gate counter of the gate's children. // base (Pc(the_object) ) == CpC (the_object) // offset (Pc (the_object) ) == base (Ii (the_object) ) . // // CpP is the Cp of the normative Parent of an object. // Ui(gate object) <-> CpP (gate object) together with base (Ii (gate object) ) . // base (RUi (the_gate (associative_sys) ) ) == base(Ii) » 1. // offset (RUi (the_gate(associative_sys) ) ) == ( CpP « 1 ) | ( base(Ii) & 1 ) . // base (RUi (the_gate (normative_sys) ) ) == CpP | most_left_only. // offset (RUi (the_gate (normative_sys) ) ) == base(Ii). // Ui(the object) <-> CpP (the object) together with offset (Ii (the object) ) . // base (RUi (the_object (associative_sys) ) ) == offset (Ii) » 1. // offset (RUi (the_object (associative_sys) ) ) == ( CpP « 1 ) | ( offset (Ii) & 1 ) . // base (RUi (the_object (normative_sys) ) ) == CpP | most_left_only. // offset (RUi (the_object (normative_sys) ) ) == offset(Ii). // ///////////////////////////bits section when xjoits == 64/////////////////////// // // 1 X bits 1 // 1 base | offεset 1 // l RUi _| 1 1 // is normative sys (Ui) | 1 1 // Ui 1 1 1 // |Mi| | 1 l_ ( Ui(P) « 1 == |Mi| (C) // Mi | 1 l_ ( Ui(P) « 1 + is_NEG(Mi(C) ) == Mi(C) // is signed (Mi) 1 l_ // Cp _! 1 1 // Ev // Pc // Ui | = UI « 1??????????? // |Ui| _| I // | Ui | =Ui»l ????? 11111111111111111111111111 /systems section////////////////////////////////////// // // -RUI — > l // // ( /2 : // // I associative_sys (the_object) normative_sys (the_object) | // //RUi I Ui = RUi = offset (Ii) » 1 : | RUi = CpP | most_left_only : I II I ( CpP « 1 ) + ( offset (Ii) & 1 ) | offset(Ii) I //Pc I Pc = CpC : base(Ii) I Pc = CpC : base(Ii) I //Mi I Mi I ?? Mi I //Ev I Ev or NP counter | ?? I // // I associative_sys (the_gate) normative_sys (the_gate) I // //RUi I Ui = RUi = base(Ii) » 1 : | RUi - CpP | most_left_only : I 1/ I ( CpP « 1 ) + ( base(Ii) & 1 ) | base(Ii) I //Pc I CpC : gate counter I CpC : ?? I //Mi I Mi I ?? I //Ev I ???? I ?? I / ' / ' 11111111111111111111111111111111111111111111111111111111111111111111111 #define full_most_left_only 0x8000000000000000 // 1000000000000000000000000000000000000000000000000000000000000000 #define full_except_of_most_left 0x7FFFFFFFFFFFFFFF // 0111111111111111111111111111111111111111111111111111111111111111 #define full_except_of_most_righ OxFFFFFFFFFFFFFFFE // 1111111111111111111111111111111111111111111111111111111111111110 #define full_full OxFFFFFFFFFFFFFFFF // 1111111111111111111111111111111111111111111111111111111111111111 #define most_left_only 0x80000000 // 10000000000000000000000000000000 #define except_of_most_left 0x7FFFFFFF // 01111111111111111111111111111111 #define except_of_most_right OxFFFFFFFE // 11111111111111111111111111111110 // // I I // Ui. D.base is of normative_sys Mi. D. offset is negative // unused by Pc. D.base Ii.D. offset is negative // ///////////////////////////////insertion level section/////////////////////// //Mi and la are signed. //Ui and Ii are unsigned. #define as_signed( H ) ( H « 1 ) // use to convert unsigned to signed #define as_abs ( H ) ( H » 1 ) // use to convert signed to unsigned #define is_NEG( H ) ( H & 1 ) // valid for both signed and unsigned ttdefine to_negate 1 #define to_positate 0 void react_object (P_object object) {} //TO DO /* A dynamic insertion as a feature of reaction of any existing object is provided for redefining the object according to its redefining condition. This feature of reaction enable to define only the change of dependencies applied to the object instead of rebuilding all over the dependencies. The redefined object is the static, which is redefined by the dynamic (static) objects and by the order of the stream of the mentioning connections which begins with the dynamic (static) and remains in the same normative domain. The redefining condition of an object is under the enabling conditions applied to the static and to all dynamic (static) by doing the exclusive value and the normative link of dynamic (static) , where an object which is not ignored is enabled and where the enabling conditions are if the object does not exist, then it is ignored, otherwise if its normative identifier is negative and if dynamic (it) are ignored, then ignore also it, otherwise do the redefining condition of dynamic (it) and if its normative identifier is positive, then ignore all dynamic (it) and either do its redefining condition when it is dynamic (static) or do its connections with no feature of reaction. The dynamic (static) is either the object defined by the normative parent of the static and by the negative associative identifier of the static if is enabled, or are the positive mentioning (static) objects in the following eight normative domains, when the eight are either the last alone, there the eight begin and the dynamic insertion ends if the dynamic (static) is enabled, or the following seven: the conditioned, there the static is under the condition of the dynamic (static) formulated by static = function (dynamic) ; the conditioning, there the dynamic (static) is under the condition of the static formulated by the dynamic = function (static) ; the former, there the dynamic (static) is added before the static; the contrary, there the dynamic (static) is added instead of the static; the latter, there the dynamic (static) is added after the static; the similar, there the dynamic (static) is accompaniment by coming together with but in the background of the static and the lead, there the dynamic (static) is coming together with but in the foreground of the static. */ // // When the leading sys is the normative_sys // i.e. RUi (an object (normative_sys) ) == Ui(an object), // then the Mi offset is kept through all the layers of connections // in the normative_sys Ui offset and in the associative sys Ui base. // // There for connections should be distinguished // form being either initializing connections or noninitializing connections, // where initializing connections for the normative connections // are set by the first at all object only (so its Ui should be equal 2) // and for the assositive connections // are set by the input (arguments) objects being set by Ii = la. // // this is to be used for all initializing connections. // The first of all object Ui should be equal 2 and #define Ia_of( H ) ( as_signed( H ) ) //signing it // this is to be used for all non initializing connections. #define as_Mi ( H ) (as_signed( H )) //signing it // use to convert Ui to Mi. ttdefine as_Ni ( H ) ( as_abs(H) | full_most_left_only) // forcing the normative system on transformed Mi // use to convert Mi to Ui . ///////////////////////////systems section////////////////////////////////////// #define Is_associative_sys 1 // . 1 is for associative_sys . #define Is_normative_sys 0 // 0 is for normative_sys #define of_associative_sys ( H ) ( ( H & full_most_left_only ) == 0 ) /* b8 Ii_of (P_by object) {b8 Ii; if ( of_associative_sys (object .where) ) {Ii. D.base = object . Pc. D. offset; Ii.D. offset = ( object. Ui. D.base « 1 ) | object .Ui . F64.offset . t_00 ; } else {Ii.D. base = object . Pc. D. offset; Ii.D. offset = object .Ui . D. offset; } return (Ii) ; } */ /* AUi. D.base = AP.Pc. D.base ; // force associative_sys AUi. D. offset = ( NP.Pc. D.base « 1 ) | minus; // Cp has no first bit NUi. D.base = NP.Pc. D.base | most_left_only ;// force normative_sys NUi. D. offset = ( AP.Pc. D.base « 1 ) | minus;// Cp has no first bit / b8 as_normative_sys (b8 Ui)// use to convert Ui (associative_sys) to Ui (normative_sys ) {unsigned long offset = ( ( Ui. D.base « 1 ) | Ui. F64. offset . t 00 ) Ui. D.base " = ( ( Ui.D.offset » 1 ) | most_left_only ) ; Ui.D. offset = offset; return (Ui) ; } b8 as_associative_sys (b8 Ui)// use to convert Ui (normative_sys) to Ui (associative_sys) {unsigned long offset = ( ( Ui.D. base « 1 ) | Ui. F64. offset. t_00 ) Ui. D.base = Ui.D.offset » 1; Ui.D.offset = offset; //unsigned long offset = ( Ui. D.base « 1 ) | Ui. F64. offset. t_00 ; // Ui.D. base = Ui.D.offset » 1; // Ui.D.offset = offset; return (Ui) ; } ///////////////////////////////standard level of use section//////////////////// // ( when in PILETYPE.h #define standard_max 0x40 ) #define standard_bits 6 // (standard_max«l) == standardjoits) #define standard_log 25 // standard_log == 32 - 2 - standard_bits #define standard_log_plus_one 26 void set_the_standards () //0-x-l 2-X-3 4-X-5.... {for (int standard_level = 0; standard_level < standard_max; standard_level += 2 ) {Uses.marker [ standard_level ] = ( ( standard_level ) « standard_log ); Uses. arker [ standard_level + 1 ] = ( ( standard_level + 2 ) « standard_log ) - 1; }} #define mark_of (st) ( ( st & 1 ) ? ( Uses .marker [st] — ) : ( Uses .marker [st] ++ ) ) inline unsigned long st_level ( b8 x) {//if( x. F6 .base. t_lf == false) //so x is of associative_sys if (of_associative_sys (x.H) ) return ( x.D. offset » standard_log_plus_one) ; //Cp left shifted sets the offset else return ( (x.D. base&except_of_most_left) »standard_log) ; //Cp sets the base } /* #define st_level (b8_x_reteruns_unsigned_long) \ ( (b8_x_reteruns_unsigned_long. F64.base. t_lf == false) ?\ (b8_x_reteruns_unsigned_long. D.offset » standard_log_plus_one) :\ ( (b8_x_reteruns_unsigned_long. D.base & except_of_most_left ) » standard_log) ) */ ///////////////////to the one (associated or parent)///////////////////////////// inline void read__where ( unsigned int64 where ) { theJJi (where, false ); } inline void read TJJi ( unsigned int64 where ) { theJJi (where, false ); }//{ theJJi (asJJi ( where ), false ); } //inline void read_A_Ui ( unsigned int64 where ) { theJJi (where, false ); } ///////////////////////////NP. (or parent) section////////////////////////////////////// #define is_not_NP most_left_only //#define to_NP 1 //#define no_NP (-1) //inline unsigned long make_parent (short st) {P_0->by. Pc. D.base = (mark_of (st) ) ; } /* inline unsigned long make_parent (short st)// what about fan sys?????????? {unsigned int64 Ui=P_0->by.Ui.H; /////////////NO NEED unsigned long Cp; read_where ( as_associative_sys (P_0->by .Ui) .H) ; // use to convert Ui (associative_sys) to Ui (normative_sys) if (Uses. old) {P_0->by.Pc. D.base = (Cp=mark_of (st) ) ; readJSMJi(Ui) ; // read_where ( Ui) ; } else { P_err(25); Cp = mark_of(st); } P_0->by.Pc.D.base=Cp; return Cp; //P_0->by. Pc. D.base = mark_of (of_gate) ; } //which was initalized with is_not_NP */ // inline b8 get_Ev (){} inline b8 get_EvX ( ) { b8 Ev; unsigned int64 Ui=P_0->by .Ui.H; ////////NORMATIVE/////NO NEED read_where ( as_associative_sys (P_0->by .Ui) .H) ; // use to convert Ui (associative_sys) to Ui (normative_sys) if (Uses . old) Ev.D.offset= P_0->by. Pc . D. offset ; //associative else P_err (25) ; read_N_Ui(Ui) ; Ev.D.base= P_0->by . Pc. D.offset ; //normative return (Ev) ; } inline void set_EvX (b8 Ev) {unsigned int64 Ui=P_0->by.Ui.H; ////////NORMATIVE/////NO NEED read_where ( as_associative_sys (P_0->by .Ui) .H) ; // use to convert Ui (associative_sys) to Ui (normative_sys) if (Uses. old) P_0->by. Pc.D. offset = Ev. D.offset; //associative else P_err (25) ; read_N_Ui (Ui) ; P_0->by.Pc.D.offset = Ev. D.base; //normative } ///////////////////////////combinate section////////////////////////////////// #define to__make true//to_write=true #define to_get false//to_write=false #define no st 0 //Ii. D.base ==> assoicative_parent . Pc. D.base II I I _| x_bits // _| base | offset // RUi _| I // is normative_sys (Ui) || // Ui _| I |_ // |Mi| I I |_ ( Ui(P) « 1 ) == |Mi| (C) // Mi I I |_ ( Ui(P) « 1 ) + is_NEG(Mi(C) ) == Mi(C) // is_signed(Mi) I |_ // Cp _| I // Ev _! I |_ // Pc _| I |_ //////////////??????????????? // if (initalizing) Ii.H = as_signed (what) ; // ( H « 1 ) // use to convert unsigned to signed // else Ii.H = as_Mi(what); // taking out the distinguishing bit of the 2 systems , // Ii.F64.offset.t_00 = minus; //is_NEG( H ) == ( H & 1 ) // valid for both signed and unsigned // b8 NUi, AUi;//, Ii; // if (initalizing) Ii. D.base = as_signed (AP. c. D.base) ;// ( H « 1 ) // use to convert unsigned to signed // else Ii.D.base = as_Mi (AP. Pc. D.base) ; // taking out the distinguishing bit of the 2 systems , //???????Ii.F64. offset. t_00 = minus; // Ii.F64.offset.tJD0 = minus; //is_NEG( H ) == ( H & 1 ) // valid for both signed and unsigned /* Abstract: Many parents define one child, where the number of digits of Ui ( unique identifier ) of the child is the number of the parents and where each parent relates many children, by. using the hash pointer or Ia( input atrgument ) of one of the parents, as one digit in the numerical calculation of the Ui of the child of that parent. 0 =< Ev(i) , d(i) < Z(d) 0 =< Cp , la < Z(d) / Z(att) d(T) = Cp(P(T)) * Z(att) + attribute d(T) = att * ( Z(d) / Z(att) )+Cp(P(T) ) object rotated object Ui = Cp ( P ( 0 ) ) : Cp(P(l) ) Ui = (Cp(P(l)) Cp(P(0) )) + Z(Ui)/2 Pc = Cp(C) : Ev(0) Pc = Cp(C) : Ev(l Mi(0) = NUi Mi(0) = NUi Mi ( 1 ) = AUi Mi ( 1 ) = AUi */ // bool Ia=false, inline void combinate ( P_by NP, // the normative parent P_by AP, // the associative parent bool to_write = to_get,// read = to_get / write=to_make // unsigned int64 what, // the associative parent as Ii bool minus = false, // unsigned long st = no_st, // the standard level of use l unsigned long Nst = no_st, unsigned long Ast = no_st, bool associative_sys = Is_normative_sys )// Is_normative_sys / Is_associative_sys { b8 NUi, AUi; if ( to_write ) { if ( ( (Nst == -1) I I (Nst == ( NP.Pc.D.base»25) && lNP.Pc.F64.base. t_lf ) ) & & ( (Ast == -1) M (Ast == ( AP.Pc. D.base»25) && lAP.Pc.F64.base. t_lf ) ) ) ; else P_err(-103) ; if ( NP.Pc.F64.base. t_lf && Nst != no ^ st ) {the Ui( NP.Ui.H, false }; if ( Uses. old && 1 P_0->by . Pc. F64.base. t_lf ) {NP.Pc. D.base = mark_of (Nst) ; P_0->by.Pc. D.base = NP. Pc. D.base; } else {P_err (-103) ; return; } } if( AP.Pc.F64. ase. t_lf && Ast != no_st )//Ast 1= no_st { theJJi ( AP.Ui.H, false ); if ( Uses. old && 1 P_0->by. Pc. F64.base. t_lf ) {AP.Pc. D.base = mark_of (Ast) ; P_0->by.Pc. D.base = AP. Pc. D.base; } else {P_err (-103) ;return; } // <««««««««««« } } else if ( NP.Pc.F64.base. t_lf | | AP. Pc. F64.base. t_lf) {P_err (-103) ; return; } AUi. D.base = AP.Pc. D.base ; // force associative_sys AUi. D. offset = ( NP.Pc. D.base « 1 ) | minus; // Cp has no first bit NUi. D.base = NP.Pc. D.base I most_left_only ;// force normative_sys NUi. D. offset = ( AP.Pc. D.base « 1 ) | minus;// Cp has no first bit if ( to_write ) {theJJi ( AUi.H, to_write ); // associative_sys if ( Uses. old ) {the_Ui( NUi.H, to_write ); // normative_sys } else// new object // {P_0->to.Ii.H = as_signed (AP.Ui.H ); P_0->to.0i.H = as_signed(NP.Ui.H) ; // make_new_object_associative_sys // P_0->by.Pc.F64.base.t_lf = true; // P_0->by. Pc. D.base = most_left_only; theJJi ( NUi.H, to_write ); // normative_sys P_p->to.Ii;H = as_signed (AP.Ui.H ); P_0->to.0i.H = as_signed(NP.Ui.H ); // make_new_obj ect_normative_sys P_0->by. Pc. D.base = most_left_only; // P_0->by.Pc.F64.base.t_lf = true; }} else//( to__write ==false) {if (associative__sys) theJJi ( AUi.H, to_write ); // set_gate_associative_sys else the_Ui( NUi.H, to_write ); // normative_sys }} ///////////////////////collection section///////////.////////////////////////// int collection_of ( bool associative_sys, P_object tHis, int max, int function ) {if ( tHis. by. PC.F64.base. t If ) return(max); //is not parent if ( !associative_sys) tHis. by. Pc. D.base |= most_left_only; // NUi. D.base = NP.Pc. D.base | most_left__only; // force normative_sys // AUi. D.base = AP. Pc. D.base; // force associative_sys // // NUi. D. offset = ( AP.Pc. D.base « 1 ) | minus; // Cp has no first bit // AUi. D. offset = ( NP.Pc. D.base « 1 ) | minus; // Cp has no first bit manage_collection object = set_step_block ( tHis.by. Pc. D.base , 0 ); if( object. stop == false ) while ( object . P_0->by. Ui.D.base == tHis .b . Pc. D.base && max—) {if ( is_NEG( object. P_0->by. Ui.H ) ) P_function ( function , object. P_0 , associative_sys) ; //negative else P_function( function , object. P_0 , associative_sys) ; //positive if ( object . left_to_do— ) object. P_0—; else if ((object = step_block_back (obj ect) ). stop) return (max) ; } return (max) ; } int collection_ofX ( bool associative_sys, P_object tHis, int max, int function ) {if (associative_sys) //tHis == Ii {b8 Ii ; // Ii.H=as_abs (Ii.H) ; //as_Ni (as_abs (Ii.H) ) ; //Ii = Ii_of (tHis .by) ; //all which mentions the same object as tHis does !!!!!! // Ii.H = as_Mi (tHis.by. Ui.H) ;//all which mentions tHis I!!!!! Ii.H =tHis.by.Ui.H«l; unsigned long objects_marker = Uses .marker [1] « l;//shft to left because CpC«l manage_collection gate = set_step_block( Ii.D. base » 1 , 0, false ), object;// = set_step_block( Ii.D. offset , objects_marker , rue); object = set_step_block( Ii.D. offset » 1 , gate. P_0->by. Pc. D.base « 1 , true) ; if ( gate. stop == false && object. stop == false ) {while ( gate. P_0->by. Ui.D. offset < objects_marker // otherwise these are objects and not gates && object. P_0->by. Ui.D. base == Ii.D. offset » 1 // this is the base Ui of associative_sys objects && gate. P_0->by. Ui.D. base == Ii.D.base » 1 // this is the base Ui of associative_sys gates ) {unsigned long g = gate . P_0->by. Pc. D.base, //CpC b =( obj ect. P_0->by. Ui.D. offset » 1 ); //( ( (CpP«l) I ...)»l)==CpP if (g == b) {if ( Imax— ) return (0) ; else {if ( is_NEG{ object . P_0->by. Ui.H ) ) P_function ( function , object. _0 , associative_sys) ; //negative else P_function( function , object. P_0 , associative_sys) ; //positive if( gate.left_to_do— ) gate.P_o- r else if ((gate = step_block_back (gate, false) ). stop) 5 return (max) ; object = set_step_block ( Ii.D. offset » 1 , gate. P_0->by. Pc. D.base « 1 , true) ; // if( object. left_to_do— ) object. P_0—; 10 // else if ((object = step_block_back (object, true) ). stop) return (max) ; }} else if ( ( g == most_left_only ) | | g < b ) 15 { if ( gate . lef t_to_do — ) gate . P_0 — r else if ((gate = step_block_back (gate, false) ). stop) return (max) ; } 20 else// object = set_step_block( Ii.D. offset » 1 , gate. P_0->by. Pc. D.base « 1 , true) ; // {if( object. left_to_do— ) object. P_0— ; 25 // else if ((object = stepjolock back (obj ect, true) ). stop) retur (max) ; }} //} }//} 30 else//tHis.Pc. D.base ==Cp//??????????????? if( !of_associative_sys ( H ) ) { // read_where ( asJJi (tHis . to.Oi.H )); // tHis=*P_0; if ( tHis. by. Pc.F64. base. t_lf ) 35 return(O); //has no NP manage_collection gate = set_step_block ( (tHis .by. Pc. D.base | most_left_only) , 0, false ), object; 40 if (gate. stop == false) {while( gate. P_0->by.Ui . D.base == gate. first .D.base ) {if ((object = set_step_block( (gate. P_0->by. Pc. D.base | most_left_only) , 0, true) ) . stop) 45 return (max); else//if (is_NEG( object . P_0->by. Ui.H )==true) then Ii is negative { while ( object. P_0->by.Ui. D.base == (gate. P_0->by. Pc. D.base | most_left_only) ) {if ( Imax— ) ' 50 return (0) ; else P_function ( function, object . P_0, associative_sys ); if ( object . left_to_do— ) object. P_0— ; else if ((object = step_block_back (object, true) ). stop) 55 return (max); }} if ( gate, left_to_do— ) gate.P_0— ; else if ((gate = stepjolockjoack (gate, false) ). stop) return (max) ; } } } return (max) ; } ////////////////////////////what section////////////////////////////////////// /////////////////reading association section///////////////////////////////////// inline P_by old_under ( PJby NP , P__by associated, bool as_minus = to_positate, bool associative_sys = Is_normative_sys ) {if ( NP.Pc.F64. base. t_lf || associated. Pc. F64.base. t_lf ) Uses. old = false; //so has no NP else combinate ( NP, associated ,to_get, as_minus, no_st, no_st, associative_sys ) ; return { P_0->by ) ; } .///////////////////////writing association section/////////////////////////// inline P_by new__under ( P_by NP , P_by associated, short of_Nst=-l , short of_Ast=-l,bool as_minus= to_positate, short of_Cst=-l)// ,bool be_NP = no_NP ) {combinate (NP, associated , to_make, as_minus, ofjNlst, of_Ast ) ; //associative_sys = true if ( P_0->by.Pc.F64.base.t_lf && of_Cst>-l) {P_0->by.Pc. D.base = mark_of (of_Cst) ; } // make_parent (of_Cst) ; } return ( P_0->by ) ; } ////////////////////////when P_0->by is NP///////////////////////////// inline P_by new__of ( P_by associated , short of_Nst , short of_Ast=-l, bool as_minus= to_positate, short of_Cst=-l) //, bool be_NP = noJSJP ) ' {//if ( P_0->by.Pc.F64.base.t_lf ) {make_parent () ; } //so has no NP combinate (P_0->by, associated , to_make, as_minus, of_Nst, of_Ast ) ; //associative_sys = true if { P_0->by.Pc.F64.base.t_lf && of_Cst>-l) {P_0->by.Pc. D.base = mark_of (of_Cst) ; } // {make_parent (of_Cst) ; } return ( P_0->by ) ; } ///////////////////reading input argument section///////////////////////////// inline P_by of_input_argument_under ( P_by NP , PJby la, bool as_minus = to_positate ) ' • {la. Pc. D.base = Ia.Ui .D. offset; if ( NP.Pc.F64. base. t_lf ) Uses. old = false; else combinate ( NP, la , to_get , as_minus ) ; //to_gate, associative_sys = true return ( P_0->by ) ; } ///////////////////////writing input argument section/////////////////////////// inline P_by new_input_argument_under ( P_by NP , PJby la , short of_Nst ,bool as_minus = to_positate, short of_Cst=-l) //, bool be__NP = no NP ) {la. Pc. D.base - Ia.Ui.D. offset; ~ combinate (NP,Ia ,to_make, as_minus, of_Nst, no_st ); //associative sys = true if ( P_0->by.Pc.F64.base.t_lf && of_Cst>-l) {P_0->by.Pc. D.base = mark_of (of_Cst) ; } // {make_parent (of_Cst) ; } return ( P_0->by ) ; } //////////////////////installation/////////////////////////////////////// / / / / / / / / void des_Pile ( ) { if ( Uses . pile_state__is ) destruct_io ( ) ; } /* inline void make_f rame ( ) { // make_parent (of_default) ; // Uses. frame [ Uses . last_frame ] = P_0->by; note_frame (Uses . frame [ Uses . last_frame ], Uses . last_frame ) ; Uses .last_frame ++; } */ inline void fan_flow ( P_by associated , short of_st, bool as_minus ) {new_of ( associated , of_st, of_st, as_minus , of_st) ; }//of_default) ; }//toJSTP) ; } inline void mentionning_flow (Pjoy NP, PJby associated, short of_st, bool as_minus) {new_under (NP, associated, of_st , of_st, as__minus, of_st) ; }//,of_default) ;}//,to_NP) ; } void install_Pile ( ) [S = US; C = UC; . Uses . RAMcounterEND = malloc_P_objects ( 0, max_cache, true) - 1; S = US ; C = UC; S->edge.H = full__full; C->edge.H = full_full; Uses . P_obj ectEOF = 0; S->file[idP] = Uses. P_obj ectEOF; Uses . P_obj ectEOF += P_object_buf_size; S->file[idL] = Uses .P_objectEOF; Uses . P_obj ectEOF += P_object_buf_size; Uses. total [idC] = 0; Uses. total [idP] = 2; // including Ui.H==0 UC->ram[idP] ->by.Ui.H = full_most_left_only ;// for bouth sys (UC->ram[idP]+l) ->by.Ui = as_associative_sys (UC->ram[idP] ->by.Ui .)) ;// for bouth sys P_0 = UC->ram[ idP ] +1 // when the object is in the normative_sys /* Uses . total [idC] 0; Uses . total [idP] 3; // including Ui.H==2 UC->ram [idP] ->by . Ui . H = (2 full_most_left_only) ;// for bouth sys (UC->ram[idP]+l) ->by . Ui = as_associative_sys (UC->ram [idP] ->by . Ui ) ; // for bouth sys P_0 = UC->ram [ idP ] // when the object is in the associative__sys */ S->uses [idP] Uses .total [idP] ; C->uses [idP] Uses . total [idP] ; set the standards ( .' // mark_of (of_gate) ; //for the first parnet will not be its gate // mark of (of_default) ; P_0->by. Pc. D.base = mark_of (of_default) ; // make_parent (of_default) ; Uses .last_list_index = 0; Uses .list_index = 0 short last_frame = 0 Uses. frame [ last_frame ]= P_0 ->by; P_by a_a; a_a.Ui.H = 4; //0x7FFFFFFE; //the last of the first Cp Uses. frame [ last frame++ ] = new_input_argument_under ( Uses , f rame [ last_frarαe , a_a , of_de fault , to_positate , of_default ) ; Uses. frame [ last frame++ ] = new_under ( Uses. frame [ pile_NP ] , Uses. f ame [ pile_NP , of_default , of_default , to_positate , of up ) ; P_by up = Uses . frame [dataJNFP ] while ( last_f ame < PileMAXframe) Uses. frame [ last_frame++ ] = new_under (up , Uses. frame [ last_frame - 1 ] ,of up, last frame-1, to positate, last frame P_by last = Uses. frame [—last_frame] ; // Uses .NULLDATA[0] = new_under ( up, last, of_up, last_frame, false , of_null) ; // for (short m = 0; m < max_M; ) // Uses.NULLDATA[++m] = new_of ( Uses .NULLDATA[m] , of j null, of null, false , of null); Uses.pile_state_is = true; } #endif // piledata #ifndef piledata_def #define piledata_def //#include "pileout. h" //see also "piledata.txt" 111111111111111111111 W oles/ / / 111 / / 1 / / 111 / 1 / 11 / 1 / / 1111111111111111111111 ////// //////////////////////wholes writing//////////////////////////////////////////// void load__content_to_list (P_by index, P_by content) {if ( ( Uses . list_index = index. where ) > Uses . last_list_index ) Uses.last_list_index = Uses . list_index; new_input_argument_under ( Uses. frame [ list_NP] , index, of_list) ;//, to_positate, of_default) ; read_where ( as_associative_sys (P_0->by.Ui) .H) ; P_0->by.Pc=content.Ui; // set_Ev (content .Ui) ; // P_0->to.Ev.H content . where; } out_write_data make_content (out_write_data last,P_by Class, signed long __operator ) {if (Class. Pc.F64. base. t_lf) Class . Pc. D.base = mark_of (of_class) ; // make_parent (of_class) ; new_under ( Uses. frame [ content_NP] , Class ,of_content ,of_class); read_where ( as_associative_sys (P_0->by.Ui) . H) ; P_0->by . Pc=last . action_outcome.Ui; // set_Ev (last . action_outcome. Ui) ;// P_0->to.Ev.H = last . action_outcome .where ; new_under ( Uses. frame [ content_NP ] , Class, of_content, of_class, to negate) ; b8 op; op.H= _operator »3; read_where ( as_associative_sys (P_0->by.Ui) . H) ; P_0->by.Pc=op;// set_Ev (op); // P_0->to.Ev.H = _operator »3; return (last) ; } . signed long read_data (unsigned int64 , unsigned int64 , short , bool ); out_write_data write_data ( unsigned char *figure, unsigned long byte_size) {long objects number = ( (Uses . total [idP] + Uses .total [idL] ) »1) , objects_buffers = Uses . total [idS] , involved_obj ects_number = 0; unsigned int Location = l;//of the figure unsigned long open = 0, // bits representation of marking the Location: MJoits, //false closed fan (S=l) , true opened fan (S=0). M_bits_or ; unsigned char M, //M as the magnification last_M = 0 , //the bit number ' of_st = of_crude;// of standard level b8 *figureS; out_write_data _; //return P_by crude_figure, //the crude figure crude_data_NP = Uses . frame [crude_NP ] , // the crude NP prev_ordin_NP [max_M ] , ordin_NP [ max_M ], //the ordinary NP // prev_ordin_NP [ max_M ], //the previous ordinary NP compl_NP [ max_M ] , HW, HW_parent=Uses . frame [add_before_NP] , //the complJSTP is the complementary NP which is prey_last_ordin under up //(and is also the NP of the associated ordin_NP [M] //used as HW herichcical what object) //add_before_NP last_ordin, //the last of the ordinary last_compl; //, //the previous last of the ordinary used // as the complJSTP [M] what under up // associated_by_ordin_NP[max_M] ;// is the between what under the compl_NP [M] crude_figure.Ui.H = 0; _.old = 0; figure += byte_size; //backward writing for reading with no size figures = (b8*) figure; for ( ; Location <= byte_size; Location++, of_st = of_crude ) {if ( 1 ( (Location-1) &7) ) figures— ; //txt _ crude_figure.Ui.C[0] = figureS->C[ 7 - ( ( Location - 1 ) & 7 ) ];//txt last_ordin = new_input_argument_under ( crude_data_NP, crude_figure, of_crude, to_positate, of_crude+l) ; //, toJSTP) ; //S=1,M=-1 involved__objects_number++; M = 0; MJoits = 1; M_bits_or = 0 ; if ( 1 ( Location & 1 ) ) do {of_st++; //closing opened NPes last_coit.pl = last_ordin; // complJSTP [M] = last_ordin; last_ordin = new_under (ordinJSJP [M] , last_ordin, of_st, of__st, to_positate, of_st+l) ; //S=l, ordinary involved_obj ects_number+=2 ; open = M_bits; // for the remaineS M_bits_or += M_bits ; if ( ( Location > ( M_bits «= true ) ) && ( 1 ( Location & M_bits_or ))) {P_by// the between case //S=l, compl, between between = new_under (compl_NP [M] , ordin_NP [M] , of_st, of_st, to_positate, of_st+l) ; new_of (last_compl, of_st+l) ; //S=2, compl, the_4th HW = new_under ( HW_parent, prev_ordin_NP [M] , of_HW , of_st, to_positate, of_HW ) ; new_under (between, HW, of_st+l, of_HW) ; //S=2,the l_th involved_obj ects_number+=3 ; } compl_NP [M] = last_com.pl; ////////bzzz HW = new_under ( HW_parent, ordin_NP[M], of_HW , of_st, to_positate, of_HW ); new_under (compl_NP[M] , HW, of_st) ; //, of_HW) ; //S=l, compl, HW involved_objects_number++; M++; } while ( ! ( Location & M_bits ) ) ; //as long as M represented by M_bits of the Location are open if ( Location < byte_size ) // else belongs to the remaineS {//building the new ordinary NP ordinJSTP [ M ] prev_ordin_NP [M] =ordin_NP [M] ; ordinJSJP [M] = last_ordin; //last_open //UPUPUPUPU// prev_ordin_NP [M] = ordinJSJP [M] ; if ( last_M < M )last_M = M; open Λ = M_bits; //for the remaineS _.old += Uses. old * MJoits; }} if (M < last_M )// the remaineS of the lefted open preapered ordinary epexes {for( Location—, last_M++, M++; M < last_M ; M++ ) {M_bits_or += M_bits; MJoits «= true; last_compl = last_ordin; // prev_ordin_NP [M] = last_ordin; of_st = (short) (of_crude + 1 + M ) ; if ( open & MJoits ) last ordin = new_under (ordin_NP[M] , last_ordin, of_st, (last_ordin. Pc. D.base»25) , to_positate, of_st+l) ; // , to_positate, of_st+l) ; //, to_NP) ; //S=l, ordinary // else // the remaineS of the lefted closed ordinary epexes // last_ordin = new_under (Uses . frame [ NULLDATA_parent] , last_ordin, of null, (last_ordin. Pc. D.base»25) ) ; // to_positate, of_st+l) ; //, of_st) ; //S=l, ordin involved_objects_number++; if ( ( Location > ( MJoits )) && ( ! ( Location & MJoits_or ) ) ) {PJoy// the between case //S=l, compl, between between=new_under (complJSTP [M] , ordin_NP [M] , of_st, of_st, to_positate, of_st+l ) ;//,to_NP) ; new_of (last_compl, of_st+l) ; //S=2, compl, the_4th new_under (between, HW, of_st+l, of_HW) ; //S=2,the l_th involved_obj ects_number+=3 ; ' } complJSTP [M] = last_compl; //UPUPUPUPU HW = new_under( HW_parent, ordin_NP[M], of_HW , of_st, to_positate, of_HW ) ; new_under (last_compl, HW);//, of_st-l, of_HW) ; //S=l, compl, HW involved_obj ects_number+=2 ; }} _.action_outcome = last_ordin; sprintf ( inputjouf , "number of pile objects involved=%d \r\n\ number of pile objects =%d (new =%d) \r\n\ number of pile buffers =%d (new =%d) \r\n\ number of data objects =%d \r\n\ number of sub intervals =%d " , involved_obj ects_number ,( (Uses, total [idP] + Uses .total [idL] ) »1) ,( (Uses . total [idP] + Uses .total [idL] ) »1) - objects_number ,Uses.total[idS] , Uses .total [idS] - objects_buffers ,byte_size , ( ( (byte_size * byte_size) + byte_size ) » 1 ) ) ; P_spread_out ( 3 ) ; // read_data (_. action_outcome.Ui.H, 0,200 ,2); return (_) ; } //////////////////////wholes or parts read±ng 111111111111111111111111111111111 signed long read_dat ( int64 last_where, int64 operate, char * figures , signed long max_size,bool show ) {b8 N_last_where; N_last_where . H=last_where; if( of_associative_sys ( last_where ) ) //read_dat is valid only from the leading sys {N_last_where.H=last_where ; last_where = (as_normative_sys (N_last_where )).H;// use to convert Ui (normative_sys) to Ui (associative_sys) } unsigned int64 NP[max_M] , //NPes if LIFO order crude_data_NP = Uses . frame [crude_NP ] .where ,//the NP of fan of figures with no location *b8_figures = (unsigned int64 * ) figures; b8 Ii;//Ii = Ii_of (object .by) ; PJoy counter_use_NP = Uses. frame [ counter_NP ]; unsigned short LIFO_id = 0;//LIFO index signed long outSIZE = 0; unsigned long essentiality = 0; P_object object; read_N_Ui (last_where) ; if (show && as_Ni( P_O->to.0i.H )==Uses . frame [ addJoeforeJSTP ].Ui.H ) collection_of ( Is_associative_sys, *P_0, 20, 200+Is_associative_sys) ; //function) ; //by associative_sys representing the PREVIOUS intervals also containing the current interval // {read_where( as_Ni (Ii_of (P_0->by) .H )) ; } if (lUses.old) {if(Is_txt) *figures = No nreturn (0) ; } ' else // if(show&& of_crude >= st_level (P_0->by.Ui) ) // of_list >= st_level (P_0->by.Ui) } //as_Ui (as_abs ( P_0->to. according) ) == counter_use_ΝP.Ui.H || if ( shows& of_crude > st_level (P_0->by .Ui) ) read_where( as_Ni (P_0->to . Ii .H) ) ; // Ii_of (P_0->by) .H) // read_where( as_Ni(Ii_of (P_0->by) .H) ) ; if( of_list >= st_level(P_0->by.Ui) ) //as_Ui (as_abs ( P_0- >to. according) ) == counter_use_NP.Ui.H || {if(Is_txt) *figures = NO ' ; //read_where (object .by .where) ; // < should be on return return (outSIZE) ; //return true; //so no more to read } loop: if ( Uses. old ) //&& of_class < st_level (P_0->by.Ui) ) object = *P_0;//&& as_Ui (P_0->to.0i.H) 1= 3 else {P_err(25) ; if(Is_txt) *figures = NO ' ; // read_where ( last_where) ; read_where (object .by.where) ; // < should be on return return (outSIZE) ; //return true;//so no more to read } /* // countering new_under (counter_use_ΝP, object .by, of_counter, ( object .by . Pc . D . base»25) ) ; // st_level (object .by. Ui) // of_complementary) ; if ( Uses. old ) {unsigned int64 XUi=P_0->by.Ui.H; ////////NORMATIVE/////NO NEED P_0->by.Pc. D.offset += essentiality ++; //essentiality ,this value is a counter of the object useage by the path of reading so it increases with reveresd direction of the path of decresed writng read_where ( as_associative_sys (P_0->by.Ui) .H) ,- // use to convert Ui (associative_sys) to Ui (normative_sys) if(Uses.old) P_0->by. Pc.D. offset++; //usage, this value is a counter of the object usage else P ^ err (25) ; // read N Ui(XUi) ; } // countering end */ // else P_err (25) ; if is_NEG(object. to. according) react_object (object) ; else {object, to. according = asJSJi (object .to. according) ; //<— |Mi.H| Ii.H = asJSIi (object .to. Ii.H) ; if ( of_null == st_level(object.by.Ui) ) read_N_Ui ( Ii .H) ; //of_null <== association of the object else {if ( object. to. Oi.H == crude_data_NP) // so the object is crude figure {if ( outSIZE >= max_size ) return (outSIZE) ; //out of the given buffer size else {if(Is_txt) {*figures = Ii.C[0] ;//»l;//uninitializing_connection(Ii.C[0] ) ; // Ii.C[0]»l; figures++; outSIZE++; } else {*b8_figures = Ii.H; b8_figures++; outSIZE += 8; } //output if ( LIFO_id ) readJSTJJi ( NP [ —LIFO_id ] ); //association of the first out NP else {if(Is_txt) *figures = NO ' ; readJSTJJi (object .by .where) ; // < should be on return return (outSIZE) ; //return true; //so no more to read }}} else // so the object is not crude figure {if( of_HW == st_level(Ii) ) // so object is HW or the_lth { readJSTJJi ( Ii.H) ; ΝP[ LIF0_id++ ] = as_Ni (P_0->to . Ii .H) ; // //li_of(P_0- >by) .H ) ; readJSTJJi ( obj ect . to . according) ; //ReadUp ( ) ; } else {if (of_counter < st_level (object .to . Oi) ) NP [ LIFO_id++ ] = object .to. according; //sets in LIFO the last in NP else read_N_Ui( Ii.H ) ; readJST_Ui ( Ii.H ); // <== association of the object }}} goto loop; } }//read_dat signed long read_data (unsigned int64 last_where, unsigned int64 operate, short to, bool show) {if ( 1 last_where) return(O); else {Is txt = true; signed long ret = 0; b8 normative_sys_last_where; normative_sys_last_where.H = last_where; ret = read_dat ( normative_sys_last_where.H, operate, inputjouf, inputJoufjnax, show ) ; if( ret) P_spread_out ( to); return (ret) ; } }//read_data ////////////////////// whole reading/////////////////////////////////// signed long read_content ( Pjoy Class , short to ) {//if( of_associative_sys ( Class. Ui.H ) ) // Class .Ui=as_normative_sys (Class .Ui) ; // use to convert Ui (normative_sys) to Ui (associative_sys) readJSTJJi (Class. Ui.H) ; Class=P_0->by; old_under ( Uses. frame [ content_NP ] , Class, to_negate ) ; if ( lUses.old ) { P_err(14); return(O);} read_where ( as_associative_sys (P_0->by.Ui) .H) ; b8 operate = P_0->by. Pc; //get_E ( ) ; // old_under ( Uses. frame [ content_NP ] , Class); if ( lUses.old ) { P_err(15); return(O);} read_where ( as_associative_sys (P_0->by.Ui) .H) ; b8 where = P_0->by.Pc; signed long ret = read_data ( // P_0->to.Ev.H // get_Ev() .H where .H , operate. H, to, false ) ;// read_data ( P_0->by. value, operate. H, to ) , if (1 ret) P_err(16); return (ret ) ; } //read_content signed long read_data_by_list (P_by index, short to ) {of_input_argument_under ( Uses. frame [ list_NP ] , index); if ( lUses.old ){ P_err(17); return (0);} else {Uses . list_index = index. where; Pjoy Class; read_where ( as_associative_sys (P_0->by.Ui) .H) ; b8 where=P_0->by. Pc; Class.where = where . H // get_Ev() .H //P 0->to.Ev.H return (read_content ( Class , to )); } }//read_data_by_list unsigned long get_last_list ( ) {return (as_abs (Uses . last_list_index) ) ; } //Uses . last_list_index»l) ,- } unsigned long get_current_list ( ) {return (as_abs (Uses .list_index) ) ; } //{return (Uses . list_index»l) ; } void mSgList ( ) { sprintf ( inputjouf, "current in the list is %-121u last is %-121u ' , get_current_list ( ) , get_last_list ( ) ) ; P_spread_out ( 5) ; } void read_from_list (int seting) {seting += seting; if ( seting <= Uses .last_list_index && seting > 1 ) {P_by index; index.where = seting; read_data_by_list ( index ,1); } mSgList () ; } //read_from_list //////////////////////parts ////// v iiiii/ii/ iiin fii/iiiiiii/iiin ' in/mini Il/III/II/I/I/I/IIIII/parts o tl / 11 / / / / / 1 / / / / / / / / / 111111111111111111111111111111 I lll/I llll ll/ll I l Interval///////////////////////// int get_containing_Interval ( P_object *interval, int max, int function = 2 ) {//max -= collection_of ( Is_associative_sys, *interval, max, 200+Is_associative_sys) ; //function) ; //by associative_sys representing the PREVIOUS intervals also containing the current interval //max -= collection_of ( Is_normative_sys, *interval, max, 200+1s_normative_sys ); // function) ; //by normative_sys representing the NEXT intervals also containing the current interval return (max) ; } int Grow_by_Interval ( P_object *interval, int maximim, int function = 2 ) {int max = 4, stck__control = maximim; P_object stack[0x2000] ; Uses . stack_P_0 = stack; while (stck_control— ) {//max -= collection_of { Is_associative_sys, *interval, max, 100+Is_associative__sys) ; //function) ; //by associative_sys representing the PREVIOUS intervals also containing the current interval //max -= collection_of ( Is_normative_sys, *interval, max, 100+Is_normative_sys) ; // function) ; //by normative_sys representing the NEXT intervals also containing the current interval if ( Uses . stack_P_0 == &stack[0] ) return (max) ; else {Uses . stack_P_0—; *interval = *Uses . stack_P_0; }} return (max) ; } signed long lay_data_part_out ( P oy object, short to, bool to_cmp,bool show)//, bool to_show=true) // (unsigned int64 last_where, short to, bool to_cmp,bool show)//, bool to_show=true) {if ( 1 object.where) return(O); // Pjoy object; obj ect.where=last_where; // old_under (Uses . frame [counterJSJP ], object); //if ( lUses.old) //return (0) ; // b8 last = get_Ev(); //P 0->to.Ev; signed long size; //size = read_data (object .where, 0,to ) ; if( show ) {size = read_data (obj ect. where, 0,200 , show) ; } else size = read_data (object .where, 0, to, show ); if (size) {if( to_cmp ) {memcpyt working_pointer, input_buf, size ); working_pointer+=size; } //object=P_0->by; if ( show ) { //read_where read_N_Ui ( object. where ); //object .where // Grow_by_Interval(P_0, 20, 2) ; get_containing_Interval ( P_0, 20, 2 );//// int get_containing_Interval ( P_object *interval, int max, int function = 2 ); } old_under (Uses . frame [counterJSTP ], object); //if ( lϋses .old) // return (0); /* b8 first = get_Ev ( ) ; sprintf ( input_buf "\r\n\ the automatic counters of THE SUB INTERVAL were:\r\n\ (of the first, of the last)\r\n\ usage = (%lu , %lu) \r\n\ essentiality = (%lu , %lu) " , first .D.offset//P_0->to.Ev.D. offset , last .D. offset , first.D. base//P_0->to.Ev. D.base , last .D.base ); P_spread_out ( to);*/ } return (size) ; } //lay_data_part_out bool collect_out (P_double_by collect, short to, bool to_cmp,bool show) {bool ret = false; if (lay_data_part_out (collect .m[0] , to, to_cmp, show)) ret = true; if (lay_data_part_out (collect .m[l] , to, to_cmp, show)) ret = true; return (ret) ; } //collect_out /* P_double_by collect_from(P__double_by to_read, short to, bool with_crossing, bool show) {if (with_crossing) collect_out (to_read, to, true, show) ; //, f lse) ; return (to_read) ; } //collect_from */ bool comparE ( unsigned char *cmp,long cmp_size, unsigned char *data, long size , short to, char str_of[] ) {//scan in the range cmp_size for to find all parts of cmp in data unsigned char *c = cmp, *d = data; while ( size > d - data && cmp_size > c - cmp ) {//if cmp is found in data then increses both else increses just cmp pointer/s while (*c == *d) { C++; d++; } //if ( size == d - data ) break; else for ( c = cmp; *c 1= *d; ) C++; } bool ok = ( size <= d - data ) ; if( ok ) //if true then all the parts are found { sprintf (inputjouf, "\r\n\ ! 1 ! all %s crossed!!!" ,str_of); P_spread_out (to ); } else { char *out_to_put; if ( ( out_to_put = ( char * ) malloc ( size+1 )) == NULL) P_err(2); memcpy (out_to_put, data, size) ; out_to_put +=size; *out_to_put= NO ' ; out_to_put -=size ; sprintf ( inputjouf , " \r\n\ ! 1 ! FAILE of %s at %d 1 1 1 \r\n%s " , str_of , d - data , out_to_put) ; if ( to ) { P_spread_out ( -103 ) ; P_spread_out (to ) ; } else P_spread_out ( 2 ) ; free (out_to_put) ; } return (ok) ; } //comper //////////////////////parts matching /////////////////////////////////////////// //At any m, when building the next seq from the current seq, //bouth of the current m, //so that the next m uses the next seq of the previous m as its current seq, //when ft == true the case is SH starting with the complentrary case //and when ft == false the case is UN starting with the ordinary case, //the next->m[0] [1] and the next->m[2] [1] of SH are used for building //the next m from_SH, when the case is denoted as SH 0,2 -> //and the next->m[l] [1] and the next->m[3] [1] of UN are used for building //the next m fromJJN, when the case is denoted as UN 1,3 -> . inline bool check_first_m_ft ( seq * current, seq * next ,bool ft) {//TO DO return true; } P_double_by make_first_seq ( seq *current,seq *next, bool ft , short n) //m==l {P_double_by to_read ; to_read.msg=0 ; to_read.m[0] . Pc.D. offset = 0; to_read.m[l] .Ui.H = 0; if ( n == 3 ) //n==3 4 figures {if (ft) {//return (m_SH (current, next) ); //ft, m == 1 any sequance//n==3, 4 figures // P_by up = Uses .frame [data_NP] ; // <== any M , " s = 0, next->m[l] [1] = old_under ( next->m[0] [0] , current->m[l] [1] ); //between if ( lUses.old ) to_read.rαsg = 7; else {next->m[2] [0] = current->m[2] [1] ; // UPUPUPUP//2th_q s_0 =(up,2th_q s_l) next->m[3] [1] = old_under ( next->m[2] [0] , current->m[3] [1] ) ; if ( lUses.old) to_read.msg = 2; //between | ->2th_q s_l =(2th_q s_0, 2th_ordin s_l) else {to_read.m[l] = next->m[3] [1] ; //to_read. by . where=P_0->by.where; next->m[3] [0] = current->m[3] [1] ; // UPUPUPUP//2th_ordin s_l= (up, 2th_ordin s_l) next->m[l] [0] = current->m[l] [1] ; // UPUPUPUP//lth_ordin_s_0 =(up, lth_ordin_s_0 ) next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ) ; if ( lUses.old) to_read.msg = 5; //lth_ordin_s_l = ( lth_ordin_s_0, 2th_compl_s_l, ) else {old_under (next->m[l] [1] , current->m[2] [1] ) ; to_read.m[0] = P_0->by; .}}}} else {//return (m_UN(current, next) ); //not ft,m == l,any sequance//n==3, 4 figures next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ); //between if ( lUses.old ) to_read.msg = 7; else {old_under( next->m[2] [1] , current->m[3] [1] ) ; next->m[l] [1] = old_under ( next->m[0] [0] , current->m[l] [1] ) ; if ( lUses.old ) to__read.msg = 2; //lth_ordin_s_l = ( lth_ordin_s_0, 1th_compl_s_l) else {next->m[3] [1] = old_under ( next->m[2] [0] , current->m[3] [1] ) ; if ( lUses.old ) {to_read.msg = 3; //2th_ordin_s_l = ( 2th_ordin_s_0, 2th_compl_s_l) to_read.m[0] = next->m[l] [1] ; } else to_read.m[0] = P_0->by; }}}} else {if ( n == 2 ) //n==2 3 figures {if (ft) //return (m_3_SH (current, next) ) ; {//Pjoy up = Uses. f rame [data_NP] ; // <== any M , s = 0, next->m[0] [1] = old_under ( next->m[3] [0] , current - >m[0] [1] ) ;//ordinS_l if ( lUses.old ) to_read.msg = 9; else {next->m[l] [1] = old_under ( next->m[0] [0] , current - >m[l] [1] ); //between if ( lUses.old ) to_read.msg = 7; else {next->m[2] [0] = current->m[2] [1] ; // UPUPUPUP //2th_q s_0 = ( up , 2 th_q s_l ) to_read.m[0] = next->m[l] [1] ; next->m[l] [0] = current->m[l] [1] ; // UPUPUPUP//lth_ordin_s_0 =(up, lth_ordin_s_0) next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ) ; if ( lUses.old ) to_read.msg = 5; //lth_ordin_s_l = ( lth_ordin_s_0, 2th_compl_s_l, ) else to_read.m[l] = next->m[2] [1] ; }}} else//return( m 3 UN (current, next) ) ; {next->m[2] [1] = old_under ( next->m[l] [0] , current->m[2] [1] ); //between ' if ( lUses.old ) to_read.msg = 1; else {to_read.m[0] = P_0->by; next->m[l] [1] = old_under ( next->m[0] [0] , current->m[l] [1] ) ; if ( lUses.old ) to_read.msg = 2; //lth_ordin_s_l = ( lth_ordin_s_0, lth_compl_s_l ) to_read.m[0] = next->m[l] [1] ; //} } to_read.m[l] = next->m[2] [1] ; }} else//n==0| |1 {if( n )//n==l//2 figure {to_read.m[l] = next->m[3] [1] ; next->m[l] [1] = old_under (next->m[0] [0] , current->m[l] [1] ) ; if ( Uses. old ) to_read.m[0] = next->m[l] [1] ; //to_read.by = P_0- >by;//ft-» ordin // 1 ft-»between else {to_read.msg = 3; return (to_read) ;} // collect [1+init [0] ] [0] = collect_from(to_read, 0) ; } else//n==0 1 figures {to_read.m[l] = next->m[0] [0] ; //current->m[0] [1] .where; next->m[0] [1] = old_under( next->m[3] [0] , current- >m[0] [1] ); ////seconde between or seconde ordin when m==0 if (lUses.old ) {to_read.msg = 2; return (to_read) ; } else to_read.m[0] = next->m[0] [1] ; // collect [1+init [0] ] [0] = collect_from(to_read, 0) ; }}} return (to_read) ; }//make_first_seq //if (st_level (P_0->by.Ui. D.base ) ==of_null) P_err (3) ; void Switch (signed char m, unsigned long *calculate, bool *sw ,bool *full, bool *ft) {*calculate += (1 « m) ; //the writing begining - the reading begining *sw = true; // if (*ft) *full Λ = true; //becouse ft didn't complete the n=3 ( for to re begin the sequence) for (;m<max_M; m++,ft++ ) *ft =true; } long set_pile_objectS_to ( unsigned char *figure, unsigned long byte_size, short to, bool with_crossing,bool show) //COMPLETING REQUIRES THE FOLLOWING: // // 0. testing on written data decreased from end and/of from beginning // 1. check_first_m_ft // // 2. applying the remains case which pass through NULLDATA NP // // 3. covering the alternatives by // a. P_erroring the alternatives like the 100 // b. for( short ft=0; ft<32; ft++) if (ok) for // // 4. the growing . data which will use // S = 3 and fan_op and gate_density (pilecon. h) { // SH fr UN fulll UN fr SH fulOl SH fr SH fuOll UN fr UN fuOOl SH fr UN hallO UN fr SH halOO SH fr SH haOlO UN_fr_UN_ha000 //x {3, 2, 1,2} {0,1, 0,3} {3, 0,3, 2} {2, 1,0,1} 2,1,0,1}{0,3,2,3}{3,2,1,2}{0,1,0,3} //y {3, 1,1, 3} {1,3, 3,1} {0,2,2,0} {2, 0,0, 2} 2, 0,0, 2} {2, 0,0, 2} {3, 1,1, 3} {1,3, 3,1} //z {2, 1,1,1} {0,3, 3,1} {3, 2, 2,0} {1,0, 0,0} 2, 1,1, 2} {0,3, 3, 2} {1,0, 2, 3} {1,0, 0,3} Pjoy t[ll] ; //SH fr UN hall0(AND init ) //x{ 0, 0, 0 0},y{l,0,0,0},z{4, 0,0,0} t[8] .Ui.C[0]=0; t[8] .Ui.C[l =0; t[8 .Ui.C[2]=0 t[8] .Ui.C[3]=0; //x t[8] .Ui.C[4]=l; t[8] .Ui.C[5 =0; t[8 .Ui.C[6]=0 t[8] .Ui.C[7]=0; //y t[8] .Pc.C[0]=4; t[8] .Pc.C[l =0; t[8 .Pc.C[2]=0 t[8] .Pc.C[3]=0; //z //SH_fr_SH_ha01O(AND init)/ x{0,0,0 0},y{2,0,0 0}, z{4, 0,0,0}; t[9] .Ui.C[0]=0; t[9] .Ui.C[l =0; t[9 .Ui.C[2]=0 t[9] .Ui.C[3]=0;//x t[9] .Ui.C[4]=2; t[9] .Ui.C[5 =0; t[9 .Ui.C[6]=0 t[9] .Ui.C[7]=0;//y t[9] .Pc.C[0]=4; t[9] .Pc.C[l =0; t[9 •Pc.C[2]=0 t[9] .Pc.C[3]=0;//z //UN fr UN haOOO (AND init) //x{0,l, ,4},y{l,3,3,4} z{l, 0,4,4}; t[10] ,Ui.C[0]=0; t[10] .Ui.C 1]=1; t 10] .Ui.C[2]=0; t[10] .Ui.C[3]=4;//x t[10] ,Ui.C[4]=l; t[10] .Ui.C 5] =3; t 10] .Ui.C[6]=3; t[10] .Ui.C[7]=4;//y t[10] ,Pc.C[0]=l; t [10] .Pc.C 1]=0; t 10] .Pc.C[2]=4; t[10] .Pc.C[3]=4;//z // SH fr UN fulll t[7 Ui C =3; t[7] .Ui.C[l =2 t[7 .Ui.C[2 t[7 .Ui. =2;//x t[7 Ui ,C =3; t[7] .Ui.C[5 =1 t[7 .Ui.C [6 t[7 .Ui. =3;//y t[7 Pc .C =2; t[7] .Pc.C[l =1 t[7 .Pc.C[2 t[7 . Pc. =l;//z //SH _fr _UN hallO (NOT init) t[6 " ϋi " ~C =0; t[6] .Ui.C[l =1 t[6 .Ui.C [2 t[6 .Ui. =3;//x t[6 Ui ,C =1; t[6] .Ui.C[5 =3 t[6 .Ui.C [6 t[6 .Ui. =i;//y t[6 Pc .C =0; t[6] .Pc.C[l =3 t[6 .Pc.C[2 t[6 .Pc. =l;//z //UN _fr SH fulOl t[5 " ui " ~C =3; t [5] .Ui.C[l =0 t[5 .Ui.C[2 t[5 .Ui. =2 //x t[5 Ui .C =0; t[5] .Ui.C[5 =2 t[5 .Ui.C [6 t[5 .Ui. =0 //y t[5 Pc ,C =3; t[5] .Pc.C[l =2 t[5 .Pc.C[2 t[5 . Pc. =0 //z //UN _fr _SH halOO t[4 " ui " .C =2; t[4] .Ui.C[l =1; t[4 .Ui.C[2 t[4 .Ui. =i;// χ t[4 Ui ,C =2; t[4] .Ui.C[5 =0; t[4 •Ui.C [6 t[4 .Ui. =2;//y t[4 Pc .c =1; t[4] .Pc.C[l =0; t[4 .Pc.C [2 t[4 . Pc. =0;//z //SH _fr _SH fuOll t[3 " ui " ,C =2; t[3] .Ui.C[l =1 t[3 .Ui C[2 t[3 .Ui. =l;//x t[3 Ui ,C =2; t[3] .Ui.C[5 =0 t[3 .Ui C[6 t[3 .Ui. =2;//y t[3 Pc .C =2; t[3] .Pc.C[l =1 t[3 . Pc C[2 t[3 . Pc. =2;//z //SH _fr _SH haOlO (NOT init) t[2 " ui " " c =0; t[2] .Ui.C[l =3 t[2 ,Ui.C[2 =2; t[2 .ϋi. =3 //x t[2 Ui .C =2; t[2] .Ui.C[5 =0 t[2 . Ui . C [ 6 =0; t[2 .ϋi. =2 //y t[2 Pc .C =0; t[2] .Pc.C[l =3 t[2 ,Pc.C[2 =3; t[2 . Pc, =2 //z //UN fr _UN fuOOl t[l " ϋi " ,C =3; t [1] .Ui.C[l =2 t[l .Ui. C[2 t[l .ϋi, =2;//x t[l Ui ■ C =3; t[l] .Ui.C [5 =1 t[l .Ui. C[6 t[l .Ui, =3;//y t[l Pc .C =1; t[l] .Pc.C[l =0 t[l .Pc. C[2 t[l . Pc. =3;//z //UN fr _UN haOOO (NOT init) t[0 . " ui " ~C =0; t[0] .Ui.C[l =1 t [0] .Ui.C[2]=0; t[0] .ϋi.C =3;//x t[0 .Ui .C =1; t[0] .Ui.C[5 =3 t[0] .Ui.C[6]=3; t[0] .Ui.C =l;//y t[0 .Pc .C =1; t[0] .Pc.C[l =0 t[0] .Pc.C[2]=0; t[0] .Pc.C =3;//z P_by THE[max_M] [4] [2] // the figure mirror THE[m] [n [s] P_double_by to_read, / /to_read=P_0->by collect [3] [max_M] ; //collect [col] =to read. by. where; //for out put // to_RE_read; // seq last_switched [max M];//for the case of ok=false and calculate>0 unsigned long calculate=0; // calculate+= l«m; //the writing begining the reading begining bool ft [max_M] , //shift sw[max_M] , //switch full [max_M] , //seconde sequnce init [max_M] , //first time at current m init_0, ok; //max_M] ] ; //ok unsigned long Location = 1; //of the data figure figure += byte_size; //backward writing for reading with no size b8 *data_figureS = (b8*) figure; signed char col=0, //; // [3] ; // m, 11=0,// m = M + 1 // s,// s is fan layer step increases from 0 down max_m=0, n; // when M < 1, n = ( ( (Location - ft)- ( s == 0 ) ) & 3 ) , // otherwise n = ( ( (Location - ft)» ( M - 1 ) - == 0 Pjoy crude_figure, crude_data_NP = Uses . frame [crudeJSTP] ;//, //figuers with no loaction at s = 1 // up = Uses . frame [data_NP] ; // <== any M , s = 0, crude_f igure. Ui . H = 0; to_read.m[0] .Ui.H = 0; to_read.m[0] .Pc.H = 0; to_read.m[l] .Ui.H = 0; to_read.rα[l] .Pc.H = 0; to_read.msg = 0; //for (short ft=0; ft<2; ft++) f or ( ok = true, m=0; m < max_M; m++ ) { full [m] =true; init [m] =true; ft [m] =f alse; sw [m] =f alse; collect [0] [ ] = to_read; collect [1] [m] = to_read; collect [2] [m] = to read; } // object. by. Ui.C[4] crude // object. by. Pc.C[0]»l association // object. to.Oi.C[4] init_0=true; if (with_crossing) working_pointer = (unsigned char *) working_buf->C; for ( m = 0; Location <= byte_size && ok ;Location+=4 , m = 0 ) {unsigned char last_def ; if (byte_size - Location + 1 > 4) last_def = 4; else last_def = (unsigned char) (byte_size - Location + 1 ); for ( n = 0; n < last_def; n++ ) // m = 0, when m = M + 1 , M == -1 {if ( 1 ( ( Location + n - 1 ) & 7 ) ) data_figureS—; crude_figure. Ui. C [0] = data_figureS->C [ 7 - ( ( Location + n - 1 ) & 7 ) ]; THE[0][n][l] = of_input_argument_under (crude_data_NP, crude_figure) ; if ( lUses.old ) return (Location+n) ; ' //not any such data figure!!! if ( n == 3 ) {if( !init[0]) {init 0 = false; THE[1] [0] [1] = old_under (THE[1] [3] [0] ,THE[0] [0] [1] ) ; if ( lUses.old | I 1 check_f irst_m_f t ( (seq*) THE [0] , (seq*) THE [1] ,ft[0] ) ) return (Location+n) ; // ok = false; //fail of sequances_check! 11 n=3 } else {seq *current=(seq*)THE[0] , *next= (seq*) THE [1] ; //if (ft [0] = set_first_ft( (seq*)THE[0] , (seq*)THE[l] ,ft[0] ) ) Pjoy between = old_under ( next->m[l-ft [0] ] [0], current->m[2- ft[0]] [1]); if ( Uses. old ) //between {if(ft[0]) old_under( between, current->m[2] [1] ) ; // [2*ft] [ ft] else { Pjoy HW_parent = Uses . frame [add_before_NP] , HW = old_under( HW_parent, next->m[0] [0] ) ; //l_th if ( Uses. old ) old_under ( between, HW); /* if ( lUses.old ) {b8 as_HW; as_HW. D.base = next->m[l-ft [0] ] [0] . Pc. D.base | most_left_only ;// force normative_sys as_HW.D.offset = (current->m[2] [1] . Pc. D.base « 1 ) ;// Cp has no first bit readJSTJJi (as_HW.H) ;// if ( lUses.old ) return (Location+n) ; } */ }// old_under ( between, next->m[0] [0] ) ; //l_th if ( lUses.old ) //ft ->the_lth_fm_s2 [ ] [0] = !ft- >//the_4th_fm_s2 [m] [1]= {ft[0] Λ = true; between = old_under ( next->m[l-ft [0] ] [0] , current->m[2-ft [0] ] [1] ) ; if ( Uses. old ) {if(ft[0]) old_under( between, current->m[2] [1] ) ; // [2*ft] [ ft] else old_under ( between, next->m[0] [0] ) ; // if ( lUses.old ) return (Location+n) ; } } } if( ft[0]) {to_read.m[0] = THE [1] [0] [0] ; to_read.m[l] = P_0->by; collect [0] [col++] = to_read; Switch ( m, &calculate, &sw[m], &f ull [m] , &f t [m] ); ft [m] Λ =true; //the for of the Switch shold start at m=l so here recoracting } if ( lUses.old) return (Location+n) ; else {init[0] = false; if (with_crossing) collect_out (to_read, to, true, show); }}} THE[l] [n] [0] = THE [0] [n] [1] ; // UPUPUPUP } //when = M + 1 to_read = make_first_seq( (seq*) THE [m] , (seq*) THE [m+l] , ft [m] , — n ); if (to_read.msg) {if ( init [ m ] && to_read.msg == 100 ) {to_read.m[0] = THE [m+l] [0] [0] ; // to_read . m [ 0 ] . Pc . F64. base . t_lc=true ; collect [0] [col++] =to_read; if (with_crossing) collect_out (to_read, to, true, show) ;//, false) ; // collect [0] [col++] = collect_f rom(to_read, to, with_crossing, show) ; Switch( m, -.calculate, &sw[m], &full[m], &f t [m] ); } else {collect [1] [ ++max_m ] =to_read; if (with_crossing) collect_out (to_read, to, true, show) ;//, false) ; //collect [1] [ ++max_m ] = collect_from(to_read, to , with_crossing, show) ; ok = false; break; }}//the prove of sequance of making failes collect [ 1 + init_0] [ m ] = to_read; if (with_crossing) collect_out (to_read, to, true, show) ; //collect_from(to_read , to , with_crossing, show) ; m = 1; do {if ( m > 1 && init[ m - 1 ] ) init [ m - 1 ] = false; full [ m ] = true; //first full [m] =false or second full[m]=true bool fU = full[m], sW = sw[m], fT = ft [m] , iN = init [m] ; /* if ( ( iN && !fU ) && ( fT I I ( IfT && !sW ) ) ) to_read = make_seq( (seq*) THE [m] , (seq*) THE [m+l] , t[10-sW- fT] ) ; else to_read = make_seq( (seq*) HE [m] , (seq*) THE [m+l] , t[ (sW«2) + (fT«l)+fϋ] ); */ seq *current=(seq*)THE[m] , *next= (seq*) HE [m+l] ; Pjoy op; if( ( iN && !fϋ ) && ( fT I I ( IfT && IsW ) ) ) op = t[10-sW- fT] ; else op = t[ (sW«2) + (fT«l)+fϋ] ; // P_object to_read; // Pjoy up = Uses . frame [data_NP] ; to_read.msg = 0; if (op.Pc.C'[0]==4) {next->m[op.Ui.C[0]j [0] = current->m[op.Ui . C [4] ] [1] ; // UPUPUPUP to_read.m[0] = next->m[op.Ui . C [0] ] [0] ; // to_read.msg = 1; //bzzzzzzzzzz } else {next->m[op.Ui.C[0] ] [0] = current->m[op.Ui. C [4] ] [1] ; // UPUPUPUP to_read.m[l] = next->m[op.Ui .C [0] ] [0] ; next->m[op.Ui.C[l] ] [0] = current->m[op.Ui. C [5] ] [1] ; // UPUPUPUP to_read.m[0] = next->m[op.Ui .C [1] ] [0] ; next->m[op.Ui.C[l] ] [1] = old_under (next->m[op.Ui .C [2] ] [0] , current- >m[op.Ui.C[6]] [1]) ; if( lUses.old ) to_read.msg = 3; else {to_read.m[0] = next->m[op.Ui.C [1] ] [1] ; // SH_fr_UN_fu UN_fr_SH_fu SH_fr_SH_fu UN_fr_UN_fu // SH_fr_UN_ha UN_fr_SH_ha SH_fr_SH_ha UN fr UN ha (init) //x {3,2,1,2} {0,1,0,3} {3,0,3,2} {2,1,0,1} {2,1,0,1} {0,3,2,3} {3,2,1,2} {0,1,0,3} {0,1,0,4} //y {3,1,1,3} {1,3,3,1} {0,2,2,0} {2,0,0,2} {2,0,0,2} {2,0,0,2} {3,1,1,3} {1,3,3,1} {1,3,3,4} //z {2,1,1,1} {0,3,3,1} {3,2,2,0} {1,0,0,0} {2,1,1,2} {0,3,3,2} {1,0,2,3} {1,0,0,3} {1,0,4,4} Ill/Ill I /ΎO DO for entries 1234 and 235 solving request 234 // by marking the alternative to the corrent SH or UN possibility although having success // by HW of the not requested ////////////// if (op.Ui.C[3]<4) {next->m[op.Ui.C[0] ] [1]= old_under (next->m[op.Ui .C [3] ] [0] , current- >m[op.Ui.C[7]] [1] ) ; if( lUses.old ) //Location+n==byte_size??? m==l//////////bzzzz to_read.msg = 4; ////15; //cheack_seq else to_read.m[l] = next->m[op.Ui .C [0] ] [1] ; } if (op.Pc.C[l] < 4 && !to_read.msg ) {//old_under (next->m[op. Pc.C [0] ] [0] , next->m[op. Pc. C [1] ] [0] ) ;//HW Pjoy HW_parent = Uses . frame [add_before_NP] , HW = old_under ( HW_parent, next->m[op. Pc.C[l] ] [0] ) ; if ( Uses. old ) old_under (next- >m[op.Pc.C[0]] [0] ,HW) ; //HW if ( lUses.old) to_read.msg = 100; else {if (op.Pc.C[2]<4) {//old_under (next->m[op. Pc.C [0] +1] [0] ,next- >m[op.Pc.C[l]+l] [0] ) ;//SW_HW HW = old_under( HW_parent, next->rα[op. Pc.C [1] +1] [0] ) ; old_under(next->m[op.Pc.C[0]+l] [0] ,HW) ; //SW_HW if( Uses. old) {b8 Mi; Mi.H = P_0->to.Oi.H ; //b8 Ev= get_Ev () ; sprintf ( input_buf , "possible shift to forward is noticed but the use for prevention fail cases is not yet implemented\r\nSW_HW : ( %d %d ) Ui=%c Mi=%c Ii=%c" ,op.Pc.C[0]+l ,op.Pc.C[l]+l ,P_O->by.Ui.C[0] , Mi . C [ 0 ] ,P_O->to.Ii.C[0] ) ; P_spread_out ( 103); } old_under (next->m[op. Pc.C [2] ] [1] , current->m[op. Pc.C [3] ] [1] ) ; if ( lUses.old) to_read.msg = 5; //the 4th or ordin s_l }}}}} //} //old_under (Uses .NULLDATA[m] [0] , current->m[y [to_read.by. Pc.D. offset- 1]] [1]); // return (to_read) ; /////////// if ( 1 to_read.msg) { collect [ 1 ] [ m ] =to_read; if (with_crossing) collect_out (to read, to, true, show);// collect_from(to_read , to , ith_crossing, show) ; if ( m > max_m ) { max_m = m; collect [ 2 ] [ m ] = collect [ 1 ] [ m ]; } else {if( init [ m ] ) {init[ ] = false; collect [ 2 ] [ m ] = collect [ 1 ] [ m ] ; }}} else if( init[ m ] && to_read.msg == 100 ) //to_read.m[0] . Pc. D. offset == 100 ) {collect [0] [col++] = to_read; if (with_crossing) collect_out (to_read, to, true, show) ; //collect_from(to_read, to, with_crossing, show) ; Switch ( m, -.calculate, &sw[m], &full[m], &ft [m] ) ; } else {collect [1] [ ++max_m ] = to_read; if (with_crossing) collect_out (to_read, to, true, show); //collect_from(to_read, to , with_crossing, show) ; ok = false;// ok = false; //the prove of sequance of making failes break; }} while ( full [ m++ ] ); //increasing m after checking full [m] } //Location += n ;//if(n) Location += n - 4 ; if ( lok && Location < byte_size ) return ( Location ) ; else { // , str_of collecting crossing if (with_crossing) { comparE ( ( unsigned char *) working_buf->C, working_pointer- (unsigned char *) working_buf->C, figure - byte_size, byte_size, to, "crossing" ) ; sprintf ( inputjouf, "\r\nscond compare \r\n"); P_spread_out ( to) ; } working_pointer = (unsigned char *) working_buf->C; //col—; m = 0; if (col—>0) do{if (collect_out (collect [0] [col] , to, true, show) ) { sprintf ( ' inputjouf, "\r\n\! 1 [switch of col=%d! ! I \r\n", col) ; P_spread_out ( to); }} while ( col—>0) ; do {for (col=l;col<3;col++) if (collect_out (collect [col] [m] , to, true, show) ) { sprintf ( inputjouf, "\r\n\ ! I ! collect %d of m=%d I ! I \r\n", col,m) ; P_spread_out ( to); }} whil ( max_m > m++) ; comparE ( ( unsigned char *) working_buf->C, working_pointer- (unsigned char *) working_buf->C, figure .- byte_size, byte_size, to, "collecting") ; } if (int (-l*calculate)>0) return (-l*calculr //TO DO for entries 1234 and 235 solving request 234 // by marking the alternative to the corrent SH or UN possibility although having success // by HW of the not requested #endif // piledata #ifndef pileout_def #define pileout_def //#include "pileout. h" void first_out ( ) ; ///used by other moudels///////////////////////////////////// // input and output pile globals char *input_buf; // in a size of inputJouf_max bytes b8 *working_buf; // in a size of working_buf_size bytes unsigned char *workihg_pointer; // in a size of input_buf_max bytes // . input and output data pile globals bool Is_txt ; //Input, Output //////////////////////////////////////// void UnLoadPile ( ) { desJPile ( ) ; } bool LoadPileO {if ( 1 Uses .pile_state_is ) {inputjouf = ( char * ) malloc ( input_buf_max ); Uses .pile_state_is = false; if (consruct_io ( ) ) return (true) ; else {install_Pile() ; first_out ( ) ; return (false) ; }}}// return false when installing the pile ////////////////////////////////////////////// Pjoy load_clas''s ( char * buffer, int len , short to) {Pjoy last = write_data ( (unsigned char *) buffer, len) . action_outcome; read_data (last .where, 0, to, false) ; return (last) ; } void load_content_to_class ( Pjoy Class, signed long size, void *from ) {make_content (write_data ( (unsigned char *)from, size) , Class, 7 );} //void load_classified_data( Pjoy Class, void * buffer, int len) //{load_content_to_class ( Class, len ,buffer);} void P_function (int func, P_object *object,int argument=0) {if(func==0) read_data (object->to. Ii.H, 0, 2, false) ; else {if (func==l) {Pjoy Class; Class. where = object->to. Ii.H; read_content ( Class , 2 ) ; } else { if ( func>=200 ) /*{if (st_level( object->by .Ui ) ==of_HW ) // //if (st_level( Ii_of (object->by) )==of_HW ) {read_where( Ii_of (object->by) .H) ; //int size=read_data ( object->by .Ui.H, 0, 201+argument); int size=read_data ( P_0->by.Ui.H, 0, 201+argument); P_spread_out (203) ; // collection_of ( Is_associative_sys, *object, 20, 200+Is_associative_sys) ; } else */ int size=read__data ( object->by .Ui .H, 0, 201+argument, true) ; else { int size=read_data ( object->by.Ui .H, 0, 201+argument, true) ; *Uses . stack_P_0 = *object; Uses . stack_P_0++; } // int Grow_by_Interval ( P_object *interval, int maximim, int function = 2 ) //int max = 0, stck_control=maximim; //Load stuck_object decreses pointer stuck_object // else // get_containing_Interval ( object, 20, 2 ) ; //«growing of data stack overflow }}} Pjoy load_classified_names ( int Delimiter, char *class_name , int name_len ) {char first name [6] ="files" ; Pjoy last = new_under ( Uses . frame [classes_NP ], load_class (first name, 5, 21 ) , of_class -1, //of_class, to_positate, of_class );//of_st char *prv n = class_name; int len = 0; 4 ' for ( ; name_len— ; class_name++, len++) if ( *class_name == Delimiter ) {last = new_under ( last, load_class ( prv__n, len, 21 ) , of_class -1, //of_class, to_positate, of_class );//of_st len = -1; prv_n = class_name +1; } return ( new_under ( last, load_class ( prv_n, len, 21 ) , of_class -1, //of class, to_positate, of_class ));//of st void LoadFile(int Delimiter, char *class_name , int name_len , unsigned int list_index, void * buffer, int len , short to ) {Pjoy Class; load_content_to_class ( Class = load_classified_names ( Delimiter, class__name name en) , len, ( void* ) buffer) ; //read_content ( Class , to ) ; P oy index; index.where = //list_index; //list_index« 1; Ia_of (list_index) ; load_content_to_list (index, Class); // read content ( Class , 1 ) ; read_data_by_list ( index , 1 ) ; / / collection j of ( false , Uses . frame [ contentJSTP] . Pc, 10 , 0 ) ; // collection_of ( false, Uses . frame [ listJSJP ] . Pc , 10 , 1 ) ; mSgList ( ) ; } n/iiii I///II/I/IIIII /* Uses . FoR_h . Ui . H+=2 ; sprintf ( inputjouf ,"for whom number is %-121u {%61u %61u %61u}" , Uses . FoR_h . Ui-. D . offset»l , Uses. total [2] , U'ses. total [0] ,Uses .total [1] ); P_spread_out ( 5 ) ; // P_12_msg ( ) ; sprintf ( inputjouf ,"tolats: S %lu P %lu L %lu at: S %61u id %2d R %61u midle: %lu@%lu" ,Uses.total[2] ,Uses.total[0] ,Uses .total [1] , at_shl ( ) , ( ( C->ram[idP] + C->uses[idP] - 1 )->by.Ui.H > P_0- >by.Ui.H)//Is.id ,P_0-(cch() )->ram[ ( ( C->ram[idP] + C->uses [idP] . - 1 ) >by.Ui.H > P_0->by.ϋi.H) ] ,P_0->by. Ui.D. base , P_0->by . Ui . D . offset ); P_spread_out (6) ; //P_ll_msg ( ) ; */ II/II /III I III/ III long set_to_data (unsigned char * pointer, short size, short to) {//LoadPileO ; long ret; sprintf ( inputjouf ,"%d " , //ret=set_to_data (pointer, size, to)); set_pile_objectS_to (pointer, size, to, true, true) ) ; // set_pile_objectS_to (pointer, size, to, true, false) ); //UPUPUPUP P_spread out( ' 5) ; //12_msg ( ) ; P_spread_out (3) ; // Sg ( ) ; return (ret); //to==2 } long scan_data (void * U , signed long size , bool with_crossing ) {//LoadPileO ; unsigned char *data= (unsigned char *)U; long piece_size, ret, failes=0; signed long from, piece_id; for (piece_id=0, piece_size=size+l;piece_size>l; ) for (data= (unsigned char *) U+size-piece_size+l, from=0,piece_size—; from<size-piece_size+l; piece_id++, data—, from++ ) {//sprintf (inputjouf, "id=%lu :: from = %lu :: size = %lu\r\n",piece_id, from, piece_size) ; P_spread_out (3) ; ret = set_pile_objectS_to ( data, piece_size, 0, with_crossing, false) ; if (ret>0) { sprintf (inputjouf, "\r\n the %dth failing at Loaction = %d ", failes++, ret) ; P_spread_out (2) ; } } sprintf (inputjouf, "scanning %d SUB INTERVALS of %d bytes data was done with %d fails", piece_id , size, failes); P_spread_out (103) ; sprint'f ( input_buf ,"%d ",ret ); P_spread_out ( 5 ) ; //12_msg() ; return (ret) ; } void still_required ( ) { //COMPLETING REQUIRES THE FOLLOWING: // // 0. testing on written data decreased from end and/of from beginning // 1. check_first_m_ft // // 2. applying the remains case which pass through NULLDATA NP // // 3. covering the alternatives by // a. erroring the alternatives like the switching // b. for( short ft=0; ft<32; ft++) if (ok) for // // 4. the growing data which will use // S = 3 and fan_op and gate_density (pilecon. h) //LoadPile() ; sprintf ( input_buf ,"1. applying the remains case which pass through NULLDATA NP\r\n2. covering the alternatives by erroring the alternatives like the switching\r\n3. growing data " ) ; P_spread_out ( 3 ) ; //mSg ( ) ; } // E R R O R void P_err (short num) { // "ERROR\r\nERROR"z.OWW() ; //debagO ; Ob_pile_access x; b8 Mi; switch (abs (num) ) { // case 18:sprintf( inputjouf, "Amount .L=%lu" , Amount .L) ; break; case 103:sprintf( input_buf, "ERR 103") ; break; case 27: sprintf ( inputjouf, "form the counter NP child to the data") ; break; case 26: sprintf ( inputjouf, "no object to NP"); break; case 25: sprintf ( inputjouf, "LOST IN READING") ; break; case 24: sprintf ( inputjouf, "Cannot get directory .") ;break; case 23: sprintf { inputjouf , "need correcrint 11!" ) ; break; case 22: Mi .H=P_0->to.Oi.H; sprintf ( inputjouf , "st_Laccording=%lu\r\n st_Lwhat=%lu st_Lwhere=%lu" , st_level (Mi) //, false ) , st_level(P_0->to.Ii) //, false ) ,st level (P 0->by.Ui) //, true ) ) ; break; case 21 //break; case 20 Mi.H = P_0->to.Oi.H; sprintf ( inputjouf , " err 20 :S at %lu Is. id = %d at %lu\r\nram( %d , %d ) uses=( %d , %d < %d = max )\r\n%lu@%lu > %lu@%lu > %lu@%lu \r\n old= %d bleft=%d bright=%d \r\n(shl() )->edge %lX\r\n C 0) %lu@%lu 1) %lu@%lu\r\n S at %lu == %lu C at %lu appear=%lu\r\n tot %lu %lu\r\n st Lwhere=%lu st_Laccording=%lu" ,at_shl() ,x. id ,at_P_obj () , (cch() ) ->ram[idP] , (cch ( ) ) ->ram[idL] , (shl() )->uses[idP] , (shl ( ) ) ->uses [idL] , max_P_obj ect_memb , x. left. D.base ,x. left .D.offset , x.midle . D.base ,x.midle. D. offset , x. right . D.base , x . right . D . offset ,Uses .old , x.bleft , x. bright , (shl() )->edge.H , (cc ( ) ) ->edge . D . base , (cch( ) ) ->edge.D. offset , (cch() )->uses[0] , (cch() )->uses [1] ,at_shl() , (cch() )->to_S ,at_cch() //C-UC , (shl ( ) ) ->appear , Uses. total [2] , Uses . total [3] , st_level (P_0->by.Ui) //, true ) , st_level (Mi) //, false ) ) ;break; case 19: sprintf ( inputjouf, "old not app ");break; case 18: sprintf ( inputjouf, "not old" ) ;break; case 17 : sprintf ( inputjouf, "no list" ) ;break; case 16: sprintf ( inputjouf, "no action_outcome") ; break; case 15 : sprintf ( inputjouf, "no for_whom") ; break; case 14: sprintf ( inputjouf, "no operator" ) ; break; case 13 : sprintf ( inputjouf, "now it is RAm and hasddisk to be involve") ; break;r case 12: sprintf ( inputjouf, "max_shell_memb overflow 1 ! 1 ! ! ! 1.") ; break; case 11: sprintf ( inputjouf , "outchecKl (S at %lu ) edges are %1X" , at_shl ( ) , (shl() )->edge.H ) ; break; case 10: sprintf ( inputjouf , "nochecK_ down: P%31u R_(shl () ) ->ram[idL] - U_P_0 S"//%21u" , at_P_obj () //C->ram[idL]-U_P_0//R[R__(shl() )- >ram[idL]] - UR[R_(shl ( ) ) ->ram[idL] ] 1/ , CApp - UCApp ) ;break; case 9: sprintf ( inputjouf , "nochecK__ up :P%31u R_(shl ( ) ) ->ram[idP] -U_P_0 S"//%21u" •■ ,at_P_obj ()// C->ram[idP]-U_P_0//R[R_(shl() )- >ram[idP]] - UR[R_(shl ( ) ) ->ram[idP] ] // , CApp-UCApp ) ;break; case 8 : sprintf ( inputjouf ,"lastcheck: outchecK_(S at %lu ) edges are %1X > privfirst\r\n%lu" , at_shl ( ) , (shl() )->edge.H //, Is . S_edge_privfirst. D.base //, Is . S_edge_privfirst. D.offset , (shl() )->uses[idL] ) ; break; case 7: sprintf ( inputjouf ,"lastcheck: Uses .total [idS] 1=0 (S at %lu ) edges are %1X" , t_shl ( ) , (shl() )->edge.H ) ; break; case 6: sprintf ( inputjouf , "midoutchecK_: (S at %lu ) edges are %1X \r\n%uses [isL] =lu" , at_shl ( ) , (shl() )->edge.H //, Is . S_edge_privfirst .D.base //, Is . S_edge_privfirst. D.offset , (shl() )->uses [idL] ) ; break;: case 5: sprintf ( input_buf , "midoutchecKl: (S at %lu ) edges are %1X (OF C at %lu ARE , at_shl ( ) , (shl() )->edge.H ,at_cch()//C - UC , (cch() )->edge.H , (cch() )->uses[0] , (cch( ) ) ->uses [1] ) ; break; case 4 : sprintf ( inputjouf , "ObJ ErroR not Ok total[3]=%lu total [l]=%lu total [0]=%lu S at %lu Is. id = %d at %lu\r\nram( %d , %d ) uses=( %d , %d < %d = max ) \r\n %1X @ %1X > %1X @ %1X > %1X @ %1X \r\n old= %d bleft=%d bright=%d \r\n(shl() )->edge %1X \r\n C 0) %1X @ %1X ) %1X @ %lX\r\n %1X %1X" ,Uses.total[3] ,Uses . total [1] ,Uses.total[0] , at_shl ( ) ,x. id ,at_P_obj ()//P_0 - U_P_0 , (cch() ) ->ram[idP] , (cch( ) ) ->ram[idL] , (shl() )->uses[idP] , (shl() )->uses[idL] ,max_P_object_memb , x. left .D.base , x.left . D. offset , . midle . D . base , . midie. D. offset , x. right. D.base , x . right . D . offset , Uses. old , x.bleft ,x. bright , (shl () )->edge.H , (cch() )->uses[0] , (cch() ) ->uses [1] , (cch() )->to_S ,at_cch()//C-UC ) ; break; case 3: sprintf ( inputjouf, "max_shell_memb overflow !!!!!!! .\n\r") ; break; case 2: sprintf ( inputjouf, "Not enough memory to allocate buffer."); break; case 1: sprintf ( inputjouf, "Cannot open ile. \n\r") ; break; } P_spread_out (-num) ; } void note_frame ( Pjoy frame, short last_frame) { sprintf ( inputjouf, "%2d 1 %81X%81X ==%81X%81X {at %lu, %lu where %lu}", last_frame , frame .Ui .D.base, frame .Ui .D. offset, frame . Pc. D.base, frame . Pc . D . offset, at_shl ( ) , at_P_obj ( ) , 0 P_0->by. here ); P_spread_out ( 4 ) ; } void first_out() 5 { sprintf { inputjouf, "%lu bytes", Uses .RAMcounterEND * P_object_buf_size) ; P_spread_out ( 4 ) ; sprintf ( input_buf, "installed! piles NP\r\n -1 1 00000000 == 00000100") ; 0 P_spread_out ( 4 ) ; sprintf ( inputjouf, "_l_what_|_ = -0x301 pile NP\r\n %d 1 %1X%1X == %1X%1X", pile_NP, Uses . frame [ pile_NP ] .Ui . D.base, Uses . frame [ pile_NP ] .Ui.D.offset, 5 Uses. frame [ pile_NP ]. Pc. D.base, Uses . frame [ pile_NP ] . Pc. D. offset) ; P_spread_out ( ) ; sprintf ( input_buf, "_|_p_|_= 0 figure stream action characteristics NP\r\n %d ! %1X%1X == %1X%1X", content_NP, Uses . frame [ content_NP ] .Ui .D.base, Uses . frame [ content_NP 0 ] .Ui.D.offset, c. D.base, Uses.frame[ content_NP 1 figure stream beginnig NP\r\n %d ! crudeJSJP ,Uses.frame[ crude_NP ] .Ui. D.base, Uses . frame [ crude_NP ] .Ui.D. offset, Uses, f rame [ crudeJSJP ]. Pc. D.base, Uses . frame [ crudeJSTP ]. Pc.D. offset) ; P_spread_out ( 4 ) ; 0 } #endif

Claims: CLAIMS 1. A system of referring objects in T number of trees, where all the following conditions are maintained: any of said objects and any of said trees are valid in all said system, where any parent or child in said trees is one of said objects; said T is bigger than one; any of said objects is a child of T parents, each defined in different tree; any of said objects is defined by different unique identifier of said object, where said identifier is defined only by all the parents of said object together; any of said objects is optionally a parent in all said trees. any of said trees is defined by a different ordinal number; T numbers of qualifiers together, all defined by the order set by said ordinal number of said trees, define said unique identifier defining one of said objects, where said unique identifier is defined as an unsigned integer with T digits or as a point in T dimensions, where said qualifier is one of said digits in the numerical calculation of said integer and is also one ofthe dimensional identifiers in one of said dimensions of said point, where changing said order of said qualifiers changes the priority of collecting layers of objects in different trees by their unique identifiers; where said parent refers to one of said qualifiers of all children of said parent, and where said parent optionally shares its referring to its children with other parents in the same tree. 2. The system of claim 1 , wherein said qualifier is either a link held by said parent referring to one or more of said objects, or an argument of said system referring to one or more said objects, and where said qualifier optionally contains an additional signing bit of said referring. 3. The system of claim 1 , wherein any of said links is defined in a range of one of standards, where all said ranges together are in the range of said qualifier, and whenever one of said objects becomes a parent, then said link held by said object is set by an historical identifier defined by one of said standards, said historical identifier afterwards being increased or decreased by one, depending on said standard, so that said object holding said link refers said object to all of its children in all said trees. 4. The system of claim 1, wherein said argument of said system is one of said qualifiers defining said object, only where at least one of other said qualifiers is said link held by one ofthe parents of said object and where said argument is in the range of said qualifier and where the ordinal number ofthe tree of said argument is identical to that ofthe tree which the argument replaces. 5. The system of claim 1, wherein a matching identifier defined by said ordinal number of one of said trees and being held by one of said children is a signed integer, of which the absolute value equals the unsigned integer of the unique identifier of the parent of said child in said tree, so that said matching identifier refers to said parent. 6. The system of claim 1 , wherein any of said objects holds its unique identifier. 7. The system of claim 1, wherein, any of said objects holds one or more matching identifiers identifying one or more of its parents. 8. The system of claim 1, wherein any of said objects holds the option of being a parent. 9. The system of claim 1, wherein any of said objects optionally holds an exclusive value. 10. The system of claim 1, wherein only defined objects take capacity. 11. Subsystems ofthe system of claim 1, wherein objects and trees are defined as in the system of claim 1 with the following exceptions: said objects hold all or part of what the objects ofthe system of claim 1 hold, and are defined where all the orders of said trees which differ from the order set by said ordinal numbers of said trees are rotating orders defining rotation of said ordinal numbers and where the resulted unique identifiers of said object is equal to said unique identifiers with the exceptions of one of said rotating ordinal number replacing said ordinal number, and of said unsigned integer added to the result ofthe ordinal number ofthe rotation multiplied by the result of one plus the last of all said unique identifiers, where the number ofthe rotations, their ordinal number and the last of all said unique identifiers are defined. 12. A method of constructing a structure of objects related by several generic attributes, when a first attribute is an object address in said structure; a second attribute relates objects to a 'folder object' having first attribute equivalent; a third attribute is an address of an object related by said second attribute; and when the connection from said 'folder object' to said third attribute is equivalent to a path of several pointers each being a fourth attribute, so that any next said pointer step is equivalent to a digit location in a number equivalent to said third attribute, and so that the pointing is to the equivalent number of said first attribute less said digit, thus the size ofthe range of addressed objects pointed by said fourth attribute is equivalent to a defined numerical base. 13. The method of claim 12, wherein the addresses of said third attribute and said first attribute are in separate scales of which the ratio of said third to said first equals one or bigger. 14. The method of claim 13, wherein said ratio is equivalent to the ratio ofthe number of equivalents of said third attributes being equivalent to the single equivalent of said first attribute, when the complex number one to the power ofthe inverse of said ratio equals the set of complex numbers of which the number of elements is equivalent to an 'insertion level number' and each element being equivalent to an 'insertion mark' marked by the ordmal number 'insertion ordinal number'. 15. The method of claim 12 in condition of claim 13 and 14, wherein the object address of said third attribute is equivalent to the number equal to ( ( 'insertion ordinal number' minus one ) multiplied by ( he equivalent number of the size ofthe scale including said first attribute ) ) plus ( the absolute value ofthe equivalent number of said object address of said third attribute), when said third attribute equivalent number is equivalent to the complex number equal to said 'insertion mark' multiplied by said absolute value. - I l l - 16. The method of claim 12 in condition of claim 14, wherein the second attribute relating objects to a 'folder object' constitutes an hierarchical layer ofthe objects having identical said second attribute and identical said 'insertion ordinal number'. 17. A method of constructing a structure of objects in hierarchical form using the method of claim 12 in the conditions of claim 16 and of said objects having said fourth attribute. 18. A method of insertion into the structure constructed by the method of claim 17, using the method of claim 12, in the condition of claim 16, with different 'insertion ordinal number', by the order of said 'insertion ordinal number' as an ordinal number corresponding to precedence of objects located in the object address conditioned by claim 15. 19. A method of constructing a structure of obj ects in different hierarchical form than, yet coexisting with, the hierarchical form constructed by the methods of claim 17 and 18, so that an 'alternative folder object' has said first attribute equivalent number equal to the absolute value ofthe number equivalent to said third attribute of objects being a layer of said different hierarchical form of said objects next to said 'alternative folder object'. 20. A method to mark the number equivalent to said first attribute, indicating whether or not said attribute is of the object included in the hierarchical form constructed by the method of claim 19. 21. A method to construct a structure of obj ects constructed by the method of claim 19, distinguished by claim 20 from, and coexisting with, objects which are in a state of being input to, or being output of, or being not connected with, said structure. 22. A method using precedence over said 'folder object' of said hierarchical form constructed by the methods of claim 17 or 18, of objects marked by the method of claim 20, indicating to be in the hierarchical form constructed by the method of claim 19, of which said 'insertion ordinal number' is bigger than one and of which said second attribute is equivalent, to said first attribute of said 'folder object'. 23. A method to evaluate objects constructed by the methods of claims 19 and 17 or 18, using the precedence defined by the conditions of claim 22 . 24. A method to connect objects constructed by the method of claim 12 to said objects having an identical said second attribute, when different connected said objects having said fourth attribute identical to said fourth attribute of said 'folder object'. 25. Methods using the method of claim 12 in the condition of claim 13, using additional generic attribute/s alternatively or together with one or more ofthe four generic said attributes, to insert other than, or additional to, the connections corresponding to the use ofthe four generic said attributes. 26. A method to construct a type of next orders of activities, when an object constructed by the method of claim 12 is an object of connection/s of said objects, when said connection/s are of at least one ofthe claims 25, 24, 23, 19, 17 and 12, and when said object, its said attributes and said connection/s are ofthe type ofthe next orders of activities, when insertion of said next order is an insertion into interrupted continuous activity being the previous order, when the first order is a continuous activity of an order empty of activities, when every insertion interrupting continuous activity creates the next, new higher order, when any order is a connection which enables unique identification of all of its objects, when any continuous activity is a method of accessing said object/s of said order, and when interrupting said continuous activity is a method/s of accessing other than said object s. 27. A method of a system of constructing or connecting objects having the same lifetime in different scopes of order of claim 26. 28. A method allowing to specify regions of forms of constructing one or more structures of invention objects having all or part invention attributes being identical, with each region being out of all the other said regions. 29. A method allowing to exchange arguments of attributes of regions of forms specified in claim 28, with said arguments functioning also in different said lifetime.

Inventors: ELUL EREZ, ELUL, EREZ
Applicants: ELUL EREZ, GLADITZ WILHELM, ELUL, EREZ, GLADITZ, WILHELM
Application year: 2001
Main classification: G06F17
IPC codes: G06F9