Search Results for "case"

Agglo is a CASE (Computer Aided Software Engineering) or AGL (Atelier Génie Logiciel), whose aim is to facilitate installation ans use of various tools (either existing opensource tools, or agglo tools), in several facets of project development: - requirements management - unit tests - automated integration tests - toolkit for various languages (cpp, c, python, shell, xsl) other facets are to come ultimately: - coverage tests - planification - integration with hudson - code quality analysis - indicator production

this is a compiler wrapper made to wrap - borland c++ 5.5.1 (no longer available, *bc*) - DJGPP (gp.cmd,older gp.bat,*gp*) - mingw and mingw-w64 compilers (install-compilers.cmd, zap*, *gw2*) - mingw-w64 vityan compiler batch files for ubuntu natty and freebsd (*gwix*) are packaged with set just above. currently, you still have to specify exe or dll even there is no extension of linux binaries. it is not setup yet for .so files. I will need to do something for those. These are...

This program aims to check and gain a inner point from multiple set of linear constraints. This software works better in the case that range of variables are known and parameters are configured so. C++ and Eigen library needed, and to calculate more accurate, we may need mpfr++ library or, QD library. Freezed.

...“This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in

...“This algorithm uses the first, last, mid1 and mid2 index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/4) and in worst case, time complexity is O(n – (m/4) ). In all the cases best, average and worst its space complexity is O(1). For more information please visit the following link :- http://learandexperiment.blogspot.in

Test Case Web (TCW) is an online test case management (TCM) and test-tracking system built with PHP and a SQL backend.

Coral is a tool and a development platform to create and transform models and modeling languages. It can be used to edit UML models, to develop editors for other modeling languages and to implement MDA and QVT-like model transformations.