C--C-- (pronounced C minus minus) is a C-like programming language. Its creators, functional programming researchers Simon Peyton Jones and Norman Ramsey, designed it to be generated mainly by compilers for very high-level languages rather than written by human programmers. Unlike many other intermediate languages, its representation is plain ASCII text, not bytecode or another binary format. There are two main branches: C--, the original branch, with the final version 2.
Planar graphIn graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points.
Shear wallIn structural engineering, a shear wall is a two-dimensional vertical element of a system that is designed to resist in-plane lateral forces, typically wind and seismic loads. A shear wall resists loads parallel to the plane of the wall. Collectors, also known as drag members, transfer the diaphragm shear to shear walls and other vertical elements of the seismic force resisting system. Shear walls are typically light-framed or braced wooden walls with thin shear-resisting panels on the framing surface, or are reinforced concrete walls, reinforced masonry walls, or steel plates.
Planar separator theoremIn graph theory, the planar separator theorem is a form of isoperimetric inequality for planar graphs, that states that any planar graph can be split into smaller pieces by removing a small number of vertices. Specifically, the removal of O(\sqrt{n}) vertices from an n-vertex graph (where the O invokes big O notation) can partition the graph into disjoint subgraphs each of which has at most 2n/3 vertices.
Planarity testingIn graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be drawn in the plane without edge intersections). This is a well-studied problem in computer science for which many practical algorithms have emerged, many taking advantage of novel data structures. Most of these methods operate in O(n) time (linear time), where n is the number of edges (or vertices) in the graph, which is asymptotically optimal.
Probability distributionIn probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of different possible outcomes for an experiment. It is a mathematical description of a random phenomenon in terms of its sample space and the probabilities of events (subsets of the sample space). For instance, if X is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution of X would take the value 0.5 (1 in 2 or 1/2) for X = heads, and 0.
ForceIn physics, a force is an influence that can cause an object to change its velocity, i.e., to accelerate, unless counterbalanced by other forces. The concept of force makes the everyday notion of pushing or pulling mathematically precise. Because the magnitude and direction of a force are both important, force is a vector quantity. It is measured in the SI unit of newton (N) and often represented by the symbol F.
Power factorIn electrical engineering, the power factor of an AC power system is defined as the ratio of the real power absorbed by the load to the apparent power flowing in the circuit. Real power is the average of the instantaneous product of voltage and current and represents the capacity of the electricity for performing work. Apparent power is the product of RMS current and voltage.
Constant of integrationIn calculus, the constant of integration, often denoted by (or ), is a constant term added to an antiderivative of a function to indicate that the indefinite integral of (i.e., the set of all antiderivatives of ), on a connected domain, is only defined up to an additive constant. This constant expresses an ambiguity inherent in the construction of antiderivatives. More specifically, if a function is defined on an interval, and is an antiderivative of then the set of all antiderivatives of is given by the functions where is an arbitrary constant (meaning that any value of would make a valid antiderivative).
Divergent boundaryIn plate tectonics, a divergent boundary or divergent plate boundary (also known as a constructive boundary or an extensional boundary) is a linear feature that exists between two tectonic plates that are moving away from each other. Divergent boundaries within continents initially produce rifts, which eventually become rift valleys. Most active divergent plate boundaries occur between oceanic plates and exist as mid-oceanic ridges.
Gamma distributionIn probability theory and statistics, the gamma distribution is a two-parameter family of continuous probability distributions. The exponential distribution, Erlang distribution, and chi-squared distribution are special cases of the gamma distribution. There are two equivalent parameterizations in common use: With a shape parameter and a scale parameter . With a shape parameter and an inverse scale parameter , called a rate parameter. In each of these forms, both parameters are positive real numbers.
Convergent boundaryA convergent boundary (also known as a destructive boundary) is an area on Earth where two or more lithospheric plates collide. One plate eventually slides beneath the other, a process known as subduction. The subduction zone can be defined by a plane where many earthquakes occur, called the Wadati–Benioff zone. These collisions happen on scales of millions to tens of millions of years and can lead to volcanism, earthquakes, orogenesis, destruction of lithosphere, and deformation.
