CushionTheBlow (구 BluemoonSoft)

cscope is a console mode or text-based graphical interface that allows software engineers or developers to search source code. It is often used on very large projects to find source code, functions, declarations, definitions and regular expressions given a text string.

The history of the tool goes back to the days of the PDP-11, but it is still used by developers who are accustomed to using the vi or vim editor or even developers who prefer using text-based, instead of gui-based, editors. Most of the functionality within cscope is available in modern graphical editors.

cscope is used in two phases. First a developer builds the cscope database. The developer can often use find or other unix tools to get the list of filenames that they need to index into a file called cscope.files. The developer then builds a database using the command cscope -b -q -k. Second, the developer can now search those files using the command cscope -d. Often an index needs to be re-built whenever changes are made to files.

In software development it is often very useful to be able to find the callers of a function because this is the way to understand how code works and what other parts of the program expect from a function. cscope can find the callers and callees of functions, but it is not a compiler and it does that by searching the text for keywords. This has the disadvantages that macros and duplicate symbol names can generate an unclear graph. There are other programs that can extract this information by parsing the source code or looking at the generated object files.

cscope is often used to search content within C or C++ files, but it can be used to search for content in other languages such as Java, Python, PHP and Perl.

cscope is free and available under a BSD License.

The original developer of cscope is Joe Steffen.

Reference:
http://en.wikipedia.org/wiki/Cscope

In abstract algebra, a magma (or groupoid) is a basic kind of algebraic structure. Specifically, a magma consists of a set M equipped with a single binary operation M × M → M. A binary operation is closed by definition, but no other axioms are imposed on the operation.

The term magma for this kind of structure was introduced by Bourbaki. The term groupoid is an older, but still commonly used alternative which was introduced by Øystein Ore. However, groupoid also refers to an entirely different algebraic structure described at groupoid.

Reference:
http://en.wikipedia.org/wiki/Magma_%28algebra%29

In mathematics, a semigroup is an algebraic structure consisting of a set S closed under an associative binary operation. In other words, a semigroup is an associative magma. The terminology is derived from the anterior notion of a group.

The operation of a semigroup is most often denoted multiplicatively, that is, x·y or simply xy denotes the result of applying the semigroup operation to the ordered pair (x, y).

The formal study of semigroups began in the early 20th century. Since the 1950s, the theory of finite semigroups has been of particular importance in theoretical computer science because of the natural link between finite semigroups and finite automata

Reference:
http://en.wikipedia.org/wiki/Semigroups

 group is one of the fundamental objects of study in the field of mathematics known as abstract algebra. The branch of algebra that studies groups is called group theory. Group theory has extensive applications in mathematics, science, and engineering. Many algebraic structures such as fields and vector spaces may be defined concisely in terms of groups, and group theory provides an important tool for studying symmetry, since the symmetries of any object form a group. Groups are thus essential abstractions in branches of physics involving symmetry principles, such as relativity, quantum mechanics, and particle physics. Furthermore, their ability to represent geometric transformations finds applications in chemistry, computer graphics, and other fields.

Many structures investigated in mathematics turn out to be groups. These include familiar number systems, such as the integers, the rational numbers, the real numbers, and the complex numbers under addition, as well as the non-zero rationals, reals, and complex numbers under multiplication. Other important examples are the group of non-singular matrices under multiplication, and the group of invertible functions under composition. Group theory allows for the properties of such structures to be investigated in a general setting.

This article covers only the basic notions related to groups. More advanced facets, applications and history of group theory are covered in group theory.

Reference:
http://en.wikipedia.org/wiki/Group_%28mathematics%29

In the mathematical field of group theory, the Monster group M or F_1 (also known as the Fischer-Griess Monster, or the Friendly Giant) is a group of finite order

2^46 · 3^20 · 5^9 · 7^6 · 11^2 · 13^3 · 17 · 19 · 23 · 29 · 31 · 41 · 47 · 59 · 71
= 808017424794512875886459904961710757005754368000000000
≈ 8 · 10^53.

It is a simple group, meaning it does not have any normal subgroups except for the subgroup consisting only of the identity element, and M itself.

The finite simple groups have been completely classified (the classification of finite simple groups). The list of finite simple groups consists of 18 countably infinite families, plus 26 sporadic groups that do not follow such a systematic pattern. The Monster group is the largest of these sporadic groups and contains all but six of the other sporadic groups as subquotients. These six exceptions are known as pariahs, and the others as the happy family.

Reference:
http://en.wikipedia.org/wiki/Monster_group

Abstract algebra is the subject area of mathematics that studies algebraic structures, such as groups, rings, fields, modules, vector spaces, and algebras. Most authors nowadays simply write algebra instead of abstract algebra.

The term abstract algebra now refers to the study of all algebraic structures, as distinct from the elementary algebra ordinarily taught to children, which teaches the correct rules for manipulating formulas and algebraic expressions involving real and complex numbers, and unknowns. Elementary algebra can be taken as an informal introduction to the structures known as the real field and commutative algebra.

Contemporary mathematics and mathematical physics make intensive use of abstract algebra; for example, theoretical physics draws on Lie algebras. Subject areas such as algebraic number theory, algebraic topology, and algebraic geometry apply algebraic methods to other areas of mathematics. Representation theory, roughly speaking, takes the 'abstract' out of 'abstract algebra', studying the concrete side of a given structure; see model theory.

Two mathematical subject areas that study the properties of algebraic structures viewed as a whole are universal algebra and category theory. Algebraic structures, together with the associated homomorphisms, form categories. Category theory is a powerful formalism for studying and comparing different algebraic structures.

Reference:
http://en.wikipedia.org/wiki/Abstract_algebra

In the mathematical field of graph theory, a Hamiltonian path is a path in an undirected graph which visits each vertex exactly once. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle in an undirected graph which visits each vertex exactly once and also returns to the starting vertex. Determining whether such paths and cycles exist in graphs is the Hamiltonian path problem which is NP-complete.

Hamiltonian paths and cycles are named after William Rowan Hamilton who invented the Icosian Game, now also known as Hamilton's puzzle, which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the Icosian Calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hamilton). Unfortunately, this solution does not generalize to arbitrary graphs.

Reference:
http://en.wikipedia.org/wiki/Hamiltonian_path