├── bin ├── 32bit Quine-McCluskey and Petrick's Method in C v5.03.exe └── 32bit Quine-McCluskey and Petrick's Method in C v5.03.out ├── README.md ├── src ├── petrick.h ├── mccluskey.h └── main.c └── LICENSE /bin/32bit Quine-McCluskey and Petrick's Method in C v5.03.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Es1chUbJyan9/32bit_Quine-McCluskey_and_Petrick_Method_in_C/HEAD/bin/32bit Quine-McCluskey and Petrick's Method in C v5.03.exe -------------------------------------------------------------------------------- /bin/32bit Quine-McCluskey and Petrick's Method in C v5.03.out: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Es1chUbJyan9/32bit_Quine-McCluskey_and_Petrick_Method_in_C/HEAD/bin/32bit Quine-McCluskey and Petrick's Method in C v5.03.out -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # 32bit_Quine-McCluskey_and_Petrick_Method_in_C 2 | ## Features 3 | 1. Support optimize Boolean functions with 32 variables, so minterm range is 0 ~ 4294967295 4 | 2. Support for don't care conditions 5 | 3. Support for input out of order 6 | 4. Support for Petrick's method to minimize Boolean functions 7 | 5. Support output all minimized Boolean functions 8 | 6. Support show full process of operation 9 | 10 | ## Features 11 | 1. 支援化簡三十二位變數， 即 Minterm 範圍為 0 ~ 4294967295 12 | 2. 支援輸入 Don't Care 13 | 3. 支援亂序輸入，即不須按大小順序排列 14 | 3. 支援視情況自動調用 Petrick's Method，輸出最小覆蓋函數 15 | 4. 支援輸出所有等價的最小覆蓋函數 16 | 5. 輸入表達式的長度限制為 1000 字符，但理論上限以運行時電腦的記憶體空間決定， 17 | 可於 mccluskey.h 中直接修改以下宏定義，擴充輸入的限制範圍： 18 | #define EXPRESSION_MAX_LENGTH 1001 19 | 20 | ## Instructions for use 21 | 運行後依提示分兩行輸入 Minterm 與 Don't care，並用逗號「,」隔開各項即可，若無 Don't care 請輸入 -1，因無輸入偵錯，請避免額外的空白與字符。 22 | 23 | 注意：在某些特殊情況下，會輸出不同順序的同一函數，但並不影響正確性。 24 | EX: m(9,12,13,15)+d(1,4,5,7,8,11,14) 25 | 26 | ## References & Gratitude 27 | - QM算法及其他 28 | http://mprc.pku.edu.cn/courses/digital/2013spring/pdf/lec8.QM.pdf 29 | - 以自動化程式化簡布林代數 30 | http://web.fg.tp.edu.tw/~tfghdb/blog/wp-content/uploads/2016/01/WL21_pp501-pp511_以自動化程式化簡布林代數.pdf 31 | - 增強型 Qunie-Mccluskey 算法及其實驗 32 | http://www.paper.edu.cn/journal/downCount/1674-2869(2011)01-0100-04 33 | - Petrick's Method 34 | http://www.mrc.uidaho.edu/mrc/people/jff/349/lect.10 35 | - qmc-algo in C language 36 | https://github.com/kkanellis/qmc-algo 37 | - QuineMcCluskeySolver 38 | http://quinemccluskey.com/index.php 39 | -------------------------------------------------------------------------------- /src/petrick.h: -------------------------------------------------------------------------------- 1 | //Version 5.03 2 | //更新：修復多處 Bug，測試穩定版 3 | //Created by Es1chUb.Jyan9@gmail.com 4 | // 5 | //todo: 6 | //1.效能:MultiplyOut 表首 Node 加入排序 7 | //2.效能:清除內存泄漏 8 | //3.效能:新增:支援多輸出函數化簡 9 | 10 | 11 | /******************************資料結構******************************/ 12 | struct idnode{ 13 | unsigned int id; 14 | struct idnode *maxterm; 15 | struct idnode *prev; 16 | struct idnode *next; 17 | }; 18 | typedef struct idnode idnodeT; 19 | 20 | /******************************函數原型******************************/ 21 | 22 | //List 相關 23 | void CreateMaxtermList(bool **needCovered, idnodeT **maxtermList, int cMintermsCovered, int cPrimeImplicantsCovered); 24 | void nodeInit(idnodeT **root, unsigned int id); 25 | void nodeInsert(idnodeT *root, unsigned int id); 26 | void nodeCopy(idnodeT *root,idnodeT **maxtermList); 27 | void nodeAdd(idnodeT *root, idnodeT *addnode, idnodeT *prevnode); 28 | void nodeRemove(idnodeT *root, idnodeT *prev); 29 | 30 | //運算相關 31 | void MultiplyOut(idnodeT **maxtermList, unsigned int lenMul); 32 | void RuleOne(idnodeT **maxtermList); 33 | void RuleTwo(idnodeT **maxtermList); 34 | void LeastCover(idnodeT **maxtermList,idnodeT **shortMaxterm, unsigned int *cShortMaxterm); 35 | 36 | /******************************函數實現******************************/ 37 | 38 | void CreateMaxtermList(bool **needCovered, idnodeT **maxtermList, int cMintermsCovered, int cPrimeImplicantsCovered){ 39 | unsigned int i,j; 40 | bool flag = false; 41 | 42 | for (j=0; j < cMintermsCovered; j++,flag = false) { 43 | for (i=0; i < cPrimeImplicantsCovered; i++) { 44 | if (needCovered[i][j] == true) { 45 | if (flag == false) { 46 | nodeInit(&maxtermList[j], i); 47 | flag = true; 48 | } 49 | else 50 | nodeInsert(maxtermList[j], i); 51 | } 52 | } 53 | } 54 | } 55 | 56 | 57 | void nodeInit(idnodeT **root, unsigned int id){ 58 | idnodeT *newNode = (idnodeT *)malloc(sizeof(idnodeT)); 59 | newNode->id = id; 60 | newNode->next = newNode->prev = newNode->maxterm = NULL; 61 | 62 | *root = newNode; 63 | } 64 | 65 | void nodeInsert(idnodeT *root, unsigned int id){ 66 | idnodeT *newNode = (idnodeT *)malloc( sizeof(idnodeT) ); 67 | newNode->id = id; 68 | newNode->next = newNode->prev = newNode->maxterm = NULL; 69 | 70 | //尋找適合的位置 71 | idnodeT *curr; 72 | for (curr = root; curr->next != NULL; curr = curr->next) 73 | if(curr->next->id > newNode->id) 74 | break; 75 | 76 | //調整前後節點的指標 77 | if(curr->next != NULL){ 78 | curr->next->prev = newNode; 79 | newNode->next = curr->next; 80 | newNode->prev = curr; 81 | curr->next = newNode; 82 | } 83 | else{ 84 | newNode->prev = curr; 85 | curr->next = newNode; 86 | } 87 | } 88 | 89 | void nodeCopy(idnodeT *root, idnodeT **maxtermList){ 90 | idnodeT *newNode = (idnodeT *)malloc( sizeof(idnodeT) ); 91 | newNode->id = root->id; 92 | newNode->next = newNode->prev = newNode->maxterm = NULL; 93 | 94 | 95 | //複製所有 Maxterm 96 | idnodeT *curr0, *curr1; 97 | for (curr0 = root, curr1 = newNode; curr0->maxterm != NULL; curr0 = curr0->maxterm){ 98 | idnodeT *idNode = (idnodeT *)malloc( sizeof(idnodeT) ); 99 | idNode->id = curr0->maxterm->id; 100 | curr1->maxterm = idNode; 101 | curr1 = curr1->maxterm; 102 | 103 | } 104 | 105 | //調整前後節點的指標 106 | if(root->next != NULL){ 107 | root->next->prev = newNode; 108 | newNode->next = root->next; 109 | newNode->prev = root; 110 | root->next = newNode; 111 | } 112 | else{ 113 | newNode->prev = root; 114 | root->next = newNode; 115 | } 116 | } 117 | //在 Maxterm 中插入新的 id 118 | void nodeAdd(idnodeT *root, idnodeT *addnode, idnodeT *prevnode){ 119 | idnodeT *idNode = (idnodeT *)malloc( sizeof(idnodeT) ); 120 | idNode->id = addnode->id; 121 | idNode->next = idNode->prev = idNode->maxterm = NULL; 122 | 123 | //尋找適合的位置 124 | // if (root->id <= idNode->id){ 125 | idnodeT *curr; 126 | for (curr = root; curr->maxterm != NULL; curr = curr->maxterm) 127 | if(curr->maxterm->id > idNode->id) 128 | break; 129 | 130 | //調整前後節點的指標 131 | if(curr->maxterm != NULL){ 132 | idNode->maxterm = curr->maxterm; 133 | curr->maxterm = idNode; 134 | } 135 | else 136 | curr->maxterm = idNode; 137 | // } 138 | // else{ 139 | // idNode->next = root->next; 140 | // idNode->prev = root->prev; 141 | // idNode->maxterm = root; 142 | // if (root->next != NULL) 143 | // root->next->prev = idNode; 144 | // prevnode->next = idNode; 145 | // } 146 | } 147 | 148 | //乘開 Maxterm 149 | void MultiplyOut(idnodeT **maxtermList, unsigned int lenMul){ 150 | idnodeT *curr0, *curr1, *currprev; 151 | 152 | //計算有幾個要乘 153 | unsigned int cNextMaxterm = 0 , cMul; 154 | for (curr0 = maxtermList[lenMul]; curr0->next != NULL; curr0 = curr0->next) 155 | cNextMaxterm++; 156 | 157 | //先將被乘項複製出足夠的數量 158 | for (curr0 = maxtermList[0]; curr0 != NULL;curr0 = curr1){ 159 | for (cMul = 0 , curr1 = curr0->next ; cMul < cNextMaxterm; cMul++) { 160 | nodeCopy(curr0,maxtermList); 161 | } 162 | } 163 | 164 | //將乘項接上 165 | for (curr0 = maxtermList[0] , currprev = NULL, curr1 = maxtermList[lenMul];curr0 != NULL; 166 | curr0 = curr0->next, curr1 = curr1->next){ 167 | if (curr1 != NULL){ 168 | nodeAdd(curr0, curr1, currprev); 169 | currprev = curr0; 170 | } 171 | else{ 172 | curr1 = maxtermList[lenMul]; 173 | nodeAdd(curr0, curr1, currprev); 174 | currprev = curr0; 175 | } 176 | } 177 | } 178 | 179 | void nodeRemove(idnodeT *root, idnodeT *prev){ 180 | prev->maxterm = root->maxterm; 181 | // free(root); 182 | // root = NULL; 183 | } 184 | 185 | //第一化簡規則 XX = X 186 | void RuleOne(idnodeT **maxtermList){ 187 | idnodeT *curr0,*curr1,*curr2,*currTemp; 188 | 189 | for (curr0 = maxtermList[0]; curr0 != NULL; curr0 = curr0->next){ 190 | for (curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 191 | for (curr2 = curr1->maxterm,currTemp = curr1; curr2 != NULL;){ 192 | if (curr2->id == curr1->id) { 193 | nodeRemove(curr2,currTemp); 194 | curr2 = currTemp->maxterm; 195 | } 196 | else{ 197 | currTemp = curr2; 198 | curr2 = curr2->maxterm; 199 | } 200 | } 201 | } 202 | } 203 | } 204 | 205 | //將找出最短 Maxterm 206 | void LeastCover(idnodeT **maxtermList,idnodeT **shortMaxterm, unsigned int *cShortMaxterm){ 207 | unsigned int i,min = 4294967295; 208 | idnodeT *curr0 , *curr1; 209 | for (curr0 = maxtermList[0], i = 0; curr0 != NULL; curr0 = curr0->next, i = 0) { 210 | for (curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 211 | i++; 212 | } 213 | if(i < min){ 214 | min = i; 215 | *shortMaxterm = curr0; 216 | } 217 | } 218 | *cShortMaxterm = min; 219 | 220 | //中斷 shortMaxterm 在 maxtermList 中的連結 221 | if ((*shortMaxterm)->prev != NULL) 222 | (*shortMaxterm)->prev->next = (*shortMaxterm)->next; 223 | else if((*shortMaxterm)->prev == NULL && (*shortMaxterm)->next != NULL) 224 | maxtermList[0] = (*shortMaxterm)->next; 225 | else 226 | maxtermList[0] = NULL; 227 | if ((*shortMaxterm)->next != NULL) 228 | (*shortMaxterm)->next->prev = (*shortMaxterm)->prev; 229 | } 230 | 231 | //第二化簡規則 X+XY = X 232 | void RuleTwo(idnodeT **maxtermList){ 233 | idnodeT *curr0,*curr1,*curr0temp,*curr1temp; 234 | bool flag; 235 | 236 | for (curr0 = maxtermList[0]; curr0 != NULL; curr0 = curr0->next){ 237 | for (curr1 = curr0->next,flag = true; curr1 != NULL; curr1 = curr1->next, flag = true) { 238 | for (curr0temp = curr0, curr1temp = curr1; curr0temp != NULL && curr1temp != NULL 239 | ; curr0temp = curr0temp->maxterm, curr1temp = curr1temp->maxterm) { 240 | if (curr0temp->id != curr1temp->id) { 241 | flag = false; 242 | break; 243 | } 244 | } 245 | //這裡會將先短的覆蓋後長的 246 | if (flag == true && curr0temp == NULL) { 247 | curr1->prev->next = curr1->next; 248 | if(curr1->next != NULL) 249 | curr1->next->prev = curr1->prev; 250 | } 251 | //這裡會將後短的覆蓋先長的 252 | else if(flag == true && curr1temp == NULL && curr0->prev != NULL){ 253 | curr0->prev->next = curr0->next; 254 | if(curr0->next != NULL) 255 | curr0->next->prev = curr0->prev; 256 | curr0 = curr0->next; 257 | 258 | } 259 | //這裡會將後短的覆蓋表頭的 260 | else if(flag == true && curr1temp == NULL && curr0->prev == NULL){ 261 | maxtermList[0] = curr0->next; 262 | if(curr0->next != NULL) 263 | curr0->next->prev = NULL; 264 | curr0 = curr0->next; 265 | } 266 | 267 | } 268 | } 269 | 270 | } -------------------------------------------------------------------------------- /src/mccluskey.h: -------------------------------------------------------------------------------- 1 | //Version 5.03 2 | //更新：修復多處 Bug，測試穩定版 3 | //Created by Es1chUb.Jyan9@gmail.com 4 | //todo: 5 | //1.效能:MultiplyOut 表首 Node 加入排序 6 | //2.效能:清除內存泄漏 7 | //3.效能:新增:支援多輸出函數化簡 8 | 9 | /******************************包含文件******************************/ 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | #include 16 | 17 | 18 | /******************************可調參數******************************/ 19 | #define DELIMITER ',' 20 | #define PARSE_DELIMETERS " ," 21 | #define EXPRESSION_MAX_LENGTH 1001 22 | #define VARIABLES_MAX 32 23 | 24 | 25 | /******************************資料結構******************************/ 26 | //用來儲存 Implicants 中 Minterm id 的串列節點 27 | struct lnode{ 28 | unsigned int id; 29 | struct lnode *next; 30 | struct lnode *prev; 31 | }; 32 | typedef struct lnode lnodeT; 33 | 34 | //用來儲存 Implicants 實體，其二進位字串、1的個數、包含的 minterm 的 id 串列 35 | struct mintermGroup{ 36 | char *repr; 37 | unsigned int cPosBits; 38 | lnodeT *root; 39 | }; 40 | typedef struct mintermGroup mintermGroupT; 41 | 42 | 43 | /******************************函數原型******************************/ 44 | //輸入類 45 | void ReadInput(char *exp_minterms, char *exp_dontCare); 46 | void CountTerms(char *exp_minterms, unsigned int *cMinterms); 47 | void ParseInput(char *exp_minterms, mintermGroupT *mintermArray,unsigned int cMinterms,unsigned int *cVariables); 48 | void ParseCareInput(char *exp_minterms, mintermGroupT *mintermArray,unsigned int cMinterms,unsigned int *cVariables); 49 | //補助類 50 | int CompareById(const void *a, const void *b); 51 | int CompareByRepr(const void *a , const void *b); 52 | bool CanFormGroup(mintermGroupT firstGroup, mintermGroupT secondGroup,unsigned int cVariables); 53 | void CreateNewRepr(char *newGroupRepr, char *firstGroupRepr, char *secondGroupRepr, int cVariables); 54 | //串列類 55 | void list_init(lnodeT **root, unsigned int id); 56 | void list_insert(lnodeT *root, unsigned int id); 57 | void list_merge(lnodeT **newRoot, lnodeT *firstRoot, lnodeT *secondRoot ); 58 | bool list_equal(lnodeT *firstRoot, lnodeT *secondRoot); 59 | void list_print(lnodeT *root); 60 | //歸納類 61 | void GetPrimeImplicants( mintermGroupT **table, bool **termsUsed, mintermGroupT *primeImplicantsArray,unsigned int *lenCol, int cColumns); 62 | void CreatePrimeChart(bool **primeChart, mintermGroupT *minterms, int cMinterms,mintermGroupT *primeImplicantsArray, int cPrimeImplicants); 63 | void GetEssentialImplicants(bool **primeChart, int cPrimeImplicants, int cMinterms, bool *isEssential ); 64 | 65 | 66 | /******************************函數實現******************************/ 67 | //讀取 minterm 輸入，儲存為字符串 68 | void ReadInput(char *exp_minterms, char *exp_dontCare){ 69 | printf("\n32bit Quine-McCluskey and Petrick's Method in C v5.03"); 70 | printf("\nCreated by Es1chUb.Jyan9@gmail.com"); 71 | printf("\n\n#########################################################################\n"); 72 | printf("################ Quine-McCluskey Algorithm is Started ################\n"); 73 | printf("#########################################################################\n\n"); 74 | 75 | //讀取輸入 76 | printf("Please enter the minterms(Divided by ,):\n\t>> "); 77 | scanf("%s", exp_minterms); 78 | 79 | printf("\nPlease enter the don't care(Divided by ,):\n!!! If you don't need don't care, Please enter -1 !!!\n\t>> "); 80 | scanf("%s", exp_dontCare); 81 | } 82 | 83 | //透過分隔符來計算有幾個 minterm 84 | void CountTerms(char *exp_minterms, unsigned int *cMinterms){ 85 | char *ptr = strchr(exp_minterms,DELIMITER); 86 | for (*cMinterms = 1; ptr != NULL; (*cMinterms)++) 87 | ptr = strchr(ptr + 1, DELIMITER); 88 | } 89 | 90 | //初始化 Implicants id 鏈表 91 | void list_init(lnodeT **root, unsigned int id){ 92 | lnodeT *newNode = (lnodeT *)malloc( sizeof(lnodeT) ); 93 | newNode->id = id; 94 | newNode->next = newNode->prev = NULL; 95 | 96 | *root = newNode; 97 | } 98 | 99 | //分析輸入 100 | void ParseInput(char *exp_minterms, mintermGroupT *mintermArray,unsigned int cMinterms,unsigned int *cVariables){ 101 | unsigned int i,j,maxMinterm = 0; 102 | 103 | //以逗點為分隔，讀取一個 minterm 字串 104 | char *pch = strtok(exp_minterms, PARSE_DELIMETERS); 105 | 106 | //將 minterm 存入 mintermArray 107 | for(i = 0; i < cMinterms; i++){ 108 | mintermArray[i].repr = (char *)malloc( (VARIABLES_MAX + 1) * sizeof(char)); 109 | mintermArray[i].cPosBits = 0; 110 | mintermArray[i].root = NULL; 111 | 112 | //存入 id 113 | unsigned int id = atoi(pch); 114 | list_init(&mintermArray[i].root, id); 115 | 116 | //檢查是否為最大 minterm 117 | maxMinterm = (maxMinterm > id) ? maxMinterm : id; 118 | 119 | //將 minterm 轉換為二進位字串，並計算1的個數，注意是反的 120 | for(j = 0; j < VARIABLES_MAX; j++,id /= 2){ 121 | if(id % 2 == 1){ 122 | mintermArray[i].repr[j] = '1'; 123 | mintermArray[i].cPosBits++; 124 | } 125 | else 126 | mintermArray[i].repr[j] = '0'; 127 | } 128 | mintermArray[i].repr[VARIABLES_MAX] = '\0'; 129 | 130 | //讀取下一個minterm 131 | if(i + 1 < cMinterms) 132 | pch = strtok(NULL, PARSE_DELIMETERS); 133 | } 134 | 135 | //全部輸入完畢後依最大 minterm 求出變數數 136 | (*cVariables) = 0; 137 | for (int binary = 1; maxMinterm > (binary - 1) ; (*cVariables)++) 138 | binary *= 2; 139 | 140 | //依求得的變數數縮小二進位字串，以節省空間，並反向 141 | for(i = 0; i < cMinterms; i++){ 142 | mintermArray[i].repr = (char *)realloc( mintermArray[i].repr , (*cVariables + 1) * sizeof(char) ); 143 | mintermArray[i].repr[ *cVariables ] = '\0'; 144 | 145 | //反向二進位字串 146 | for(unsigned long int low = 0,high = *cVariables - 1; low < high; low++,high--) { 147 | char c = mintermArray[i].repr[low]; 148 | mintermArray[i].repr[low] = mintermArray[i].repr[high]; 149 | mintermArray[i].repr[high] = c; 150 | } 151 | } 152 | } 153 | 154 | //分析輸入 155 | void ParseCareInput(char *exp_minterms, mintermGroupT *mintermArray,unsigned int cMinterms,unsigned int *cVariables){ 156 | unsigned int i,j,maxMinterm = 0; 157 | 158 | //以逗點為分隔，讀取一個 minterm 字串 159 | char *pch = strtok(exp_minterms, PARSE_DELIMETERS); 160 | 161 | //將 minterm 存入 mintermArray 162 | for(i = 0; i < cMinterms; i++){ 163 | mintermArray[i].repr = (char *)malloc( (VARIABLES_MAX + 1) * sizeof(char)); 164 | mintermArray[i].cPosBits = 0; 165 | mintermArray[i].root = NULL; 166 | 167 | //存入 id 168 | unsigned int id = atoi(pch); 169 | list_init(&mintermArray[i].root, id); 170 | 171 | //檢查是否為最大 minterm 172 | maxMinterm = (maxMinterm > id) ? maxMinterm : id; 173 | 174 | //將 minterm 轉換為二進位字串，並計算1的個數，注意是反的 175 | for(j = 0; j < VARIABLES_MAX; j++,id /= 2){ 176 | if(id % 2 == 1){ 177 | mintermArray[i].repr[j] = '1'; 178 | mintermArray[i].cPosBits++; 179 | } 180 | else 181 | mintermArray[i].repr[j] = '0'; 182 | } 183 | mintermArray[i].repr[VARIABLES_MAX] = '\0'; 184 | 185 | //讀取下一個minterm 186 | if(i + 1 < cMinterms) 187 | pch = strtok(NULL, PARSE_DELIMETERS); 188 | } 189 | 190 | //依求得的變數數縮小二進位字串，以節省空間，並反向 191 | for(i = 0; i < cMinterms; i++){ 192 | mintermArray[i].repr = (char *)realloc( mintermArray[i].repr , (*cVariables + 1) * sizeof(char) ); 193 | mintermArray[i].repr[ *cVariables ] = '\0'; 194 | 195 | //反向二進位字串 196 | for(unsigned long int low = 0,high = *cVariables - 1; low < high; low++,high--) { 197 | char c = mintermArray[i].repr[low]; 198 | mintermArray[i].repr[low] = mintermArray[i].repr[high]; 199 | mintermArray[i].repr[high] = c; 200 | } 201 | } 202 | } 203 | 204 | //用於 qsort 的依 id 比較 205 | int CompareById(const void *a, const void *b){ 206 | mintermGroupT *first = (mintermGroupT *)a; 207 | mintermGroupT *second = (mintermGroupT *)b; 208 | 209 | return ( first->root->id - second->root->id); 210 | } 211 | 212 | //用於 qsort 的依二進位比較 213 | int CompareByRepr(const void *a , const void *b){ 214 | mintermGroupT *first = (mintermGroupT *)a; 215 | mintermGroupT *second = (mintermGroupT *)b; 216 | 217 | if( first->cPosBits == second->cPosBits ){ 218 | return strcmp( first->repr, second->repr ); 219 | } 220 | 221 | return (first->cPosBits - second->cPosBits); 222 | } 223 | 224 | //檢查兩 Implicants 是否只差一位 225 | bool CanFormGroup(mintermGroupT firstGroup, mintermGroupT secondGroup,unsigned int cVariables){ 226 | int i, bitsDiffer = 0; 227 | for(i = 0; i < cVariables; i++){ 228 | //如果 '-' 的位置不一樣 229 | if((firstGroup.repr[i] == '-' && secondGroup.repr[i] != '-') || 230 | (firstGroup.repr[i] != '-' && secondGroup.repr[i] == '-') ) 231 | return 0; 232 | 233 | //如果該二進位不同 234 | if( firstGroup.repr[i] != secondGroup.repr[i] ) 235 | bitsDiffer++; 236 | } 237 | //若只有一位不同 238 | return (bitsDiffer == 1) ? 1 : 0; 239 | } 240 | 241 | //插入新結點 242 | void list_insert(lnodeT *root, unsigned int id){ 243 | lnodeT *newElement = (lnodeT *)malloc( sizeof(lnodeT) ); 244 | newElement->id = id; 245 | newElement->next = newElement->prev = NULL; 246 | 247 | //尋找適合的位置 248 | lnodeT *curr; 249 | for (curr = root; curr->next != NULL; curr = curr->next) 250 | if(curr->next->id > newElement->id) 251 | break; 252 | 253 | //調整前後節點的指標 254 | if(curr->next != NULL){ 255 | curr->next->prev = newElement; 256 | newElement->next = curr->next; 257 | newElement->prev = curr; 258 | curr->next = newElement; 259 | } 260 | else{ 261 | newElement->prev = curr; 262 | curr->next = newElement; 263 | } 264 | } 265 | 266 | //串列合併 267 | void list_merge(lnodeT **newRoot, lnodeT *firstRoot, lnodeT *secondRoot){ 268 | //初始化新串列 269 | list_init(newRoot, firstRoot->id ); 270 | 271 | //複製第一個串列 272 | lnodeT *curr; 273 | for (curr = firstRoot->next; curr != NULL ; curr = curr->next) 274 | list_insert( *newRoot, curr->id ); 275 | 276 | //複製第二個串列 277 | for (curr = secondRoot; curr != NULL ; curr = curr->next) 278 | list_insert( *newRoot, curr->id ); 279 | } 280 | 281 | //判斷 id 串列是否相等 282 | bool list_equal(lnodeT *firstRoot, lnodeT *secondRoot){ 283 | lnodeT *fNode = firstRoot; 284 | lnodeT *sNode = secondRoot; 285 | while(fNode != NULL){ 286 | if(fNode->id != sNode->id) 287 | return 0; 288 | 289 | fNode = fNode->next; 290 | sNode = sNode->next; 291 | } 292 | return 1; 293 | } 294 | 295 | //初始化新 Implicants 的二進位字串 296 | void CreateNewRepr(char *newGroupRepr, char *firstGroupRepr, char *secondGroupRepr, int cVariables){ 297 | for(unsigned int i = 0; i < cVariables; i++){ 298 | if( firstGroupRepr[i] == secondGroupRepr[i] ) 299 | newGroupRepr[i] = firstGroupRepr[i]; 300 | else 301 | newGroupRepr[i] = '-'; 302 | } 303 | 304 | newGroupRepr[cVariables] = '\0'; 305 | } 306 | 307 | //整理出 Prime Implicants 308 | void GetPrimeImplicants( mintermGroupT **table, bool ** termsUsed, mintermGroupT *primeImplicantsArray, unsigned int *lenCol, int cColumns){ 309 | int i,j,index = 0; 310 | 311 | for(i = 0; i <= cColumns; i++) 312 | for(j = 0; j < lenCol[i]; j++) 313 | if(termsUsed[i][j] == false){ 314 | primeImplicantsArray[index] = table[i][j]; 315 | index++; 316 | } 317 | } 318 | 319 | //二維 Prime Implicants Cover 表，表示第 j 個 minterm 可被第 i 個 Prime Implicants 覆蓋 320 | void CreatePrimeChart(bool **primeChart, mintermGroupT *minterms, int cMinterms, mintermGroupT * primeImplicantsArray, int cPrimeImplicants){ 321 | unsigned int i,j,mintermId; 322 | lnodeT *curr; 323 | 324 | //遍歷所有的 Prime Implicants 325 | for(i = 0,j = 0; i < cPrimeImplicants; i++,j=0){ 326 | //遍歷該 Prime Implicants 包含的 id 327 | for(curr = primeImplicantsArray[i].root;curr != NULL;curr = curr->next){ 328 | //找出該 Prime Implicants 所對應的 mintermArray 位置 329 | mintermId = minterms[j].root->id; 330 | while( mintermId < (curr->id) && j < cMinterms-1){ 331 | j++; 332 | mintermId = minterms[j].root->id; 333 | } 334 | //在覆蓋表中標示 j 可被 i 覆蓋 335 | if (curr->id == mintermId) 336 | primeChart[i][j] = true; 337 | } 338 | } 339 | } 340 | 341 | //一維 Essential Prime Implicant 表 342 | void GetEssentialImplicants(bool ** primeChart, int cPrimeImplicants, int cMinterms, bool * isEssential ){ 343 | int i,j,nextEssential; 344 | 345 | //遍歷所有的 minterms 346 | for(j = 0; j < cMinterms; j++){ 347 | nextEssential = -1; 348 | //遍歷該 minterm 中所有的質蘊函項，檢查是否只有一項覆蓋 349 | for(i = 0; i < cPrimeImplicants; i++){ 350 | if( primeChart[i][j] == true ){ 351 | if(nextEssential == -1) 352 | nextEssential = i; 353 | else{ 354 | nextEssential = -1; 355 | break; 356 | } 357 | } 358 | } 359 | //若只有一個 Prime Implicants 覆蓋，此項為 Essential Prime Implicant 360 | if(nextEssential != -1) 361 | isEssential[nextEssential] = true; 362 | } 363 | } 364 | 365 | //Id 鏈表打印 366 | void list_print(lnodeT *root){ 367 | for (lnodeT *curr = root; curr != NULL; curr = curr->next) 368 | printf("%2u ",curr->id); 369 | } 370 | -------------------------------------------------------------------------------- /src/main.c: -------------------------------------------------------------------------------- 1 | //Version 5.03 2 | //更新：修復多處 Bug，測試穩定版 3 | //Created by Es1chUb.Jyan9@gmail.com 4 | //todo: 5 | //1.效能:MultiplyOut 表首 Node 加入排序 6 | //2.效能:清除內存泄漏 7 | //3.效能:新增:支援多輸出函數化簡 8 | 9 | #include "mccluskey.h" 10 | #include "petrick.h" 11 | 12 | int main(void){ 13 | 14 | //讀取輸入字符串 15 | char exp_Care[EXPRESSION_MAX_LENGTH]; 16 | char exp_dontCare[EXPRESSION_MAX_LENGTH]; 17 | ReadInput(exp_Care,exp_dontCare); 18 | 19 | //開始計時 20 | clock_t start, finish; 21 | start = clock(); 22 | 23 | //計算 minterm 數 24 | unsigned int cMintermsCare,cDontCare; 25 | CountTerms(exp_Care, &cMintermsCare); 26 | CountTerms(exp_dontCare, &cDontCare); 27 | 28 | //合併 Care & Don't care 29 | char *exp_minterms = (char *)malloc(EXPRESSION_MAX_LENGTH * sizeof(char)); 30 | memcpy(exp_minterms, exp_Care, EXPRESSION_MAX_LENGTH * sizeof(char)); 31 | unsigned cMinterms = cMintermsCare; 32 | 33 | if (strstr(exp_dontCare,"-1") == NULL) { 34 | exp_minterms = strcat(strcat(exp_minterms, ","), exp_dontCare); 35 | cMinterms += cDontCare; 36 | } 37 | 38 | //將輸入字符串轉入 mintermArray，並分析變數數 39 | mintermGroupT *mintermArray = (mintermGroupT *)malloc(cMinterms * sizeof(mintermGroupT)); 40 | unsigned int cVariables; 41 | ParseInput(exp_minterms, mintermArray, cMinterms, &cVariables); 42 | 43 | //利用 qsort 使 mintermArray 依 id 排序 44 | qsort(mintermArray, cMinterms, sizeof(mintermGroupT), CompareById); 45 | 46 | //記錄 Table 中直列的長度（即 Implicants 個數） 47 | unsigned int lenCol[VARIABLES_MAX]; 48 | lenCol[0] = cMinterms; 49 | 50 | //將 mintermsArray 存入 table[0] 中當第一列（即一個一圈的），並依 1 的個數排序 51 | mintermGroupT *table[VARIABLES_MAX + 1]; 52 | table[0] = (mintermGroupT *)malloc( cMinterms * sizeof(mintermGroupT)); 53 | memcpy(table[0], mintermArray, lenCol[0] * sizeof(mintermGroupT)); 54 | qsort(table[0], cMinterms, sizeof(mintermGroupT), CompareByRepr); 55 | 56 | //記錄每個 Implicants 的合併情況 57 | bool *termsUsed[VARIABLES_MAX + 1]; 58 | termsUsed[0] = (bool *)calloc( lenCol[0], sizeof(bool)); 59 | 60 | //記錄 Prime Implicants 數 61 | unsigned int cPrimeImplicants = 0; 62 | 63 | //構造 Table，以找出所有的 Implicants，每第 i 列以 i+1 個為一圈 64 | unsigned int i,j,k; 65 | for(i = 0; i <= cVariables; i++){ 66 | //初始化新的一列的暫存空間與項數 67 | mintermGroupT *nextCol = (mintermGroupT *)malloc( (lenCol[i] * lenCol[i]) * sizeof(mintermGroupT) ); 68 | int nextColPos = 0; 69 | 70 | //開始遍歷檢查該列中的項是否有 Implicants 71 | for(j = 0,k = 1; j < lenCol[i]; j++,k=j+1){ 72 | //跳過 1 的個數相同的項 73 | while( k < lenCol[i] && table[i][k].cPosBits == table[i][j].cPosBits ) 74 | k++; 75 | 76 | //若兩項的 1 的個數只差 1 77 | while(k < lenCol[i] && (table[i][k].cPosBits - table[i][j].cPosBits) == 1){ 78 | //且兩項的二進位值只相差一位 79 | if(CanFormGroup(table[i][k], table[i][j], cVariables)){ 80 | //初始化新的 Implicants 81 | lnodeT *newGroupRoot; 82 | list_merge( &newGroupRoot, table[i][j].root, table[i][k].root); 83 | 84 | //檢查該 Implicants 是否以經存在於新的一列中 85 | bool alreadyInColumn = false; 86 | for(unsigned int c = 0; c < nextColPos; c++){ 87 | if(list_equal(nextCol[c].root , newGroupRoot) != 0 ){ 88 | alreadyInColumn = true; 89 | break; 90 | } 91 | } 92 | //若新的一列中未存在該項，則將 Implicants 存入新的一列 93 | if(alreadyInColumn == false){ 94 | nextCol[nextColPos].root = newGroupRoot; 95 | nextCol[nextColPos].cPosBits = table[i][j].cPosBits; 96 | nextCol[nextColPos].repr = (char *)malloc( (cVariables + 1) * sizeof(char) ); 97 | CreateNewRepr(nextCol[nextColPos].repr, table[i][j].repr, table[i][k].repr, cVariables); 98 | 99 | nextColPos++; 100 | } 101 | 102 | //將此兩項標註為已合併 103 | termsUsed[i][j] = termsUsed[i][k] = true; 104 | } 105 | k++; 106 | } 107 | } 108 | 109 | //計算這列未使用的 Implicants 即 Prime Implicants 110 | for(j = 0; j < lenCol[i]; j++) 111 | if(termsUsed[i][j] == false) 112 | cPrimeImplicants++; 113 | 114 | //記錄新的一列的 Implicants 數 115 | lenCol[i+1] = nextColPos; 116 | 117 | //若已無法進行合併，則結束構造 Table 118 | if( lenCol[i+1] == 0 ) 119 | break; 120 | 121 | //將新的一列轉入 Table 中 122 | table[i+1] = (mintermGroupT *)malloc( lenCol[i+1] * sizeof(mintermGroupT) ); 123 | for( j = 0; j < lenCol[i+1]; j++) 124 | table[i+1][j] = nextCol[j]; 125 | 126 | //初始化下一列的合併檢查表，並釋放暫存空間 127 | termsUsed[i+1] = (bool *)calloc( lenCol[i+1], sizeof(bool)); 128 | free(nextCol); 129 | } 130 | //至此 table 構造完畢，已找出所有的 Implicants 131 | 132 | //確定 table 的列數 133 | int cColumns = i; 134 | 135 | //整理出 Prime Implicants 136 | mintermGroupT *primeImplicantsArray = (mintermGroupT *)malloc( cPrimeImplicants * sizeof(mintermGroupT)); 137 | GetPrimeImplicants(table, termsUsed, primeImplicantsArray, lenCol, cColumns); 138 | 139 | //二維 Prime Implicants Cover 表，表示第 j 個 minterm 可被第 i 個 Prime Implicants 覆蓋 140 | bool **primeChart = (bool **)malloc( cPrimeImplicants * sizeof(bool *) ); 141 | for(i = 0; i < cPrimeImplicants; i++) 142 | primeChart[i] = (bool *)calloc( cMintermsCare, sizeof(bool)); 143 | 144 | //構造無 Don't care 的 MintermArray 145 | mintermGroupT *mintermCareArray = (mintermGroupT *)malloc(cMintermsCare * sizeof(mintermGroupT)); 146 | unsigned int cVariablesCare; 147 | ParseCareInput(exp_Care, mintermCareArray, cMintermsCare, &cVariablesCare); 148 | //利用 qsort 使 mintermCareArray 依 id 排序 149 | qsort(mintermCareArray, cMintermsCare, sizeof(mintermGroupT), CompareById); 150 | 151 | CreatePrimeChart(primeChart, mintermCareArray, cMintermsCare, primeImplicantsArray, cPrimeImplicants); 152 | 153 | //製作 Essential Prime Implicant 表 154 | bool *isEssential = (bool *)calloc( cPrimeImplicants, sizeof(bool) ); 155 | GetEssentialImplicants(primeChart, cPrimeImplicants, cMintermsCare, isEssential); 156 | 157 | //製作 Essential Prime Implicant - Minterms 覆蓋表 158 | bool *mintermsCovered = (bool *)calloc( cMintermsCare, sizeof(bool) ); 159 | for(i = 0; i < cPrimeImplicants; i++) 160 | if(isEssential[i] == true) 161 | for(j = 0; j < cMintermsCare; j++) 162 | if(primeChart[i][j] == true) 163 | mintermsCovered[j] = true; 164 | 165 | 166 | //******************************** Q-M 開始輸出******************************** 167 | 168 | 169 | //打印 Table 170 | for(i = 0; i <= cColumns; i++){ 171 | printf("\n\n############### Size %d ###############\n\n",(int)pow(2,i)); 172 | for(j = 0; j < lenCol[i]; j++){ 173 | printf("[ %s ] %s [ ", (termsUsed[i][j] ? "OK" : " X"), table[i][j].repr); 174 | list_print( table[i][j].root ); 175 | printf("]\n"); 176 | } 177 | } 178 | 179 | //打印 Prime Implicant 180 | printf("\n\n############### Prime Implicant ###############\n\n"); 181 | for(i = 0; i < cPrimeImplicants; i++){ 182 | printf("[P%2d]: %s [ ", i, primeImplicantsArray[i].repr); 183 | list_print( primeImplicantsArray[i].root ); 184 | printf("]\n"); 185 | } 186 | 187 | //打印 Prime Implicants Cover 188 | printf("\n\n############### Prime Implicants Cover ###############\n\n"); 189 | printf(" "); 190 | 191 | for(j = 0; j < cMintermsCare; j++) 192 | printf("| %2u", mintermCareArray[j].root->id); 193 | printf("|\n---------"); 194 | 195 | for(j = 0; j < cMintermsCare; j++) 196 | printf("----"); 197 | printf("\n"); 198 | 199 | for(i = 0; i < cPrimeImplicants; i++){ 200 | printf("[P%2d]: ", i); 201 | for(j = 0; j < cMintermsCare; j++) 202 | printf("| %c", ( primeChart[i][j] == true) ? 'X' : ' '); 203 | printf("|\n"); 204 | } 205 | 206 | //打印 Essential Prime Implicant 207 | printf("\n\n############### Essential Prime Implicant ###############\n\n"); 208 | for(i = 0; i < cPrimeImplicants; i++){ 209 | if(isEssential[i] == true){ 210 | printf("[P%2d]: %s [ ", i, primeImplicantsArray[i].repr); 211 | list_print(primeImplicantsArray[i].root); 212 | printf(" ]\n"); 213 | } 214 | } 215 | 216 | //打印 Essential Prime Implicant 的覆蓋情況 217 | printf("\n\n############### Essential Prime Implicant Cover ###############\n\n"); 218 | for(j = 0; j < cMintermsCare; j++) 219 | printf("| %2u", mintermCareArray[j].root->id ); 220 | printf("|\n"); 221 | 222 | for(j = 0; j < cMintermsCare; j++) 223 | printf("----"); 224 | printf("-\n"); 225 | 226 | for(i = 0; i < cMintermsCare; i++) 227 | printf("| %c", (mintermsCovered[i] == true) ? 'X' : ' '); 228 | printf("|\n"); 229 | 230 | //打印 Essential Prime Implicant 的 Function 231 | char ch[32] = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f'}; 232 | unsigned int cEssential = 0; 233 | for (i=0; i < cPrimeImplicants ; i++) 234 | if (isEssential[i] == true) 235 | cEssential++; 236 | 237 | //檢查 minterm 是否已全部覆蓋 238 | bool beOver = true; 239 | for(i = 0; i < cMintermsCare; i++) 240 | if(mintermsCovered[i] == false){ 241 | beOver = false; 242 | break; 243 | } 244 | 245 | if (beOver == true) { 246 | 247 | printf("\n\n############### The Final Function ###############\n\n"); 248 | printf("F("); 249 | for (i = 0; i < cVariables; i++) 250 | printf("%c%s",ch[i],( i+1 < cVariables) ? "," : ") = "); 251 | 252 | bool isOne = true; 253 | 254 | for(unsigned int flag = cEssential, i = 0; i < cPrimeImplicants; i++){ 255 | if(isEssential[i] == true){ 256 | for (j=0; primeImplicantsArray[i].repr[j] != '\0'; j++) { 257 | if(primeImplicantsArray[i].repr[j] == '1'){ 258 | printf("%c",ch[j]); 259 | isOne = false; 260 | } 261 | else if(primeImplicantsArray[i].repr[j] == '0'){ 262 | printf("%c\'",ch[j]); 263 | isOne = false; 264 | } 265 | } 266 | if(--flag) 267 | printf(" + "); 268 | } 269 | } 270 | 271 | if (isOne == true) 272 | printf("1"); 273 | 274 | } 275 | printf("\n\n#########################################################################\n"); 276 | printf("############### Quine-McCluskey Algorithm is Over ###############\n"); 277 | printf("#########################################################################\n"); 278 | 279 | //******************************** Q-M 輸出結束******************************** 280 | //Quine-McCluskey Algorithm 至此結束 281 | 282 | if(beOver == false){ 283 | 284 | printf("\n#########################################################################\n"); 285 | printf("############### Petrick's Method is Started ###############\n"); 286 | printf("#########################################################################\n"); 287 | 288 | //製作新的覆蓋用 PrimeImplicants 289 | unsigned int cPrimeImplicantsCovered = cPrimeImplicants - cEssential; 290 | 291 | mintermGroupT *primeImplicantsCoveredArray = (mintermGroupT *)malloc( cPrimeImplicantsCovered * sizeof(mintermGroupT)); 292 | for (i=0,j=0; iid); 328 | printf("|\n---------"); 329 | 330 | for(j = 0; j < cMintermsCovered; j++) 331 | printf("----"); 332 | printf("\n"); 333 | 334 | for(i = 0; i < cPrimeImplicantsCovered; i++){ 335 | printf("[P%2d]: ", i); 336 | for(j = 0; j < cMintermsCovered; j++) 337 | printf("| %c", ( needCovered[i][j] == true) ? 'X' : ' '); 338 | printf("|\n"); 339 | } 340 | 341 | idnodeT *maxtermList[cMintermsCovered]; 342 | CreateMaxtermList(needCovered, maxtermList, cMintermsCovered, cPrimeImplicantsCovered); 343 | 344 | printf("\n\n############### Maxterm List 0 ###############"); 345 | //打印 maxtermList 346 | for (j=0; j < cMintermsCovered; j++) { 347 | printf("\n\nColumns %d :\n",j); 348 | for (idnodeT *curr = maxtermList[j]; curr != NULL; curr = curr->next) 349 | printf("%2u\n",curr->id); 350 | } 351 | printf("\n"); 352 | 353 | //開始乘開 Maxterm ，並用 Rule 簡化 354 | for (i = 1; i < cMintermsCovered; i++) { 355 | printf("\n\n############### Maxterm List %d ###############\n",i); 356 | MultiplyOut(maxtermList, i); 357 | 358 | // 打印 maxtermList 359 | for (j=0; j < cMintermsCovered; j++) { 360 | printf("\nColumns %d :\n",j); 361 | for (idnodeT *curr0 = maxtermList[j]; curr0 != NULL; curr0 = curr0->next) { 362 | for (idnodeT *curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 363 | printf("%2u ",curr1->id); 364 | } 365 | printf("\n"); 366 | } 367 | } 368 | 369 | printf("\n\n############### Maxterm List %d After XX = X ###############\n",i); 370 | 371 | RuleOne(maxtermList); 372 | 373 | for (j=0; j < cMintermsCovered; j++) { 374 | printf("\nColumns %d :\n",j); 375 | for (idnodeT *curr0 = maxtermList[j]; curr0 != NULL; curr0 = curr0->next) { 376 | for (idnodeT *curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 377 | printf("%2u ",curr1->id); 378 | } 379 | printf("\n"); 380 | } 381 | } 382 | 383 | printf("\n\n############### Maxterm List %d After X + XY = X ###############\n",i); 384 | 385 | RuleTwo(maxtermList); 386 | 387 | for (j=0; j < cMintermsCovered; j++) { 388 | printf("\nColumns %d :\n",j); 389 | for (idnodeT *curr0 = maxtermList[j]; curr0 != NULL; curr0 = curr0->next) { 390 | for (idnodeT *curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 391 | printf("%2u ",curr1->id); 392 | } 393 | printf("\n"); 394 | } 395 | } 396 | } 397 | 398 | 399 | //找出所有的最小 Maxterm 覆蓋 400 | idnodeT *shortMaxterm; 401 | unsigned int cShortMaxterm; 402 | LeastCover(maxtermList, &shortMaxterm, &cShortMaxterm); 403 | if (cMintermsCovered > 1) { 404 | idnodeT *TempMaxterm, *curr0 = shortMaxterm; 405 | unsigned int cTempMaxterm; 406 | for (LeastCover(maxtermList, &TempMaxterm, &cTempMaxterm), curr0 = shortMaxterm; 407 | cTempMaxterm == cShortMaxterm; 408 | LeastCover(maxtermList, &TempMaxterm, &cTempMaxterm)) { 409 | 410 | curr0->next = TempMaxterm; 411 | curr0 = curr0->next; 412 | 413 | } 414 | curr0->next = NULL; 415 | } 416 | 417 | //打印最小 Maxterm 覆蓋 418 | printf("\n\n############### The least Maxterm ###############\n\n"); 419 | for (idnodeT *curr0 = shortMaxterm; curr0 != NULL; curr0 = curr0->next) { 420 | for (idnodeT *curr1 = curr0; curr1 != NULL; curr1 = curr1->maxterm) { 421 | printf("%2u ",curr1->id); 422 | } 423 | printf("\n"); 424 | } 425 | 426 | //開始打印最終結果 427 | printf("\n\n############### The Final Function ###############\n"); 428 | 429 | for (idnodeT *curr2 = shortMaxterm; curr2 != NULL; curr2 = curr2->next) { 430 | 431 | printf("\nF("); 432 | for (i = 0; i < cVariables; i++) 433 | printf("%c%s",ch[i],( i+1 < cVariables) ? "," : ") = "); 434 | 435 | //打印 Essential Prime Implicant 436 | for(unsigned int flag = cEssential, i = 0; i < cPrimeImplicants; i++){ 437 | if(isEssential[i] == true){ 438 | for (j=0; primeImplicantsArray[i].repr[j] != '\0'; j++) { 439 | if(primeImplicantsArray[i].repr[j] == '1') 440 | printf("%c",ch[j]); 441 | else if(primeImplicantsArray[i].repr[j] == '0'){ 442 | printf("%c\'",ch[j]); 443 | } 444 | } 445 | if(--flag) 446 | printf(" + "); 447 | } 448 | } 449 | 450 | if (cShortMaxterm != 0 && cEssential != 0) 451 | printf(" + "); 452 | 453 | //打印最小 Maxterm 454 | unsigned int cadd = cShortMaxterm; 455 | for (idnodeT *curr1 = curr2; curr1 != NULL; curr1 = curr1->maxterm) { 456 | for (k = 0; primeImplicantsCoveredArray[curr1->id].repr[k] != '\0'; k++) { 457 | if(primeImplicantsCoveredArray[curr1->id].repr[k] == '1') 458 | printf("%c",ch[k]); 459 | else if(primeImplicantsCoveredArray[curr1->id].repr[k] == '0'){ 460 | printf("%c\'",ch[k]); 461 | } 462 | } 463 | if(--cadd) 464 | printf(" + "); 465 | 466 | } 467 | printf("\n"); 468 | 469 | } 470 | printf("\n#########################################################################\n"); 471 | printf("################# Petrick's Method is End #################\n"); 472 | printf("#########################################################################\n\n"); 473 | 474 | } 475 | 476 | //結束計時 477 | finish = clock(); 478 | printf("The Running Time is %f sec.\n", (double)(finish - start) / CLOCKS_PER_SEC); 479 | 480 | system("PAUSE"); 481 | 482 | return 0; 483 | } 484 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | --------------------------------------------------------------------------------