Esta sección te permite ver todos los mensajes escritos por este usuario. Ten en cuenta que sólo puedes ver los mensajes escritos en zonas a las que tienes acceso en este momento.
SELECT producto, fecha, cantidad FROM (SELECT * FROM tabla ORDER BY fecha DESC) s GROUP BY productoCitarReturns a Set view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's own remove operation, or through the setValue operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via the Iterator.remove, Set.remove, removeAll, retainAll and clear operations. It does not support the add or addAll operations.
FILE * fp = fopen(argv[i], "rb");
char ** contenido;
unsigned long bytes;
cargar_fichero(f, contenido, &bytes);buscar(*ft, cadena, &bytes)#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int buscar(char * ft, char * cadena, unsigned long * bytes);
unsigned long flen(FILE *f);
int cargar_fichero(FILE *f, char *contenido, unsigned long *nbytes);
int main (int argc, char* argv[]){
int i;
FILE * fp;
char * ft;
int a;
unsigned long bytes;
char data[] = {0x0D, 0x0C, 0x0D, 0x0D, 0x03, 0x0D, 0x0D, 0x04, 0x0D, 0x0D, 0x03, 0x0D, 0x0D, 0x04, 0x0D, 0x0D, 0x00};
for(i=1; i < argc; ++i){
fp = fopen(argv[i], "rb");
if(fp != NULL){
if((a=cargar_fichero(fp, ft, &bytes)) == 0)
return -1;
if(buscar(ft, "footnotes.xml", &bytes) == 0)
printf("%s\n", argv[i]);
else{
printf("\n");
fseek ( fp , 0 , SEEK_SET ); //Devolvemos puntero al inicio
if(buscar(ft, data, &bytes) == 0)
printf("%s\n", argv[i]);
}
return 0;
fclose(fp);
}else
printf("No se ha podido abrir el archivo %s", argv[i]);
}
return 0;
}
/*
Busca en el archivo la cadena indicada (imitiendo el \0)
*/
int buscar(char * ft, char * cadena, unsigned long * bytes){
int longi = strlen(cadena);
if(longi < 1)
return -2;
int i=0;
int k=0;
while(i < *bytes){printf("Va bien con c=%x, k=%d\n", ft[i], k);
if(ft[i] == cadena[k]){
k++;
while(k < longi && ++i < *bytes && ft[i] == cadena[k])
k++;
if(k == longi)
return 0;
else if(i >= *bytes){
return -1;
}else{
k=0;
}
}else
++i;
}
return -1;
}
unsigned long flen(FILE *f){
unsigned long pos, len;
pos = ftell(f);
fseek(f , 0 , SEEK_END);
len = ftell(f);
fseek(f , pos , SEEK_SET);
return len;
}
int cargar_fichero(FILE *f, char *contenido, unsigned long *nbytes){
if((contenido = (char*) malloc((*nbytes = flen(f)) * sizeof(char))) == NULL)
return 0;
return fread(contenido , sizeof(char) , (*nbytes/sizeof(char)) , f);
}
int buscar(FILE * fp, char * cadena){
char car;
int longi = strlen(cadena);
if(longi < 1)
return -2;
int i=0;
int k=0;
while((car = fgetc(fp)) != EOF){
if(car == cadena[i]){
k++;
while(i+1<(longi-1) && !feof(fp) && (car=fgetc(fp)) == cadena[++i])
k++;
if(k == longi-1)
return 0;
else if(feof(fp))
return -1;
else
i=k=0;
}
}
return -1;
}| id | total_points |
| 1 | 700 |
| 2 | 500 |
| 3 | 1000 |
| id | type | total_pos |
| 1 | 0 | 2 |
| 2 | 0 | 3 |
| 3 | 0 | 1 |