* Compare two given intvecs and return 1, if they * * are the same, otherwise 0 * *****************************************************/
| 892 | * are the same, otherwise 0 * |
| 893 | *****************************************************/ |
| 894 | int MivSame(intvec* u , intvec* v) |
| 895 | { |
| 896 | assume(u->length() == v->length()); |
| 897 | |
| 898 | int i, niv = u->length(); |
| 899 | |
| 900 | for (i=0; i<niv; i++) |
| 901 | { |
| 902 | if ((*u)[i] != (*v)[i]) |
| 903 | { |
| 904 | return 0; |
| 905 | } |
| 906 | } |
| 907 | return 1; |
| 908 | } |
| 909 | |
| 910 | /****************************************************** |
| 911 | * Compare 3 given intvecs and return 0, if the first * |
no test coverage detected