repo stringlengths 1 152 ⌀ | file stringlengths 14 221 | code stringlengths 501 25k | file_length int64 501 25k | avg_line_length float64 20 99.5 | max_line_length int64 21 134 | extension_type stringclasses 2
values |
|---|---|---|---|---|---|---|
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_geometry/include/polygon_coverage_geometry/tcd.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 1,300 | 37.264706 | 80 | h |
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_geometry/include/polygon_coverage_geometry/visibility_graph.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 4,167 | 38.695238 | 80 | h |
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_geometry/include/polygon_coverage_geometry/test_comm.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 8,336 | 31.566406 | 110 | h |
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_geometry/include/polygon_coverage_geometry/impl/plane_transformation_impl.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 4,416 | 32.210526 | 80 | h |
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_msgs/include/polygon_coverage_msgs/msg_from_xml_rpc.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 4,389 | 37.173913 | 80 | h |
polygon_coverage_planning | polygon_coverage_planning-master/polygon_coverage_msgs/include/polygon_coverage_msgs/conversion.h | /*
* polygon_coverage_planning implements algorithms for coverage planning in
* general polygons with holes. Copyright (C) 2019, Rik Bähnemann, Autonomous
* Systems Lab, ETH Zürich
*
* This program is free software: you can redistribute it and/or modify it under
* the terms of the GNU General Public License as pu... | 1,525 | 38.128205 | 80 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/3.GenerateRandomWords/options.h | /* RANDOM PATTERNS CHOOSER -------------
Given
A file cointaining a given number of words (and /or separators) with their lenght and frequency ...
A value #maxIters
A value #patternsPerIter1, #patternsPerIter2, ..., #patternsPerIterN
Chooses randomly #iters times #patternsPerIter random patterns,... | 1,716 | 37.155556 | 107 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/BufferedReader.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,759 | 29 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/BufferedReader.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 5,322 | 27.31383 | 75 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/MemoryManager.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,872 | 38.902778 | 92 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/MemoryManager.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 4,160 | 33.106557 | 89 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/valstring.h | /* End-Tagged Dense Code. --
A semistatic word-based byte oriented compressor for text files.
Lightweight Natural Language Text Compression: Information Retrieval 2006
Copyright (C) 2005 Antonio Faria.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public Li... | 1,629 | 32.265306 | 78 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/constants.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 1,489 | 32.863636 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/extractor.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 3,333 | 33.020408 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/hash.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 7,777 | 28.800766 | 117 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/valstring.c | /* End-Tagged Dense Code. --
A semistatic word-based byte oriented compressor for text files.
Lightweight Natural Language Text Compression: Information Retrieval 2006
Copyright (C) 2005 Antonio Faria.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public Li... | 1,749 | 27.225806 | 78 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src/hash.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,534 | 31.5 | 85 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/BufferedReader.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,736 | 28.75 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/BufferedReader.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 5,226 | 27.407609 | 75 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/MemoryManager.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,872 | 38.902778 | 92 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/MemoryManager.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 4,160 | 33.106557 | 89 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/valstring.h | /* End-Tagged Dense Code. --
A semistatic word-based byte oriented compressor for text files.
Lightweight Natural Language Text Compression: Information Retrieval 2006
Copyright (C) 2005 Antonio Faria.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public Li... | 1,629 | 32.265306 | 78 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/constants.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 1,489 | 32.863636 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/extractor.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 3,333 | 33.020408 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/hash.c | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 7,777 | 28.800766 | 117 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/valstring.c | /* End-Tagged Dense Code. --
A semistatic word-based byte oriented compressor for text files.
Lightweight Natural Language Text Compression: Information Retrieval 2006
Copyright (C) 2005 Antonio Faria.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public Li... | 1,749 | 27.225806 | 78 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/ExtractorWords/1.Obtain_words_vocab_filtered/src-lt-2gb/hash.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 2,534 | 31.5 | 85 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/extractor.phrases.randLengh/src/defValues.h | #ifndef DEFVALUES_INCLUDED
#define DEFVALUES_INCLUDED
//#define MAX_LEN_VOCABULARY 3000000 //number of different words --> (number of variants)
#define MAX_MEANINGFUL_WORDS 100000000 //number of words (non separators)
#define MAX_SIZE_OF_WORD 1000000 //255 //size of word
#define MAX_SIZE_OF_GAP 1000000 //1000 //... | 1,511 | 28.647059 | 92 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/extractor.phrases.randLengh/src/constants.h | /* Words extractor --
Parses a text file and computes the different words in it.
Then, it applies a filter by frequency of word and/or the lenght
of the words, in such a way that only the "filtered words" are
output to the target file.
This target file is useful since it contains a set of patterns that
can be later ... | 1,554 | 32.085106 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/others/extractor.phrases.randLengh/src/hashStopWords.h | /*-----------------------------------------------------------------------
Hash: Definition of HashTable class (Linear Hash)
------------------------------------------------------------------------*/
#ifndef HASHSTOPWORDSINCLUDED
#define HASHSTOPWORDSINCLUDED
#include <string.h>
#include <stdlib.h>
#include <mat... | 2,296 | 28.448718 | 102 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/linker/interface.h |
/**********************************************************************************
* General interface for using compressed representations of posting lists *
* Any alternative representation must implement all these functions *
*****************************************************************... | 4,017 | 31.666667 | 84 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/linker/build_il.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "interface.h"
/* only for getTime() */
#include <sys/time.h>
#include <sys/resource.h>
/* macro to detect and notify errors */
#define IFERRORIL(error) {{if (error) { fprintf(stderr, "%s\n", error_il(error)); exit(1); }}}
int read_file(char *f... | 3,517 | 24.492754 | 109 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/backup/ilist.h | #include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <string.h>
#include "interfazTextCompressorDocs.h"
#define DELTA_SAMPLING (16)
typedef struct{
void* extractor;
void* doc_array;
unsigned int docs;
unsigned int maxLen... | 3,817 | 29.544 | 83 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/utils.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "utils.h"
/*construction sa*/
/*#include "interface.h"*/
#include "divsufsort.h"
#include "lfs.h"
#include <sys/time.h>
#include <time.h>
struct timeval tv1,tv2;
void startTime(){
gettimeofday(&tv1,NULL);
}
unsigned long end... | 10,869 | 26.518987 | 111 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/treelist.c | #include <stdlib.h>
#include <stdio.h>
#include "treelist.h"
TreeList* newTreeList(){
TreeList* l;
l = (TreeList*)malloc(sizeof(TreeList));
if(l){
l->prev=NULL;
l->next=NULL;
l->left=NULL;
l->right=NULL;
l->val=-1;
}
return l;
}
TreeList* findValue(TreeList* l,int val){
... | 2,390 | 20.93578 | 71 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_bitsequence_builder_brw32.h | /* static_bitsequence_builder_brw32.h
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* static_bitsequence_builder_brw32 definition
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Soft... | 1,499 | 35.585366 | 77 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/lfs.h | /*
* lfs.h for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitat... | 1,689 | 28.649123 | 68 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_bitsequence_brw32.h | /* static_bitsequence_brw32.h
Copyright (C) 2005, Rodrigo Gonzalez, all rights reserved.
New RANK, SELECT, SELECT-NEXT and SPARSE RANK implementations.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Fr... | 2,716 | 33.392405 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/extractor77.h | #ifndef __EXTRACTOR77_H__
#define __EXTRACTOR77_H__
#include "extractor.h"
class Extractor77: public Extractor{
public:
Extractor77(char* filename, unsigned int sampling);
~Extractor77();
virtual unsigned char* extract(unsigned int start, unsigned int end);
protected:
void char... | 577 | 33 | 131 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZend.nuevo.h | #ifndef __LZEND2_H__
#define __LZEND2_H__
#include "LZ77.h"
#include "RMQ.h"
#include "static_permutation.h"
class LZEnd2: public LZparser{
public:
LZEnd2(char* filename);
virtual ~LZEnd2();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 diff... | 1,490 | 32.886364 | 106 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/RMQ_succinct.h | #ifndef _RMQ_succinct_hpp_
#define _RMQ_succinct_hpp_
//#define MEM_COUNT
#include <math.h>
typedef int DT; // use long for 64bit-version (but take care of fast log!)
typedef unsigned int DTidx; // for indexing in arrays
#include <stdlib.h>
#include <limits.h>
#include <iostream>
using namespace... | 2,405 | 21.277778 | 90 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/ilist_interface.h | /**********************************************************************************/
/* General interface for using compressed representations of posting lists *
/* Any alternative representation must implement all these functions *
/******************************************************************... | 4,021 | 32.239669 | 84 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/utils.h | #ifndef __UTILS_H__
#define __UTILS_H__
void startTime();
unsigned long endTime();
unsigned long endTime2();
unsigned char* readText(char* filename,unsigned int* length);
int saveText(unsigned char* text,int length,char* filename);
unsigned int* invertSA(unsigned int* sa,int len);
unsigned int* readArray(char* filenam... | 796 | 40.947368 | 90 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/interfazTextCompressorDocs.h |
/***************************************************************************/
/** Creates a compressed representation of a collection of text documents **/
/***************************************************************************/
/* Creates the [compressed] representation of a collection of text documents
who... | 2,009 | 39.2 | 102 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/deltacodes.h |
#include "basics.h" //*añadido por fari 2013, para get_fieldLL incluido en subclases.
class DeltaCodes{
public:
DeltaCodes(unsigned int* array, unsigned int n, unsigned int sampling);
virtual ~DeltaCodes();
unsigned int select(unsigned int total);
unsigned int rank(unsigned int po... | 1,307 | 38.636364 | 93 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/perm.h | /* perm.h
* Copyright (C) 2005, Diego Arroyuelo, all rights reserved.
*
* Permutation
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at... | 2,191 | 23.629213 | 93 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_permutation_mrrr.h | /* static_permutation_mrrr.h
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* Permutation
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of... | 1,826 | 34.134615 | 97 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZend (copia).h | #ifndef __LZend_H__
#define __LZend_H__
#include "LZ77.h"
#include "RMQ.h"
class LZend: public LZparser{
public:
LZend(char* filename);
virtual ~LZend();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 different files (arrays):
* f... | 1,080 | 29.027778 | 94 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/extractor.h | #ifndef __EXTRACTOR_H__
#define __EXTRACTOR_H__
//#include "basics.h"
//#include "bitmap.h"
#include "deltacodes.h"
#include "basics.h" //*añadido por fari 2013, para get_fieldLL incluido en subclases.
class Extractor{
public:
Extractor(char* filename, unsigned int sampling);//sampling for deltacoding
... | 1,131 | 30.444444 | 123 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_bitsequence_builder.h | /* static_bitsequence_builder.h
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* static_bitsequence_builder definition
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundat... | 1,401 | 36.891892 | 79 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/basics.h | /* basics.h
* Copyright (C) 2005, Rodrigo Gonzalez, all rights reserved.
*
* Some preliminary stuff
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the L... | 9,547 | 30.93311 | 97 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_bitsequence.h | /* static_bitsequence.h
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* static_bitsequence definition
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* v... | 2,716 | 27.6 | 90 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/interface.h | #ifdef __cplusplus
extern "C" {
#endif
/* General interface for using the compressed index libraries */
#ifndef uchar
#define uchar unsigned char
#endif
#ifndef uint
#define uint unsigned int
#endif
#ifndef ulong
#define ulong unsigned long
#endif
/* Error management */
/* Returns a string describing the er... | 3,639 | 34.339806 | 79 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/divsufsort.h | /*
* divsufsort.h for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without ... | 5,442 | 29.071823 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/static_permutation.h | /* static_permutation.h
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* Permutation
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the ... | 1,599 | 31 | 77 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZparser.h | #ifndef __LZPARSER_H__
#define __LZPARSER_H__
#include <cstdio>
class LZparser{
public:
LZparser(char* filename);
virtual ~LZparser();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 different files (arrays):
* filename.start (4*le... | 1,103 | 29.666667 | 103 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZ77_2.h | #ifndef __LZ77_2_H__
#define __LZ77_2_H__
#include "LZparser.h"
#include "RMQ.h"
class LZ77_2: public LZparser{
public:
LZ77_2(char* filename);
virtual ~LZ77_2();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 different files (arrays):
... | 960 | 34.592593 | 107 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZend.h | #ifndef __LZend_H__
#define __LZend_H__
#include "LZ77.h"
#include "RMQ.h"
#include "static_permutation.h"
class LZend: public LZparser{
public:
LZend(char* filename);
virtual ~LZend();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 different... | 1,247 | 30.2 | 94 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/LZ77.h | #ifndef __LZ77_H__
#define __LZ77_H__
#include "LZparser.h"
#include "RMQ.h"
class LZ77: public LZparser{
public:
LZ77(char* filename);
virtual ~LZ77();
/* generates the LZ parsing of filename and returns the number of phrases
* creates 3 different files (arrays):
* fi... | 950 | 34.222222 | 107 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/SAu.c | /* SAu.c
Copyright (C) 2005, Rodrigo Gonzalez, all rights reserved.
This file contains an implementation of Suffix Array in a uncompressed
form.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free S... | 12,316 | 27.185355 | 130 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/helped.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
helped.c
these routines sort a group of strings which have a common prefix
using induced sorting (if possible) or a deep-sort routine
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> */
#include <stdlib.h>
#include <string.h... | 21,838 | 38.137993 | 91 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/suftest2.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
suftest2.c
Written by G. Manzini using the suftest.c code
by N. Jesper Larsson (Copyright N. Jesper Larsson 1999)
Program to test a suffix sorting function. Reads a sequence of bytes from
a file and calls the deep/shallo... | 14,557 | 29.266112 | 79 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/shallow.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
shallow.c
This is the multikey quicksort from bentley-sedgewick modified
so that it stops recursion when depth reaches Shallow_limit
(that is when two or more suffixes have Shallow_limit chars in common).
>>>>>>>>>>>>>>>>>>>>>>>>>>>>... | 17,681 | 30.295575 | 80 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/blind2.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
string sorting routine based on a blind tree
26-jun-01 ver 1.0
03-jul-01 ver 1.1 (get rid of node header)
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> */
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "common.h"
/* ========... | 12,408 | 26.698661 | 78 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/lcp_aux.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
lcp_aux.c
Ver 1.0 28-apr-2004
Functions for lightweight computation of the LCP array.
Copyright (C) 2004 Giovanni Manzini (manzini@mfn.unipmn.it)
This program is free software; you can redistribute it and/or modify
it under the term... | 9,930 | 33.96831 | 77 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/deep2.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
deep.c
"deep" sorting routines
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> */
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include "common.h"
/* ------ external global variables ------- */
extern UChar *Text; ... | 6,736 | 26.72428 | 78 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/unbwt.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
unbwt.c
Ver 1.0 6-oct-02
compute the inverse bwt.
The input file must be in the following format:
(bwt) N bytes + (eof position, LSB first) 4 bytes
The procedure currently uses 5N bytes.
Copyright (C) 2002 Giovanni Manzini ... | 8,673 | 27.162338 | 79 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/ds.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
ds.c
deep-shallow sorting algorithm. these routines are taken mainly by
Seward's d_copyEQ_u12.c
Buckets are sorted one at a time; when bucket Y is completely sorted
(except for YY) "pointer copying" is used to sort small buckets of ... | 9,364 | 30.32107 | 81 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/testlcp.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
testlcp.c
Ver 1.0 9-dec-03
Ver 1.1 28-apr-04 (uses bwt_aux)
Ver 1.2 28-may-04 (uses lcp_aux)
Test algorithms for computing the lcp array.
Copyright (C) 2004 Giovanni Manzini (manzini@mfn.unipmn.it)
This program is fr... | 9,432 | 29.041401 | 79 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/bwt.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
bwt.c
Ver 1.0 14-oct-02
compute the bwt using the ds_ssort routines
The output file has the following format:
(bwt) N bytes + (eof position, LSB first) 4 bytes
Copyright (C) 2002 Giovanni Manzini (manzini@mfn.unipmn.it)
This ... | 7,068 | 29.339056 | 79 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/lcp_aux.h |
// prototypes of the lcp construction procedures defined in
// bwtlcp.a (source files lcp_aux.c lcp5_aux.c)
// before including this file you must first include bwt_aux.h
int *_lcp_sa2lcp_13n(uint8 *t, int n, int *sa);
int *_lcp_sa2lcp_9125n(uint8 *t, int n, int *sa);
int *_lcp_sa2lcp_9n(uint8 *t, int n, int *sa, int... | 512 | 35.642857 | 62 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/common.h | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
global defintion for the ds suffix-sort algorithm
Giovanni Manzini
2-apr 2001
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> */
/* ----------- use assertion if DEBUG!=0 ------------- */
#ifndef DEBUG
#define DEBUG 1 /* set DEBUG to 0 to remove ... | 1,434 | 23.322034 | 76 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/globals.c | /* *******************************************************************
globals.c
Ver 1.0 14-oct-02
This file contains the definition of the global variables
which can be defined by the user + some relate procedures
******************************************************************* */
#include <stdio.... | 3,873 | 28.12782 | 80 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/bwt_aux.c | /* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
bwt_aux.c
Ver 1.0 3-mar-2004
Functions for computing and transforming various representations
of text and suffix array: t/sa/rank_next/rank_prev/bwt
Copyright (C) 2002 Giovanni Manzini (manzini@mfn.unipmn.it)
This program is free so... | 9,373 | 26.014409 | 77 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/src/sa/ds/bwt_aux.h | #define _BW_ALPHA_SIZE 256
typedef unsigned char uchar;
typedef unsigned char uint8;
typedef int int32;
// ---- struct containing the (uncompressed) bwt
typedef struct {
uchar *bwt;
int size;
int eof_pos;
} bwt_data;
// prototypes of bwt procedures defined in bwtlcp.a
void _bw_sa2bwt(uchar *t, int32 n, int3... | 912 | 31.607143 | 78 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/examples/mksary.c | /*
* mksary.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limi... | 5,309 | 26.371134 | 83 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/examples/unbwt.c | /*
* unbwt.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limit... | 5,667 | 26.25 | 79 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/examples/suftest.c | /*
* suftest.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without lim... | 4,506 | 26.315152 | 83 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/examples/sasearch.c | /*
* sasearch.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without li... | 4,424 | 25.656627 | 77 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/examples/bwt.c | /*
* bwt.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitat... | 6,248 | 27.276018 | 86 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/lib/utils.c | /*
* utils.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limit... | 9,862 | 24.819372 | 83 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/lib/sssort.c | /*
* sssort.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limi... | 24,117 | 28.556373 | 89 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/lib/trsort.c | /*
* trsort.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limi... | 17,794 | 29.315162 | 88 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/lib/divsufsort.c | /*
* divsufsort.c for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without ... | 12,257 | 27.910377 | 83 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/include/config.h | /* include/config.h. Generated from config.h.in by configure. */
/* include/config.h.in. Generated from configure.ac by autoheader. */
/* Define to 1 if you have the <dlfcn.h> header file. */
#define HAVE_DLFCN_H 1
/* Define to 1 if you have the <fcntl.h> header file. */
#define HAVE_FCNTL_H 1
/* Define to 1 if ... | 3,745 | 26.955224 | 78 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/include/lfs.h | /*
* lfs.h for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitat... | 1,689 | 28.649123 | 68 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/include/divsufsort.h | /*
* divsufsort.h for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without ... | 5,442 | 29.071823 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/555.lzendFari.Sebas/libdivsufsort-2.0.1/include/divsufsort_private.h | /*
* divsufsort_private.h for libdivsufsort
* Copyright (c) 2003-2008 Yuta Mori All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including ... | 5,672 | 26.274038 | 75 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/linker/interface.h |
/**********************************************************************************/
/* General interface for using compressed representations of posting lists */
/* Any alternative representation must implement all these functions */
/**************************************************************... | 4,023 | 31.715447 | 84 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/linker/farilzma.h | #ifndef LZMA_API_INCLUDED
#define LZMA_API_INCLUDED
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#ifndef uchar
#define uchar unsigned char
#endif
/******************************************************************************/
/* Public functions */
/******************************... | 2,428 | 31.824324 | 89 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/linker/build_il.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "interface.h"
/* only for getTime() */
#include <sys/time.h>
#include <sys/resource.h>
/* macro to detect and notify errors */
#define IFERRORIL(error) {{if (error) { fprintf(stderr, "%s\n", error_il(error)); exit(1); }}}
int read_file(char *f... | 3,566 | 24.661871 | 109 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/interface.h |
/**********************************************************************************/
/* General interface for using compressed representations of posting lists */
/* Any alternative representation must implement all these functions */
/**************************************************************... | 4,023 | 31.715447 | 84 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/farilzma.h | #ifndef LZMA_API_INCLUDED
#define LZMA_API_INCLUDED
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#ifndef uchar
#define uchar unsigned char
#endif
/******************************************************************************/
/* Public functions */
/******************************... | 2,428 | 31.824324 | 89 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/ilspire07.h | /* only for getTime() */
#include <sys/time.h>
#include <sys/resource.h>
#include <sys/types.h>
#include <unistd.h> //fork
#include <sys/types.h>
#include <sys/wait.h>
#include <sys/sysinfo.h> //to obtain number of cores
#include "utils/basics.h"
#include "utils/sort_alg.h"
//#include "utils/fileInfo.h"
#incl... | 6,614 | 37.017241 | 107 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/utils/bitrankw32int.h | /* bitarray.h
Copyright (C) 2005, Rodrigo Gonzalez, all rights reserved.
New RANK, SELECT, SELECT-NEXT and SPARSE RANK implementations.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foun... | 2,030 | 28.867647 | 88 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/utils/basics.h |
// Basics
#ifndef BASICSINCLUDED
#define BASICSINCLUDED
// Includes
#include <sys/types.h>
#include <stdio.h>
#include <fcntl.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <sys/times.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
// Memory management
#define malloc(n) Malloc(n)
#defi... | 2,571 | 21.964286 | 61 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/utils/sort_alg.c | #include "sort_alg.h"
/** sorting a uint-vector ascending, (O(n^2)) but valid as n<< **/
int simplesortAsc(tsort *V, uint n) {
register int i,j;
register uint min,tmp;
for (i=0; i< n-1;i++) {
min =i;
for (j=i+1;j<n;j++) {
if ( V[min].key > V[j].key ) min = j;
}
tmp =V[i].key; V[i].key=V[min].key; V... | 1,741 | 21.921053 | 69 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/ilists/ilerrors.c |
/*////////////////
//Error handling//
////////////////*/
/*
char *error_il(int e){
switch(e) {
case 0: return "No error"; break;
case 1: return "Out of memory"; break;
case 30: return "Error reading source posting lists";break;
case 31: return "Empty Source list or incomplete !!";break;
case 40: retu... | 2,558 | 38.369231 | 83 | c |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/ilists/bc.h |
#define OFFSET_LOWEST_VALUE (1)
//#define OFFSET_LOWEST_VALUE (1) //AS "ZERO" IS NEVER ENCODED... value OFFSET_LOWEST_VALUE will
//will be encoded as "0"... OFFSET_LOWEST_VALUE +1 as "1", etc.
//const unsigned long TABLABASE[5] = {0,128,16512,2113664,270549120};
////decoding for ETDC
//uint decode ... | 3,054 | 31.849462 | 106 | h |
uiHRDC | uiHRDC-master/uiHRDC/indexes/NOPOS/II_docs_large/ilists.imp/6.vbyteP7zip_acabadoMerge2yN[Fork]/src/ilists/ildatatypes.h |
#ifndef DATA_TYPES_IL_INCLUDED
#define DATA_TYPES_IL_INCLUDED
typedef struct{
int (*defaultFsearch) (void *ail, uint id, uint value);
int (*defaultIntersect2) (void *ail, uint id1, uint id2, uint *noccs, uint **occs );
int (*defaultIntersectN) (void *ail, uint *ids, uint nids, uint *noccs, uint **occs );
... | 1,518 | 32.021739 | 103 | h |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.