Search Results for "custom-eclipse"

...Instead of relying on a fixed set of heuristics, it explores formatting decisions and chooses the lowest-cost result, aiming to produce code a human would write when following a style guide. You can run it as a command-line tool or call it as a library via FormatCode / FormatFile, making it easy to embed in editors, CI, and custom tooling. Styles are highly configurable: start from presets like pep8, google, yapf, or facebook, then override dozens of options in .style.yapf, setup.cfg, or pyproject.toml. It supports recursive directory formatting, line-range formatting, and diff-only output so you can check or fix just the lines you touched.

The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on...

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

Cachelet is a java framework for general purpose caching very simple and easy to use. And it has everything you need for caching without complications.

**NOTE**: The WALA project is now hosted at https://github.com/wala/WALA; the latest source code and updates are available there. The code here on Sourceforge is highly out of date and unsupported. The T. J. Watson Libraries for Analysis (WALA) provide program analysis capabilities for Java bytecode and related languages. The WALA libraries constitute an open-source release of parts of IBM Research's DOMO analysis infrastructure.

This repository implements Steven Fortune’s algorithm (sweep-line method) for generating Voronoi diagrams in JavaScript, providing a performant browser-side solution for computational geometry of planar point sets. With this library you can feed a set of sites (points) and compute their Voronoi cells – the partition of the plane into regions closest to each site – in O(n log n) time. It’s especially useful in web UIs, visualizations, interactive maps, and generative-art contexts where you...

Evokit is an integrated environment for developing evolutionary computation algorithms. It is built around Java and the Eclipse platform, and will support several different libraries including ECJ.

JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation

...In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. ...

HL7 to XML Transformation toolkit. Using HL7 v2 XML

Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation.

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments...

An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.

A collaboration platform that enables non-locking, synchronous, real-time collaborative (NOT text only) editing with editor independence. It also provides edit by edit session playback. To collaborate just enter a name, group and password.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.

Secure P2P Instant Messenger running on .NET Framework 2.0. Uses server to store user information (user name, password, email address, friends list, log in state, IP address) in encrypted form. Uses custom designed symmetric encryption algorithm.

This Project implements the mergesort algorithm in a MPICH2 (parallel programming -) environment.

Sounder is a spell checker that allows user to enter a word as they think it should sound not as they think it is spelled. A list of similar sounding words is returned to the user with the correct spelling.

The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.

SenseRank Sys: - builds the dictionaries (multidim matrices) of words’ values; - for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. NO tool is providing a global framework to develop algorithms. Silicis is a new formal framework for designing [verification] algorithms.

This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.

Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/