{"id":16567848,"url":"https://github.com/sylvainhalle/qict","last_synced_at":"2026-06-04T12:31:14.834Z","repository":{"id":25955021,"uuid":"29396725","full_name":"sylvainhalle/QICT","owner":"sylvainhalle","description":"A pairwise test case generator","archived":false,"fork":false,"pushed_at":"2018-12-06T16:54:26.000Z","size":20,"stargazers_count":2,"open_issues_count":0,"forks_count":2,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-05T10:44:46.782Z","etag":null,"topics":["c-sharp","combinatorial-testing","qict","testing-tools"],"latest_commit_sha":null,"homepage":null,"language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"unlicense","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sylvainhalle.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-01-17T16:17:59.000Z","updated_at":"2022-04-02T02:06:20.000Z","dependencies_parsed_at":"2022-08-06T07:16:15.434Z","dependency_job_id":null,"html_url":"https://github.com/sylvainhalle/QICT","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sylvainhalle/QICT","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sylvainhalle%2FQICT","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sylvainhalle%2FQICT/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sylvainhalle%2FQICT/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sylvainhalle%2FQICT/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sylvainhalle","download_url":"https://codeload.github.com/sylvainhalle/QICT/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sylvainhalle%2FQICT/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":33905358,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-04T02:00:06.755Z","response_time":64,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["c-sharp","combinatorial-testing","qict","testing-tools"],"created_at":"2024-10-11T21:07:38.686Z","updated_at":"2026-06-04T12:31:14.813Z","avatar_url":"https://github.com/sylvainhalle.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# QICT: A Pairwise Test Case Generator\n\nThis program originally appeared in the [MSDN Magazine, December\n2009](http://msdn.microsoft.com/en-us/magazine/ee819137.aspx).\n\nI took the code there (assumed to be public domain) and polished it a bit\nto add command-line parameters and a few options. The bulk of the algorithm\nremains unchanged.\n\n## How to compile\n\nFirst, clone the repository.\n\n### Under Windows\nTo run this QICT code, launch a new instance of Visual Studio 2005 or 2008.\nCreate a new Console Application C# project.\nReplace the VS-generated template code in file Program.cs with the Qict.cs\ncode in this download.\nCopy all .txt into the root folder of your project.\nBuild and run by hitting the F5 key.\n\n### Under Linux\n```\nmcs Qict.cs -out:qict\n```\n(or use `make build`)\n\nNB: mcs is the Mono C# compiler\n\n##Usage:\n```\nqict [-c] [-h] \u003cfilename\u003e  [-i] \u003cinvalidCombinaisonsFilename\u003e\n```\nwhere filename is a text file containing the text data (see the article\nor the sample file testData.txt included for more info) and invalidCombinaisonsFilename\nis the file containning invalids combinaisons to exclude during the test\n\nthe output will display something like this: (in the case below we didn't use forbdiden combinaisons)\n```bash\nQICT: a pairwise test case generator\n(C) 2009 James McCaffrey, (C) 2014 Sylvain Hallé\n\n- There are 4 parameters\n- There are 11 parameter values\n- Parameter values:\n  a b c d e f g h i j k \n- Legal values internal representation: \n  * Parameter0: 0 1 \n  * Parameter1: 2 3 4 5 \n  * Parameter2: 6 7 8 \n  * Parameter3: 9 10 \n- There are 44 pairs \n\nComputing testsets which capture all possible pairs...\n\nResult test sets: \n\n  0\t\ta\tc\tg\tj\t\n  1\t\tb\td\tg\tk\t\n  2\t\ta\te\th\tk\t\n  3\t\tb\tf\ti\tj\t\n  4\t\tb\tc\th\tj\t\n  5\t\ta\td\ti\tj\t\n  6\t\ta\tf\tg\tk\t\n  7\t\tb\te\ti\tj\t\n  8\t\ta\td\th\tj\t\n  9\t\ta\tc\ti\tk\t\n 10\t\ta\te\tg\tj\t\n 11\t\ta\tf\th\tj\t\n\nEnd\n\n``` \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsylvainhalle%2Fqict","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsylvainhalle%2Fqict","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsylvainhalle%2Fqict/lists"}