Search Results for "string class"

CB2XML (CopyBook to XML) is a COBOL CopyBook to XML converter written in Java and based on the SableCC parser generator. This project includes utilities to convert an XML instance file into its COBOL copybook equivalent string buffer and vice versa. Source is now available in GitHub: https://github.com/bmTas/cb2xml

This project is dedicated to open source data quality and data preparation solutions. Data Quality includes profiling, filtering, governance, similarity check, data enrichment alteration, real time alerting, basket analysis, bubble chart Warehouse validation, single customer view etc. defined by Strategy. This tool is developing high performance integrated data management platform which will seamlessly do Data Integration, Data Profiling, Data Quality, Data Preparation, Dummy Data...

Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a...

Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. ...

MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information.

The Safe C Library provides bound checking memory and string functions per ISO/IEC TR24731. These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.

wordseg project is a word segment module implemented by C#. It is used to segment text into tokens and to label token's attribute according its context and semantic by front-maximum matching and CRF algorithms. The following are some sentences need to be segmented: 张晓晨和付仲恺一起坐在家（西坝河东里社区）里的沙发上看非诚勿扰。 百度公司的名字源于“众里寻他千百度”这诗句。 After above sentences be segmented by wordseg, the result as follows for each sentence: 张晓晨[PER] 和 付仲恺[PER] 一起 坐 在 家 （ 西坝河东里社区[LOC] ） 里 的 沙发[PDT] 上 看 非 诚 勿扰 。...

Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren

A Java package that provides several computations related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed.

A cross-platform, text-interpreting calculator written in the Java programming language. Runs on any computer with Java 6 or higher installed. Functions much like a Ti-84, but without the graphing utility.

ngram is a module to compute the similarity between two strings. It is different to python's "difflib.SequenceMatcher" in that it cares more about the size of both strings. ngram is an port and extension of the perl module called "String::Trigram

Convert a "line string" from a .kml file to a "route" in another .kml file. I started this project to use google maps for routing at home and a very simple GPS-device for following the route while on the road.

The gsuffix library implements serveral algorithms used for enumerative string searches. It incorporates the suffix tree and suffix array data structures as well as some other methods.

Datamixer generates mock data values for various datatypes, including integer, floating precision, datetime, and string. It can generate complex sequences, based on functions and permutations of the basic data series.

The project Formula can be used for the computation of numeric expressions that is written as string. Main features of the project are high computation speed and simplicity of use. Formula can be used for writing of calculators, plotters and etc.

Expression4J (Math Expression Parser) is a java framework used to manage mathematic expression stored in String object like "f(x,b)=2*x-cos(b)" or "g(x,y)=f(y,x)*-2". Expression gramar can be define by user (add new operator or type ...)

Library for performing derivative on an input string. Given an expression in a string, you can mathematically derive it.

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

The goal of this project is to design a library to interpret a string, and manipulate it algebraicly.

NAC is a collection of tools for cryptography. The goal is to provide simple-to-use crypto tools (like an OTP, String and number generator, public key algorithm...) you can use under Linux, Windows...

Parser for mathematical expressions written in Java. Expressions may contain variables, functions and constants. The parser turns a string argument into an expression tree, which then can be evaluated.

General-purpose machine-independent Perl functions and a sample MS-DOS/Windows batch file to efficiently sort arrays of strings by the numerical value of all embedded dotted-quad IPv4 addresses in each string

Decodify is a simple program that parses a numerical string and extracts different parts of it as per user query. The main application of 'decodify' is to extract parts of a control bus in logic simulation, but many other uses are possible.

Given a String , returns the next logically sequential string defined by a rule. The basic rule is, given a sequence of alphabets, it checks the string and returns a new string with one or more alteration. javadocs and source codes available inside.