Lines Matching defs:size
348 void setArray(Line **array, Line *contents, int32_t size) {
350 for(i = 0; i < size; i++) {
358 int32_t size = table->count();
365 return size;
472 analyzeStrength(Line **lines, int32_t size, CompareFn comparer) {
475 for(i = 1; i < size; i++) {
526 void printOrdering(Line **lines, int32_t size, UFILE *file, UBool useLinks = false) {
541 while(i < size && previous->next) {
567 void setIndexes(Line **lines, int32_t size) {
570 for(i = 1; i < size; i++) {
582 noteExpansion(Line **gLines, Line *line, int32_t size, CompareFn comparer) {
604 for(i = 0; i < size; i++) {
626 positionExpansions(Line **gLines, int32_t size, CompareFn comparer) {
660 printOrdering(gLines, size, log, true);
696 printOrdering(gLines, size, log, true);
797 analyzeContractions(Line** lines, int32_t size, CompareFn comparer) {
807 for(i = 1; i < size; i++) {
827 while(j < size && (*(lines+j))->strength > (*currLine)->strength) {
831 while(j < size &&
868 while(j < size && (*(lines+j))->strength > (*currLine)->strength) {
894 detectContractions(Line **gLines, Line *lines, int32_t size, CompareFn comparer) {
898 Line *backupLines = new Line[size];
899 Line::copyArray(backupLines, lines, size);
902 Line **gLinesBackup = NULL; //new Line*[size];
904 for(i = 0; i < size; i++) {
906 Line::copyArray(lines, backupLines, size);
907 for(j = 0; j < size; j++) {
913 if((noContractions += analyzeContractions(gLines, size, comparer)) && gDebug) {
915 gLinesBackup = new Line*[size];
918 setArray(gLinesBackup, lines, size);
919 qsort(gLinesBackup, size, sizeof(Line *), comparer);
920 //setIndexes(gLinesBackup, size);
921 analyzeStrength(gLinesBackup, size, comparer);
922 printOrdering(gLinesBackup, size, log);
941 detectExpansions(Line **gLines, int32_t size, CompareFn comparer) {
955 for(i = 0; i < size; i++) {
961 u_strcpy(end.name+srcLen, (*(gLines+size-1))->name);
962 end.len = srcLen + (*(gLines+size-1))->len;
964 for(k = 0; k < size; k++) { // k is index of a thing that is not doubled
984 for(j = 0; j < size; j++) {
1025 Line *doubles = new Line[size*10];
1026 Line **sorter = new Line*[size*10];
1054 currSize = size*current->expansionPrefixesSize;
1112 //noteExpansion(gLines, current, size, comparer);
1153 reduceUntailored(Line **gLines, int32_t size){
1185 constructAndAnalyze(Line **gLines, Line *lines, int32_t size, CompareFn comparer) {
1190 setArray(gLines, lines, size);
1191 //size = setArray(gLines);
1193 qsort(gLines, size, sizeof(Line *), comparer);
1196 //setIndexes(gLines, size);
1198 analyzeStrength(gLines, size, comparer);
1201 printOrdering(gLines, size, log);
1211 noContractions = detectContractions(gLines, lines, size, comparer);
1218 size = setArray(gLines);
1219 qsort(gLines, size, sizeof(Line *), comparer);
1220 analyzeStrength(gLines, size, comparer);
1225 int32_t noExpansions = detectExpansions(gLines, size, comparer);
1230 positionExpansions(gLines, size, comparer);
1234 printOrdering(gLines, size, log, true);
1236 //reduceUntailored(gLines, size);
1240 printOrdering(gLines, size, out, true);
1241 printOrdering(gLines, size, log, true);
1254 const int32_t size = sizeof(stuff)/sizeof(stuff[0]);
1256 Line **sortedLines = new Line*[size];
1257 Line lines[size];
1262 for(i = 0; i < size; i++) {
1265 setArray(sortedLines, lines, size);
1266 qsort(sortedLines, size, sizeof(Line*), gComparer);
1268 for(i = 0; i < size; i++) {
1272 if(*(sortedLines+i) == &lines[size-i-1]) {
1278 if(ordered == size) {
1280 } else if(reversed == size) {
1297 const int32_t size = sizeof(stuff)/sizeof(stuff[0]);
1299 Line **sortedLines = new Line*[size];
1300 Line lines[size];
1305 for(i = 0; i < size; i++) {
1308 setArray(sortedLines, lines, size);
1309 qsort(sortedLines, size, sizeof(Line*), gComparer);
1311 for(i = 0; i < size; i++) {
1315 if(*(sortedLines+i) == &lines[size-i-1]) {
1321 if(ordered == size) {
1323 } else if(reversed == size) {
1373 if(ignorables.size()) {
1380 if(primaryIgnorables.size()) {
1439 while(exemplarUSet.size() != 0 && (exChar = exemplarUSet.charAt(0)) != -1) {
1542 int32_t exemplarSetSize = exemplarUSet.size();