void processa_cheque() { Cliente emp, rec; Cheque a; int valor; long int part, dest; a = QUEUEget(cheques); valor = a -> val; part = a -> part; dest = a -> dest; emp = STsearch(clientes, part); rec = STsearch(clientes, dest); emp -> val_emi -= valor; emp -> num_emi -= 1; rec -> val_rec -= valor; rec -> num_rec -= 1; if (((emp -> num_emi) == 0) && ((emp -> num_rec) == 0)) { STdelete(&clientes, key(emp)); } if (((rec -> num_emi) == 0) && ((rec -> num_rec) == 0)) { STdelete(&clientes, key(rec)); } }
void list_hash(){ fgets(char *hashtag, int hashtag_size, FILE *stdin); if ((STsearch(hashtag))!=NULL) }
int main(int argc, char *argv[]) { int N, i; Item item, itm; Key searched_key = malloc(2 * sizeof(char)), key = malloc(2 * sizeof(char)); char init = 'a'; srand(time(NULL)); if (argc != 2) printf("Insufficient args. Enter N > 4!"); else { N = atoi(argv[1]); if (N > 30) { printf("Enter 4 < value < 30\n"); return 0; } STinit(N); for (i = 0; i < N; i++) { key[0] = init + i; key[1] = '\0'; item = ITEMrand(key); ITEMshow(item); if (i == S) strcpy(searched_key, key); STinsert(item); } printf("\n"); printf("Searching for element with key \'%s\'! ", searched_key); itm = STsearch(searched_key); ITEMshow(itm); printf("Deleting item!\n"); STdelete(itm); printf("Searching for element with key \'%s\'! ", searched_key); ITEMshow(STsearch(searched_key)); } return 0; }
void adiciona_cheque(int valor,long int refe,long int refb,long int refc) { Cliente emp, rec; Cheque a; a = criaCheque(valor,refe,refb,refc); QUEUEput(cheques, a); if (STsearch(clientes, refe) != NULL) { emp = (STsearch(clientes, refe)); emp -> val_emi += valor; emp -> num_emi += 1; } else STinsert(&clientes, criaCliente(refe,1,valor,0,0)); if (STsearch(clientes, refb) != NULL) { rec = (STsearch(clientes, refb)); rec -> val_rec += valor; rec -> num_rec += 1; } else STinsert(&clientes, criaCliente(refb,0,0,1,valor)); }
void printExact(char *word, int detailLevel) { int i; Item item = STsearch(word); printf("Printing %s\n",word); if(item==NULL) { printf("Palavra <%s> nao encontrada.\n", word); } else { for(i=0;i<item->cur;i++) Sentence_print(&sentences[item->indexes[i]], detailLevel); } }
void printAll(char *word, int detailLevel) { int i; Item2 item2; char *lemma; Item item = STsearch(word); if(item == NULL) { printf("Palavra <%s> nao encontrada.\n", word); }else { lemma = item->Lemma; item2 = ST2search(lemma); for(i=0;i<item2->n_words;i++) if(is_word(item2->words[i])) printExact(item2->words[i], detailLevel); } }
void STinsert (Item item) { if(STsearch(key(item)) == NULLitem){ rootNodeLink = insertR (rootNodeLink, item); } }