Error compiling the first example code of FreeLing (C++) - c++
I've installed 'freeling-4.2-focal-amd64.deb' on 'Linux Mint 20.3 Cinnamon' and also all the dependencies mentioned here:
https://freeling-user-manual.readthedocs.io/en/v4.2/installation/requirements-linux/#install-dependencies
I tried to compile the first example code from here:
Explanation: https://freeling-tutorial.readthedocs.io/en/latest/example01/
Code: https://freeling-tutorial.readthedocs.io/en/latest/code/example01.cc/
The following Error message appeared while compiling:
FAILED: CMakeFiles/test_freeling.dir/main.cpp.o
/usr/bin/c++ -g -std=gnu++14 -MD -MT CMakeFiles/test_freeling.dir/main.cpp.o -MF CMakeFiles/test_freeling.dir/main.cpp.o.d -o CMakeFiles/test_freeling.dir/main.cpp.o -c /home/ben/Schreibtisch/Bachelor_Projekt/test_freeling/main.cpp
In file included from /usr/include/freeling/morfo/idioma.h:45,
from /usr/include/freeling/morfo/lang_ident.h:44,
from /usr/include/freeling.h:35,
from /home/ben/desktop/Projekt/test_freeling/main.cpp:2:
/usr/include/freeling/morfo/smoothingLD.h: In constructor ‘freeling::smoothingLD<G, E>::smoothingLD(const wstring&, const std::map<std::__cxx11::basic_string<wchar_t>, E>&)’:
/usr/include/freeling/morfo/smoothingLD.h:129:73: error: there are no arguments to ‘log’ that depend on a template parameter, so a declaration of ‘log’ must be available [-fpermissive]
129 | if (name==L"LinearDiscountAlpha") { double a; sin>>a; alpha = log(a); notalpha=log(1-a); }
| ^~~
/usr/include/freeling/morfo/smoothingLD.h:129:73: note: (if you use ‘-fpermissive’, G++ will accept your code, but allowing the use of an undeclared name is deprecated)
/usr/include/freeling/morfo/smoothingLD.h:129:90: error: there are no arguments to ‘log’ that depend on a template parameter, so a declaration of ‘log’ must be available [-fpermissive]
129 | if (name==L"LinearDiscountAlpha") { double a; sin>>a; alpha = log(a); notalpha=log(1-a); }
| ^~~
/usr/include/freeling/morfo/smoothingLD.h:179:18: error: there are no arguments to ‘log’ that depend on a template parameter, so a declaration of ‘log’ must be available [-fpermissive]
179 | pUnseen = -log(vsize-ntypes); // log version of 1/(vsize-ntypes)
| ^~~
/usr/include/freeling/morfo/smoothingLD.h:180:14: error: there are no arguments to ‘log’ that depend on a template parameter, so a declaration of ‘log’ must be available [-fpermissive]
180 | nobs = log(nobs);
| ^~~
Here is the corresponding source code:
////////////////////////////////////////////////////////////////
//
// FreeLing - Open Source Language Analyzers
//
// Copyright (C) 2014 TALP Research Center
// Universitat Politecnica de Catalunya
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Affero General Public
// License as published by the Free Software Foundation; either
// version 3 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// contact: Lluis Padro (padro#lsi.upc.es)
// TALP Research Center
// despatx C6.212 - Campus Nord UPC
// 08034 Barcelona. SPAIN
//
////////////////////////////////////////////////////////////////
#ifndef _SMOOTHING_LD
#define _SMOOTHING_LD
#include "freeling/morfo/traces.h"
#include "freeling/morfo/util.h"
#include "freeling/morfo/configfile.h"
#undef MOD_TRACENAME
#define MOD_TRACENAME L"SMOOTHING"
#undef MOD_TRACEMODULE
#define MOD_TRACEMODULE LANGIDENT_TRACE
namespace freeling {
///////////////////////////////////////////////////////////////
/// Class smoothingLD computes linear-discount smoothed conditional
/// probabilities P(z|w1...wn) for n-gram transitions.
///
/// template parameters:
/// - E is the type of the ngram elements (e.g. char, int, string, etc.)
/// - G is the type containing the ngram (e.g. string, list<int>, vector<string>, etc.)
/// Elements of G must be of type E.
/// G must have operations push_back(E), erase(G::iterator), and begin()
///////////////////////////////////////////////////////////////
template <class G,class E>
class smoothingLD {
private:
/// log alpha and 1-alpha parameter for linear discount
double alpha;
double notalpha;
/// map to store ngram counts (for any size of ngram)
std::map<G,double> counts;
// probability of unseen unigrams
double pUnseen;
// total number of observations
double nobs;
/// order of the n-gram model. Order=3 => trigram model P(z|xy)
size_t order;
/// translation table for escaped symbols in input (e.g. \s, \n, \t...)
std::map<std::wstring,E> escapes;
//////////////////////////////////////////
// Get observed counts for given ngram
double count(const G &ngram) const {
typename std::map<G, double>::const_iterator p = counts.find(ngram);
if (p!=counts.end()) return p->second;
else return -1;
}
public:
//////////////////////////////////////////
/// Constructor, load data from config file
smoothingLD(const std::wstring &cfgFile,
const std::map<std::wstring,E> &esc=std::map<std::wstring,E>()) : escapes(esc) {
double ntypes=0;
double vsize=0;
nobs=0;
order=0;
enum sections {ORDER,NGRAMS,SMOOTHING};
config_file cfg(true);
cfg.add_section(L"Order",ORDER,true);
cfg.add_section(L"NGrams",NGRAMS,true);
cfg.add_section(L"Smoothing",SMOOTHING,true);
if (not cfg.open(cfgFile))
ERROR_CRASH(L"Error opening file "+cfgFile);
std::wstring line;
while (cfg.get_content_line(line)) {
std::wistringstream sin;
sin.str(line);
// process each content line according to the section where it is found
switch (cfg.get_section()) {
case ORDER: {// read order of ngram model
std::wistringstream sin;
sin.str(line);
size_t x; sin>>x;
if (order!=0 and order!=x)
ERROR_CRASH(L"ERROR - Specified model order does not match ngram size");
order = x;
break;
}
case SMOOTHING: { // reading general parameters
std::wstring name;
sin>>name;
if (name==L"LinearDiscountAlpha") { double a; sin>>a; alpha = log(a); notalpha=log(1-a); }
else if (name==L"VocabularySize") sin>>vsize;
else ERROR_CRASH(L"Unexpected smoothing option '"+name+L"'");
break;
}
case NGRAMS: { // reading ngram counts
// read counts for this ngram to table
double c; sin >> c;
// read ngram components into a G object.
G ngram;
std::wstring w;
while (sin >> w) {
typename std::map<std::wstring,E>::const_iterator p=escapes.find(w);
if (p!=escapes.end())
ngram.push_back(p->second);
else
ngram.push_back(util::wstring_to<E>(w));
}
if (order==0) order = ngram.size();
else if (order != ngram.size())
ERROR_CRASH(L"ERROR - Mixed order ngrams in input file, or specified model order does not match ngram size");
// add ngram (and n-i gram) counts to the model
while (ngram.size()>1) {
// insert ngram count, or increase if it already existed
std::pair<typename std::map<G,double>::iterator,bool> x = counts.insert(make_pair(ngram,c));
if (not x.second) x.first->second += c;
// shorten n gram and loop to insert n-1 gram
ngram.erase(std::prev(ngram.end()));
}
// unigram is left. Add it
std::pair<typename std::map<G,double>::iterator,bool> x = counts.insert(make_pair(ngram,c));
if (x.second) ntypes++; // new unigram inserted, increase type count
else x.first->second += c; // existing unigram, increase count
// update total observation counts
nobs += c;
break;
}
default: break;
}
}
cfg.close();
// precompute logs needed for logprob
if (vsize<=ntypes)
ERROR_CRASH(L"VocabularySize can not be smaller than number of different observed unigrams.");
pUnseen = -log(vsize-ntypes); // log version of 1/(vsize-ntypes)
nobs = log(nobs);
for (typename std::map<G,double>::iterator c=counts.begin(); c!=counts.end(); c++)
c->second = log(c->second);
}
//////////////////////////////////////////
/// destructor
~smoothingLD() {}
//////////////////////////////////////////
/// Compute smoothed conditional log prob of seeing
/// symbol z following given ngram P(z|ngram)
double Prob(const G &ngram, const E &z) const {
// seq = n+1 gram ( ngram + z )
G seq = ngram;
seq.push_back(z);
// log count of complete ngram
double c = count(seq);
if (ngram.size()==0) {
// no conditioning history, use unigrams (seq = [z])
if (c>=0) return notalpha + c - nobs; // log version of (1-alpha)*count(c)/nobs
else return alpha + pUnseen; // log version of alpha * punseen
}
else {
// conditioning history, use LD smoothing
if (c>=0) return notalpha + c - count(ngram); // log version of (1-alpha)*count(c)/count(ngram)
else {
// shorten history and recurse
G sht = ngram; sht.erase(sht.begin());
return alpha + Prob(sht,z); // log version of alpha * Prob(sht,z)
}
}
}
};
} // namespace
#undef MOD_TRACENAME
#undef MOD_TRACECODE
#endif
Why isn't log recognized in this file of the lib and what can I do about it?
It seems the library has not included the proper header file (<cmath>) and that it's using std::log as-if it is guaranteed to be available as log.
I suggest that you try to get the providers of FreeLing to update the library and while waiting for them to fix the issues, you can try to do this:
#include <cmath>
using std::log;
before including any of the FreeLing headers in your own code.
Related
GCC Plugin: Is it possible to move a sequence of a basic block of one function to a basic block of another function?
I'm trying to create a plugin for gcc that allows you to instrument the prologue and the epilogue of a function. The instrumentation code is inserted in two functions "instrument_entry" and "instrument_exit". These two functions are written in a file called instrumentation.h, which is included in the source code of the software I want to instrument. in a nutshell, it's very similar to the -finstrument-function of gcc Unlike the option provided by gcc, through the plugin, I would like to take the code present in the function "instrument_entry" (I checked and this function contains only one basic block) and insert it in all other prologues of the functions present in the software. I thought to take the sequence present in the basic block of the function "instrument_entry" and insert it in the first basic block of the function to be instrumented. This is the code: static basic_block bb_entry_instr; static unsigned int instrument_functions(function *fun){ std::string func_name = function_name(fun); if(func_name == "instrument_entry"){ basic_block bb; bb = ENTRY_BLOCK_PTR_FOR_FN(fun); bb = bb->next_bb; bb_entry_instr = bb; std::cout << "Instrumentation code found! " << std::endl; } if(func_name != "instrument_entry" && func_name != "instrument_exit"){ basic_block bb; bb = ENTRY_BLOCK_PTR_FOR_FN(fun); bb = bb->next_bb; gimple_stmt_iterator gsi = gsi_start_bb(bb); gsi_insert_seq_before(&gsi, bb_seq(bb_entry_instr), GSI_NEW_STMT); } } // end of instrument_functions() bb_entry_instr is the basic block of the "instrument_entry" function The pass I created for gcc is called after the "cfg" pass: namespace { const pass_data instrumentation_pass_data = { GIMPLE_PASS, "instr_pass2", /* name */ OPTGROUP_NONE, /* optinfo_flags */ TV_NONE, /* tv_id */ PROP_gimple_any, /* properties_required */ 0, /* properties_provided */ 0, /* properties_destroyed */ 0, /* todo_flags_start */ 0 /* todo_flags_finish */ }; struct instrumentation_pass : gimple_opt_pass { instrumentation_pass(gcc::context *ctx) : gimple_opt_pass(instrumentation_pass_data, ctx){} unsigned int execute(function *fun) { return instrument_functions(fun); } }; } int plugin_init(struct plugin_name_args *plugin_info, struct plugin_gcc_version *version){ ... // plugin_default_version_check struct register_pass_info instr_pass_info; instr_pass_info.pass = new instrumentation_pass(g); instr_pass_info.reference_pass_name = "cfg"; instr_pass_info.ref_pass_instance_number = 1; instr_pass_info.pos_op = PASS_POS_INSERT_AFTER; } register_callback(plugin_info->base_name, PLUGIN_PASS_MANAGER_SETUP, NULL, &instr_pass_info); When I try to compile a test program with the plugin, I get this error: during RTL pass: expand test_01.c: In function ‘instrument_entry’: test_01.c:13:9: internal compiler error: in get_rtx_for_ssa_name, at tree-outof-ssa.h:62 13 | fgets(name, 0xff, stdin); | ^~~~~~~~~~~~~~~~~~~~~~~~ Please submit a full bug report, with preprocessed source if appropriate. See <file:///usr/share/doc/gcc-9/README.Bugs> for instructions. make: *** [Makefile:14: test] Error 1 Can somebody help me?
Is there an equivalent for Glob in D Phobos?
In python I can use glob to search path patterns. This for instance: import glob for entry in glob.glob("/usr/*/python*"): print(entry) Would print this: /usr/share/python3 /usr/share/python3-plainbox /usr/share/python /usr/share/python-apt /usr/include/python3.5m /usr/bin/python3 /usr/bin/python3m /usr/bin/python2.7 /usr/bin/python /usr/bin/python3.5 /usr/bin/python3.5m /usr/bin/python2 /usr/lib/python3 /usr/lib/python2.7 /usr/lib/python3.5 How would I glob or make a glob equivalent in in D? ------Updated on Sep 12 2017------ I wrote a small D module to do Glob in D: https://github.com/workhorsy/d-glob
If you only work on a Posix system, you can directly call glob.h. Here's a simple example that shows how easy it is to interface with the Posix API: void main() { import std.stdio; import glob : glob; foreach(entry; glob("/usr/*/python*")) writeln(entry); } You can compile this e.g. with rdmd main.d (rdmd does simple dependency management) or dmd main.d glob.d and it yields a similar output as yours on my machine. glob.d was generated by dstep and is enhanced with a convenience D-style wrapper (first function). Please note that this isn't perfect and a better way would be to expose a range API instead of allocating the entire array. /* Copyright (C) 1991-2016 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C 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 your option) any later version. The GNU C Library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, see <http://www.gnu.org/licenses/>. */ string[] glob(string pattern) { import std.string; string[] results; glob_t glob_result; glob(pattern.toStringz, 0, null, &glob_result); for (uint i = 0; i < glob_result.gl_pathc; i++) { results ~= glob_result.gl_pathv[i].fromStringz().idup; } globfree(&glob_result); return results; } import core.stdc.config; extern (C): enum _GLOB_H = 1; /* We need `size_t' for the following definitions. */ alias c_ulong __size_t; alias c_ulong size_t; /* The GNU CC stddef.h version defines __size_t as empty. We need a real definition. */ /* Bits set in the FLAGS argument to `glob'. */ enum GLOB_ERR = 1 << 0; /* Return on read errors. */ enum GLOB_MARK = 1 << 1; /* Append a slash to each name. */ enum GLOB_NOSORT = 1 << 2; /* Don't sort the names. */ enum GLOB_DOOFFS = 1 << 3; /* Insert PGLOB->gl_offs NULLs. */ enum GLOB_NOCHECK = 1 << 4; /* If nothing matches, return the pattern. */ enum GLOB_APPEND = 1 << 5; /* Append to results of a previous call. */ enum GLOB_NOESCAPE = 1 << 6; /* Backslashes don't quote metacharacters. */ enum GLOB_PERIOD = 1 << 7; /* Leading `.' can be matched by metachars. */ enum GLOB_MAGCHAR = 1 << 8; /* Set in gl_flags if any metachars seen. */ enum GLOB_ALTDIRFUNC = 1 << 9; /* Use gl_opendir et al functions. */ enum GLOB_BRACE = 1 << 10; /* Expand "{a,b}" to "a" "b". */ enum GLOB_NOMAGIC = 1 << 11; /* If no magic chars, return the pattern. */ enum GLOB_TILDE = 1 << 12; /* Expand ~user and ~ to home directories. */ enum GLOB_ONLYDIR = 1 << 13; /* Match only directories. */ enum GLOB_TILDE_CHECK = 1 << 14; /* Like GLOB_TILDE but return an error if the user name is not available. */ enum __GLOB_FLAGS = GLOB_ERR | GLOB_MARK | GLOB_NOSORT | GLOB_DOOFFS | GLOB_NOESCAPE | GLOB_NOCHECK | GLOB_APPEND | GLOB_PERIOD | GLOB_ALTDIRFUNC | GLOB_BRACE | GLOB_NOMAGIC | GLOB_TILDE | GLOB_ONLYDIR | GLOB_TILDE_CHECK; /* Error returns from `glob'. */ enum GLOB_NOSPACE = 1; /* Ran out of memory. */ enum GLOB_ABORTED = 2; /* Read error. */ enum GLOB_NOMATCH = 3; /* No matches found. */ enum GLOB_NOSYS = 4; /* Not implemented. */ /* Previous versions of this file defined GLOB_ABEND instead of GLOB_ABORTED. Provide a compatibility definition here. */ /* Structure describing a globbing run. */ struct glob_t { __size_t gl_pathc; /* Count of paths matched by the pattern. */ char** gl_pathv; /* List of matched pathnames. */ __size_t gl_offs; /* Slots to reserve in `gl_pathv'. */ int gl_flags; /* Set to FLAGS, maybe | GLOB_MAGCHAR. */ /* If the GLOB_ALTDIRFUNC flag is set, the following functions are used instead of the normal file access functions. */ void function (void*) gl_closedir; void* function (void*) gl_readdir; void* function (const(char)*) gl_opendir; int function (const(char)*, void*) gl_lstat; int function (const(char)*, void*) gl_stat; } /* If the GLOB_ALTDIRFUNC flag is set, the following functions are used instead of the normal file access functions. */ /* Do glob searching for PATTERN, placing results in PGLOB. The bits defined above may be set in FLAGS. If a directory cannot be opened or read and ERRFUNC is not nil, it is called with the pathname that caused the error, and the `errno' value from the failing call; if it returns non-zero `glob' returns GLOB_ABEND; if it returns zero, the error is ignored. If memory cannot be allocated for PGLOB, GLOB_NOSPACE is returned. Otherwise, `glob' returns zero. */ int glob ( const(char)* __pattern, int __flags, int function (const(char)*, int) __errfunc, glob_t* __pglob); /* Free storage allocated in PGLOB by a previous `glob' call. */ void globfree (glob_t* __pglob);
None of the answers above worked 100% the same as Glob on Windows and Linux. So I made a small D module that does Glob the right way. Hopefully people find it useful: https://github.com/workhorsy/d-glob import std.stdio : stdout; import glob : glob; foreach (entry ; glob("/usr/*/python*")) { stdout.writefln("%s", entry); }
Maybe you are looking for std.file.dirEntries(). Here's example from the documentation: // Iterate over all D source files in current directory and all its // subdirectories auto dFiles = dirEntries("","*.{d,di}",SpanMode.depth); foreach(d; dFiles) writeln(d.name);
Basically you don't need to do all this complicated stuff with headers, C and so on, and so forth. This should do the thing: auto dirIter = dirEntries("/usr", "*/python*", SpanMode.shallow); foreach(dirFile; dirIter) { // Process the result as needed
GNU Radio: How to define a "get_*" method inside a sink block
I'd like to code my own sink block with 1 input port and 0 output ports for GNU Radio in C++. I read and followed the steps described here: http://gnuradio.org/redmine/projects/gnuradio/wiki/BlocksCodingGuide http://gnuradio.org/redmine/projects/gnuradio/wiki/OutOfTreeModules http://gnuradio.org/redmine/projects/gnuradio/wiki/OutOfTreeModulesConfig http://gnuradio.org/redmine/projects/gnuradio/wiki/Guided_Tutorial_GNU_Radio_in_C++ I'm using Ubuntu 14.04.3 LTS Eclipse 4.5.1 CDT 8.8.0.201509131935 GNU Radio 3.7.8 Using gr_modtool I created the new module "jammertrap". Inside it, I created the block "bandpower". This created among others the three files bandpower.h inside /home/sdr/gnuradio/gr-jammertrap/include/jammertrap/ bandpower_impl.h inside /home/sdr/gnuradio/gr-jammertrap/lib/ bandpower_impl.cc inside /home/sdr/gnuradio/gr-jammertrap/lib/ bandpower.h: #ifndef INCLUDED_JAMMERTRAP_BANDPOWER_H #define INCLUDED_JAMMERTRAP_BANDPOWER_H #include <jammertrap/api.h> #include <gnuradio/block.h> namespace gr { namespace jammertrap { class JAMMERTRAP_API bandpower : virtual public gr::block { public: typedef boost::shared_ptr<bandpower> sptr; // Return a shared_ptr to a new instance of jammertrap::bandpower. // To avoid accidental use of raw pointers, jammertrap::bandpower's constructor is in a private implementation class. // jammertrap::bandpower::make is the public interface for creating new instances. static sptr make(); }; } // namespace jammertrap } // namespace gr #endif /* INCLUDED_JAMMERTRAP_BANDPOWER_H */ bandpower_impl.h: #ifndef INCLUDED_JAMMERTRAP_BANDPOWER_IMPL_H #define INCLUDED_JAMMERTRAP_BANDPOWER_IMPL_H #include <jammertrap/bandpower.h> namespace gr { namespace jammertrap { class bandpower_impl : public bandpower { private: double d_bandpower_; public: bandpower_impl(); ~bandpower_impl(); void forecast (int noutput_items, gr_vector_int &ninput_items_required); // Where all the action really happens int general_work(int noutput_items, gr_vector_int &ninput_items, gr_vector_const_void_star &input_items); // Returns the calculated RMS Bandpower double get_bandpower(); }; } // namespace jammertrap } // namespace gr #endif /* INCLUDED_JAMMERTRAP_BANDPOWER_IMPL_H */ bandpower_impl.cc: #ifdef HAVE_CONFIG_H #include "config.h" #endif #include <gnuradio/io_signature.h> #include "bandpower_impl.h" namespace gr { namespace jammertrap { bandpower::sptr bandpower::make() { return gnuradio::get_initial_sptr (new bandpower_impl()); } // The private constructor bandpower_impl::bandpower_impl() : gr::block("bandpower", gr::io_signature::make(1, 1, sizeof(gr_complex)), gr::io_signature::make(0, 0, 0)) { d_bandpower_ = 0; } // Our virtual destructor bandpower_impl::~bandpower_impl() {} void bandpower_impl::forecast(int noutput_items, gr_vector_int &ninput_items_required) { // ninput_items_required[0] = noutput_items; } int bandpower_impl::general_work(int noutput_items, gr_vector_int &ninput_items, gr_vector_const_void_star &input_items) { const gr_complex *in = (const gr_complex *) input_items[0]; d_bandpower_ = 0; for(int i = 0; i < noutput_items; i++) { d_bandpower_ += (in[i].real() * in[i].real()) + (in[i].imag() * in[i].imag()); } d_bandpower_ = sqrt(d_bandpower_ / noutput_items); // Tell runtime system how many input items we consumed on each input stream. consume_each (noutput_items); // Tell runtime system how many output items we produced return noutput_items; } double bandpower_impl::get_bandpower() { return d_bandpower_; } } /* namespace jammertrap */ } /* namespace gr */ To make and install this new block, I entered the following commands inside /home/sdr/gnuradio/gr-jammertrap/build: cmake ../ make make test // Result: "test_jammertrap" and "qa_bandpower" passed successful sudo make install This sink block "bandpower" should receive items of type gr_complex, compute the average received power and store this value inside the private member "d_bandpower_". Additional I defined the method "get_bandpower()" to get the stored value. Inside another program, I created a flowgraph class with the two blocks osmosdr::source:sptr osmosdr_source_; gr::jammertrap::bandpower::sptr bandpower_measurement_; and instanced them with osmosdr_source_ = osmosdr::source::make(std::string()); bandpower_measurement_ = gr::jammertrap::bandpower::make(); After starting the flowgraph, I want to read the calculated bandpower by calling get_bandpower() but Eclipse shows no method "bandpower_measurement_->get_bandpower()" What have I forgotten to write inside bandpower.h, bandpower_impl.h or bandpower_impl.cc?
The public API of the normal OOT layout is in the bandpower.h, so you must add a virtual double get_bandpower() = 0; in that file. Then, you overload/implement that, like you do, in the _impl.cc/_impl.h. By the way, I slightly object the math behind your implementation: as noutput_items, ie. the number of input items available, changes depending on buffer fillage / runtime behaviour, your "averaging length" is not constant, which means that if your flow graph runs fast, your buffers will usually be full, and your averaging length high, whilst in a "trickle" situation, the length will be much smaller (down to noutput_items==1, in extreme cases). Hence, the variance of your power estimator will depend on computational aspects. That's not a good thing. Better work with a constant number of items you average about. In your case, you can use set_output_multiple (because a sink is also a sync block, this also affects the input multiples) to guarantee you always get a multiple of a fixed number. Other than that, there's already blocks that can do what you want: Probe Avg Mag²: has a method level() which does the same as your get_bandpower (aside from the √(.) ) Complex to Mag ⟶ Decimating FIR Filter ⟶ Probe Signal: does the √(Re²+Im²), before passing it on to a filter with 123 (that was just my arbitrary fixed length) taps of 1/length, and decimating it to one value every average. Result get send to the Signal Probe, which has a signal() method, which does what your get_bandpower does. CPU load of this is relatively small -- it's really just the magnitude finding for every sample, and then 123 real multiplications + 123 real additions per 123 samples,in the filter, all SIMD increased, so basically, less than 1 FMAC per sample. Complex to Mag ⟶ Moving Average ⟶ Probe Signal: Names say it all. Nothing magical here.
Import CSV into Vertica using Rfc4180CsvParser and exclude header row
Is there a way to exclude the header row when importing data via the Rfc4180CsvParser? The COPY command has a SKIP option but the option doesn't seem to work when using the CSV parsers provided in the Vertica SDK. Background As background, the COPY command does not read CSV files by itself. For simple CSV files, one can say COPY schema.table FROM '/data/myfile.csv' DELIMITER ',' ENCLOSED BY '"'; but this will fail with data files which have string values with embedded quotes. Adding ESCAPE AS '"' will generate an error ERROR 3169: ENCLOSED BY and ESCAPE AS can not be the same value . This is a problem as CSV values are enclosed and escaped by ". Vertica SDK CsvParser extensions to the rescue Vertica provides an SDK under /opt/vertica/sdk/examples with C++ programs that can be compiled into extensions. One of these is /opt/vertica/sdk/examples/ParserFunctions/Rfc4180CsvParser.cpp. This works great as follows: cd /opt/vertica/sdk/examples make clean vsql ==> CREATE LIBRARY Rfc4180CsvParserLib AS '/opt/vertica/sdk/examples/build/Rfc4180CsvParser.so'; ==> COPY myschema.mytable FROM '/data/myfile.csv' WITH PARSER Rfc4180CsvParser(); Problem The above works great except that it imports the first row of the data file as a row. The COPY command has a SKIP 1 option but this does not work with the parser. Question Is it possble to edit Rfc4180CsvParser.cpp to skip the first row, or better yet, take some parameter to specify number of rows to skip? The program is just 135 lines but I don't see where/how to make this incision. Hints? Copying the entire program below as I don't see a public repo to link to... Rfc4180CsvParser.cpp /* Copyright (c) 2005 - 2012 Vertica, an HP company -*- C++ -*- */ #include "Vertica.h" #include "StringParsers.h" #include "csv.h" using namespace Vertica; // Note, the class template is mostly for demonstration purposes, // so that the same class can use each of two string-parsers. // Custom parsers can also just pick a string-parser to use. /** * A parser that parses something approximating the "official" CSV format * as defined in IETF RFC-4180: <http://tools.ietf.org/html/rfc4180> * Oddly enough, many "CSV" files don't actually conform to this standard * for one reason or another. But for sources that do, this parser should * be able to handle the data. * Note that the CSV format does not specify how to handle different * data types; it is entirely a string-based format. * So we just use standard parsers based on the corresponding column type. */ template <class StringParsersImpl> class LibCSVParser : public UDParser { public: LibCSVParser() : colNum(0) {} // Keep a copy of the information about each column. // Note that Vertica doesn't let us safely keep a reference to // the internal copy of this data structure that it shows us. // But keeping a copy is fine. SizedColumnTypes colInfo; // An instance of the class containing the methods that we're // using to parse strings to the various relevant data types StringParsersImpl sp; /// Current column index size_t colNum; /// Parsing state for libcsv struct csv_parser parser; // Format strings std::vector<std::string> formatStrings; /** * Given a field in string form (a pointer to the first character and * a length), submit that field to Vertica. * `colNum` is the column number from the input file; how many fields * it is into the current record. */ bool handleField(size_t colNum, char* start, size_t len) { if (colNum >= colInfo.getColumnCount()) { // Ignore column overflow return false; } // Empty colums are null. if (len==0) { writer->setNull(colNum); return true; } else { return parseStringToType(start, len, colNum, colInfo.getColumnType(c olNum), writer, sp); } } static void handle_record(void *data, size_t len, void *p) { static_cast<LibCSVParser*>(p)->handleField(static_cast<LibCSVParser*>(p) ->colNum++, (char*)data, len); } static void handle_end_of_row(int c, void *p) { // Ignore 'c' (the terminating character); trust that it's correct static_cast<LibCSVParser*>(p)->colNum = 0; static_cast<LibCSVParser*>(p)->writer->next(); } virtual StreamState process(ServerInterface &srvInterface, DataBuffer &input , InputState input_state) { size_t processed; while ((processed = csv_parse(&parser, input.buf + input.offset, input.s ize - input.offset, handle_record, handle_end_of_row, this)) > 0) { input.offset += processed; } if (input_state == END_OF_FILE && input.size == input.offset) { csv_fini(&parser, handle_record, handle_end_of_row, this); return DONE; } return INPUT_NEEDED; } virtual void setup(ServerInterface &srvInterface, SizedColumnTypes &returnTy pe); virtual void destroy(ServerInterface &srvInterface, SizedColumnTypes &return Type) { csv_free(&parser); } }; template <class StringParsersImpl> void LibCSVParser<StringParsersImpl>::setup(ServerInterface &srvInterface, Sized ColumnTypes &returnType) { csv_init(&parser, CSV_APPEND_NULL); colInfo = returnType; } template <> void LibCSVParser<FormattedStringParsers>::setup(ServerInterface &srvInterface, SizedColumnTypes &returnType) { csv_init(&parser, CSV_APPEND_NULL); colInfo = returnType; if (formatStrings.size() != returnType.getColumnCount()) { formatStrings.resize(returnType.getColumnCount(), ""); } sp.setFormats(formatStrings); } template <class StringParsersImpl> class LibCSVParserFactoryTmpl : public ParserFactory { public: virtual void plan(ServerInterface &srvInterface, PerColumnParamReader &perColumnParamReader, PlanContext &planCtxt) {} virtual UDParser* prepare(ServerInterface &srvInterface, PerColumnParamReader &perColumnParamReader, PlanContext &planCtxt, const SizedColumnTypes &returnType) { return vt_createFuncObj(srvInterface.allocator, LibCSVParser<StringParsersImpl>); } }; typedef LibCSVParserFactoryTmpl<StringParsers> LibCSVParserFactory; RegisterFactory(LibCSVParserFactory); typedef LibCSVParserFactoryTmpl<FormattedStringParsers> FormattedLibCSVParserFac tory; RegisterFactory(FormattedLibCSVParserFactory);
The quick and dirty way would be to just hardcode it. It's using a callback to handle_end_of_row. Track the row number and just don't process the first row . Something like: static void handle_end_of_row(int c, void *ptr) { // Ignore 'c' (the terminating character); trust that it's correct LibCSVParser *p = static_cast<LibCSVParser*>(ptr); p->colNum = 0; if (rowcnt <= 0) { p->bad_field = ""; rowcnt++; } else if (p->bad_field.empty()) { p->writer->next(); } else { // libcsv doesn't give us the whole row to reject. // So just write to the log. // TODO: Come up with something more clever. if (p->currSrvInterface) { p->currSrvInterface->log("Invalid CSV field value: '%s' Row skipped.", p->bad_field.c_str()); } p->bad_field = ""; } } Also, best to initialize rownum = 0 in process since I think it will call this for each file in your COPY statement. There might be more clever ways of doing this. Basically, this will just process the record and then discard it. As for supporting SKIP generically... look at TraditionalCSVParser for how to handle parameter passing. You'd have to add it to the parser factor prepare and send in the value to the LibCSVParser class and override getParameterType. Then in LibCSVParser you need to accept the parameter in the constructor, and modify process to skip the first skip rows. Then use that value instead of the hardcoded 0 above.
CGAL::Delaunay_d C++ on UCI Seeds dataset: “EXC_BAD_ACCESS”
For my PhD work, I need to construct the Delaunay triangulation (DT) of a given point set in any (low) dimension. So far, I have been using the C++ CGAL library with data up to 4D without any noticeable problem. However, as I used the same class CGAL::Delaunay_d as I previously used on an 7D data set (namely UCI repository Seeds data set ), it seems like something is going wrong and I don't know how to trace my problem. Here is a copy-pastable code to reproduce the execution: // CGAL includes #include <CGAL/Cartesian_d.h> #include <CGAL/Delaunay_d.h> #include <CGAL/Gmpq.h> // STANDARD includes #include <iostream> #include <string> #include <map> // TYPEDEFS typedef CGAL::Gmpq EXACT_RT; typedef CGAL::Cartesian_d<EXACT_RT> EXACT_Kernel; typedef EXACT_Kernel::Point_d EXACT_Point; typedef EXACT_Kernel::Vector_d EXACT_Vector; typedef CGAL::Delaunay_d<EXACT_Kernel> EXACT_Delaunay_any_d; typedef EXACT_Delaunay_any_d::Vertex_handle EXACT_Vertex_handle; // NAMESPACES using namespace std; using namespace CGAL; // FUNCTIONS int main(int argc, char *argv[]); void delaunay_d(EXACT_Delaunay_any_d &DT, const map <unsigned, vector<EXACT_RT> > &data); map <unsigned, vector<EXACT_RT> > data_parse(const string &data_set); // DATASET char seeds_data_char[] = "15,26 14,84 0,871 5,763 3,312 2,221 5,22\n\ 14,88 14,57 0,8811 5,554 3,333 1,018 4,956\n\ 14,29 14,09 0,905 5,291 3,337 2,699 4,825\n\ 13,84 13,94 0,8955 5,324 3,379 2,259 4,805\n\ 16,14 14,99 0,9034 5,658 3,562 1,355 5,175\n\ 14,38 14,21 0,8951 5,386 3,312 2,462 4,956\n\ 14,69 14,49 0,8799 5,563 3,259 3,586 5,219\n\ 14,11 14,1 0,8911 5,42 3,302 2,7 5\n\ 16,63 15,46 0,8747 6,053 3,465 2,04 5,877\n\ 16,44 15,25 0,888 5,884 3,505 1,969 5,533\n\ 15,26 14,85 0,8696 5,714 3,242 4,543 5,314\n\ 14,03 14,16 0,8796 5,438 3,201 1,717 5,001\n\ 13,89 14,02 0,888 5,439 3,199 3,986 4,738\n\ 13,78 14,06 0,8759 5,479 3,156 3,136 4,872\n\ 13,74 14,05 0,8744 5,482 3,114 2,932 4,825\n\ 14,59 14,28 0,8993 5,351 3,333 4,185 4,781\n\ 13,99 13,83 0,9183 5,119 3,383 5,234 4,781\n\ 15,69 14,75 0,9058 5,527 3,514 1,599 5,046\n\ 14,7 14,21 0,9153 5,205 3,466 1,767 4,649\n\ 12,72 13,57 0,8686 5,226 3,049 4,102 4,914\n\ 14,16 14,4 0,8584 5,658 3,129 3,072 5,176\n\ 14,11 14,26 0,8722 5,52 3,168 2,688 5,219\n\ 15,88 14,9 0,8988 5,618 3,507 0,7651 5,091\n\ 12,08 13,23 0,8664 5,099 2,936 1,415 4,961\n\ 15,01 14,76 0,8657 5,789 3,245 1,791 5,001\n\ 16,19 15,16 0,8849 5,833 3,421 0,903 5,307\n\ 13,02 13,76 0,8641 5,395 3,026 3,373 4,825\n\ 12,74 13,67 0,8564 5,395 2,956 2,504 4,869\n\ 14,11 14,18 0,882 5,541 3,221 2,754 5,038\n\ 13,45 14,02 0,8604 5,516 3,065 3,531 5,097\n\ 13,16 13,82 0,8662 5,454 2,975 0,8551 5,056\n\ 15,49 14,94 0,8724 5,757 3,371 3,412 5,228\n\ 14,09 14,41 0,8529 5,717 3,186 3,92 5,299\n\ 13,94 14,17 0,8728 5,585 3,15 2,124 5,012\n\ 15,05 14,68 0,8779 5,712 3,328 2,129 5,36\n\ 16,12 15 0,9 5,709 3,485 2,27 5,443\n\ 16,2 15,27 0,8734 5,826 3,464 2,823 5,527\n\ 17,08 15,38 0,9079 5,832 3,683 2,956 5,484\n\ 14,8 14,52 0,8823 5,656 3,288 3,112 5,309\n\ 14,28 14,17 0,8944 5,397 3,298 6,685 5,001\n\ 13,54 13,85 0,8871 5,348 3,156 2,587 5,178\n\ 13,5 13,85 0,8852 5,351 3,158 2,249 5,176\n\ 13,16 13,55 0,9009 5,138 3,201 2,461 4,783\n\ 15,5 14,86 0,882 5,877 3,396 4,711 5,528\n\ 15,11 14,54 0,8986 5,579 3,462 3,128 5,18\n\ 13,8 14,04 0,8794 5,376 3,155 1,56 4,961\n\ 15,36 14,76 0,8861 5,701 3,393 1,367 5,132\n\ 14,99 14,56 0,8883 5,57 3,377 2,958 5,175\n\ 14,79 14,52 0,8819 5,545 3,291 2,704 5,111\n\ 14,86 14,67 0,8676 5,678 3,258 2,129 5,351\n\ 14,43 14,4 0,8751 5,585 3,272 3,975 5,144\n\ 15,78 14,91 0,8923 5,674 3,434 5,593 5,136\n\ 14,49 14,61 0,8538 5,715 3,113 4,116 5,396\n\ 14,33 14,28 0,8831 5,504 3,199 3,328 5,224\n\ 14,52 14,6 0,8557 5,741 3,113 1,481 5,487\n\ 15,03 14,77 0,8658 5,702 3,212 1,933 5,439\n\ 14,46 14,35 0,8818 5,388 3,377 2,802 5,044\n\ 14,92 14,43 0,9006 5,384 3,412 1,142 5,088\n\ 15,38 14,77 0,8857 5,662 3,419 1,999 5,222\n\ 12,11 13,47 0,8392 5,159 3,032 1,502 4,519\n\ 11,42 12,86 0,8683 5,008 2,85 2,7 4,607\n\ 11,23 12,63 0,884 4,902 2,879 2,269 4,703\n\ 12,36 13,19 0,8923 5,076 3,042 3,22 4,605\n\ 13,22 13,84 0,868 5,395 3,07 4,157 5,088\n\ 12,78 13,57 0,8716 5,262 3,026 1,176 4,782\n\ 12,88 13,5 0,8879 5,139 3,119 2,352 4,607\n\ 14,34 14,37 0,8726 5,63 3,19 1,313 5,15\n\ 14,01 14,29 0,8625 5,609 3,158 2,217 5,132\n\ 14,37 14,39 0,8726 5,569 3,153 1,464 5,3\n\ 12,73 13,75 0,8458 5,412 2,882 3,533 5,067\n\ 17,63 15,98 0,8673 6,191 3,561 4,076 6,06\n\ 16,84 15,67 0,8623 5,998 3,484 4,675 5,877\n\ 17,26 15,73 0,8763 5,978 3,594 4,539 5,791\n\ 19,11 16,26 0,9081 6,154 3,93 2,936 6,079\n\ 16,82 15,51 0,8786 6,017 3,486 4,004 5,841\n\ 16,77 15,62 0,8638 5,927 3,438 4,92 5,795\n\ 17,32 15,91 0,8599 6,064 3,403 3,824 5,922\n\ 20,71 17,23 0,8763 6,579 3,814 4,451 6,451\n\ 18,94 16,49 0,875 6,445 3,639 5,064 6,362\n\ 17,12 15,55 0,8892 5,85 3,566 2,858 5,746\n\ 16,53 15,34 0,8823 5,875 3,467 5,532 5,88\n\ 18,72 16,19 0,8977 6,006 3,857 5,324 5,879\n\ 20,2 16,89 0,8894 6,285 3,864 5,173 6,187\n\ 19,57 16,74 0,8779 6,384 3,772 1,472 6,273\n\ 19,51 16,71 0,878 6,366 3,801 2,962 6,185\n\ 18,27 16,09 0,887 6,173 3,651 2,443 6,197\n\ 18,88 16,26 0,8969 6,084 3,764 1,649 6,109\n\ 18,98 16,66 0,859 6,549 3,67 3,691 6,498\n\ 21,18 17,21 0,8989 6,573 4,033 5,78 6,231\n\ 20,88 17,05 0,9031 6,45 4,032 5,016 6,321\n\ 20,1 16,99 0,8746 6,581 3,785 1,955 6,449\n\ 18,76 16,2 0,8984 6,172 3,796 3,12 6,053\n\ 18,81 16,29 0,8906 6,272 3,693 3,237 6,053\n\ 18,59 16,05 0,9066 6,037 3,86 6,001 5,877\n\ 18,36 16,52 0,8452 6,666 3,485 4,933 6,448\n\ 16,87 15,65 0,8648 6,139 3,463 3,696 5,967\n\ 19,31 16,59 0,8815 6,341 3,81 3,477 6,238\n\ 18,98 16,57 0,8687 6,449 3,552 2,144 6,453\n\ 18,17 16,26 0,8637 6,271 3,512 2,853 6,273\n\ 18,72 16,34 0,881 6,219 3,684 2,188 6,097\n\ 16,41 15,25 0,8866 5,718 3,525 4,217 5,618\n\ 17,99 15,86 0,8992 5,89 3,694 2,068 5,837\n\ 19,46 16,5 0,8985 6,113 3,892 4,308 6,009\n\ 19,18 16,63 0,8717 6,369 3,681 3,357 6,229\n\ 18,95 16,42 0,8829 6,248 3,755 3,368 6,148\n\ 18,83 16,29 0,8917 6,037 3,786 2,553 5,879\n\ 18,85 16,17 0,9056 6,152 3,806 2,843 6,2\n\ 17,63 15,86 0,88 6,033 3,573 3,747 5,929\n\ 19,94 16,92 0,8752 6,675 3,763 3,252 6,55\n\ 18,55 16,22 0,8865 6,153 3,674 1,738 5,894\n\ 18,45 16,12 0,8921 6,107 3,769 2,235 5,794\n\ 19,38 16,72 0,8716 6,303 3,791 3,678 5,965\n\ 19,13 16,31 0,9035 6,183 3,902 2,109 5,924\n\ 19,14 16,61 0,8722 6,259 3,737 6,682 6,053\n\ 20,97 17,25 0,8859 6,563 3,991 4,677 6,316\n\ 19,06 16,45 0,8854 6,416 3,719 2,248 6,163\n\ 18,96 16,2 0,9077 6,051 3,897 4,334 5,75\n\ 19,15 16,45 0,889 6,245 3,815 3,084 6,185\n\ 18,89 16,23 0,9008 6,227 3,769 3,639 5,966\n\ 20,03 16,9 0,8811 6,493 3,857 3,063 6,32\n\ 20,24 16,91 0,8897 6,315 3,962 5,901 6,188\n\ 18,14 16,12 0,8772 6,059 3,563 3,619 6,011\n\ 16,17 15,38 0,8588 5,762 3,387 4,286 5,703\n\ 18,43 15,97 0,9077 5,98 3,771 2,984 5,905\n\ 15,99 14,89 0,9064 5,363 3,582 3,336 5,144\n\ 18,75 16,18 0,8999 6,111 3,869 4,188 5,992\n\ 18,65 16,41 0,8698 6,285 3,594 4,391 6,102\n\ 17,98 15,85 0,8993 5,979 3,687 2,257 5,919\n\ 20,16 17,03 0,8735 6,513 3,773 1,91 6,185\n\ 17,55 15,66 0,8991 5,791 3,69 5,366 5,661\n\ 18,3 15,89 0,9108 5,979 3,755 2,837 5,962\n\ 18,94 16,32 0,8942 6,144 3,825 2,908 5,949\n\ 15,38 14,9 0,8706 5,884 3,268 4,462 5,795\n\ 16,16 15,33 0,8644 5,845 3,395 4,266 5,795\n\ 15,56 14,89 0,8823 5,776 3,408 4,972 5,847\n\ 15,38 14,66 0,899 5,477 3,465 3,6 5,439\n\ 17,36 15,76 0,8785 6,145 3,574 3,526 5,971\n\ 15,57 15,15 0,8527 5,92 3,231 2,64 5,879\n\ 15,6 15,11 0,858 5,832 3,286 2,725 5,752\n\ 16,23 15,18 0,885 5,872 3,472 3,769 5,922\n\ 13,07 13,92 0,848 5,472 2,994 5,304 5,395\n\ 13,32 13,94 0,8613 5,541 3,073 7,035 5,44\n\ 13,34 13,95 0,862 5,389 3,074 5,995 5,307\n\ 12,22 13,32 0,8652 5,224 2,967 5,469 5,221\n\ 11,82 13,4 0,8274 5,314 2,777 4,471 5,178\n\ 11,21 13,13 0,8167 5,279 2,687 6,169 5,275\n\ 11,43 13,13 0,8335 5,176 2,719 2,221 5,132\n\ 12,49 13,46 0,8658 5,267 2,967 4,421 5,002\n\ 12,7 13,71 0,8491 5,386 2,911 3,26 5,316\n\ 10,79 12,93 0,8107 5,317 2,648 5,462 5,194\n\ 11,83 13,23 0,8496 5,263 2,84 5,195 5,307\n\ 12,01 13,52 0,8249 5,405 2,776 6,992 5,27\n\ 12,26 13,6 0,8333 5,408 2,833 4,756 5,36\n\ 11,18 13,04 0,8266 5,22 2,693 3,332 5,001\n\ 11,36 13,05 0,8382 5,175 2,755 4,048 5,263\n\ 11,19 13,05 0,8253 5,25 2,675 5,813 5,219\n\ 11,34 12,87 0,8596 5,053 2,849 3,347 5,003\n\ 12,13 13,73 0,8081 5,394 2,745 4,825 5,22\n\ 11,75 13,52 0,8082 5,444 2,678 4,378 5,31\n\ 11,49 13,22 0,8263 5,304 2,695 5,388 5,31\n\ 12,54 13,67 0,8425 5,451 2,879 3,082 5,491\n\ 12,02 13,33 0,8503 5,35 2,81 4,271 5,308\n\ 12,05 13,41 0,8416 5,267 2,847 4,988 5,046\n\ 12,55 13,57 0,8558 5,333 2,968 4,419 5,176\n\ 11,14 12,79 0,8558 5,011 2,794 6,388 5,049\n\ 12,1 13,15 0,8793 5,105 2,941 2,201 5,056\n\ 12,44 13,59 0,8462 5,319 2,897 4,924 5,27\n\ 12,15 13,45 0,8443 5,417 2,837 3,638 5,338\n\ 11,35 13,12 0,8291 5,176 2,668 4,337 5,132\n\ 11,24 13 0,8359 5,09 2,715 3,521 5,088\n\ 11,02 13 0,8189 5,325 2,701 6,735 5,163\n\ 11,55 13,1 0,8455 5,167 2,845 6,715 4,956\n\ 11,27 12,97 0,8419 5,088 2,763 4,309 5\n\ 11,4 13,08 0,8375 5,136 2,763 5,588 5,089\n\ 10,83 12,96 0,8099 5,278 2,641 5,182 5,185\n\ 10,8 12,57 0,859 4,981 2,821 4,773 5,063\n\ 11,26 13,01 0,8355 5,186 2,71 5,335 5,092\n\ 10,74 12,73 0,8329 5,145 2,642 4,702 4,963\n\ 11,48 13,05 0,8473 5,18 2,758 5,876 5,002\n\ 12,21 13,47 0,8453 5,357 2,893 1,661 5,178\n\ 11,41 12,95 0,856 5,09 2,775 4,957 4,825\n\ 12,46 13,41 0,8706 5,236 3,017 4,987 5,147\n\ 12,19 13,36 0,8579 5,24 2,909 4,857 5,158\n\ 11,65 13,07 0,8575 5,108 2,85 5,209 5,135\n\ 12,89 13,77 0,8541 5,495 3,026 6,185 5,316\n\ 11,56 13,31 0,8198 5,363 2,683 4,062 5,182\n\ 11,81 13,45 0,8198 5,413 2,716 4,898 5,352\n\ 10,91 12,8 0,8372 5,088 2,675 4,179 4,956\n\ 11,23 12,82 0,8594 5,089 2,821 7,524 4,957\n\ 10,59 12,41 0,8648 4,899 2,787 4,975 4,794\n\ 10,93 12,8 0,839 5,046 2,717 5,398 5,045\n\ 11,27 12,86 0,8563 5,091 2,804 3,985 5,001\n\ 11,87 13,02 0,8795 5,132 2,953 3,597 5,132\n\ 10,82 12,83 0,8256 5,18 2,63 4,853 5,089\n\ 12,11 13,27 0,8639 5,236 2,975 4,132 5,012\n\ 12,8 13,47 0,886 5,16 3,126 4,873 4,914\n\ 12,79 13,53 0,8786 5,224 3,054 5,483 4,958\n\ 13,37 13,78 0,8849 5,32 3,128 4,67 5,091\n\ 12,62 13,67 0,8481 5,41 2,911 3,306 5,231\n\ 12,76 13,38 0,8964 5,073 3,155 2,828 4,83\n\ 12,38 13,44 0,8609 5,219 2,989 5,472 5,045\n\ 12,67 13,32 0,8977 4,984 3,135 2,3 4,745\n\ 11,18 12,72 0,868 5,009 2,81 4,051 4,828\n\ 12,7 13,41 0,8874 5,183 3,091 8,456 5\n\ 12,37 13,47 0,8567 5,204 2,96 3,919 5,001\n\ 12,19 13,2 0,8783 5,137 2,981 3,631 4,87\n\ 11,23 12,88 0,8511 5,14 2,795 4,325 5,003\n\ 13,2 13,66 0,8883 5,236 3,232 8,315 5,056\n\ 11,84 13,21 0,8521 5,175 2,836 3,598 5,044\n\ 12,3 13,34 0,8684 5,243 2,974 5,637 5,063"; ////////// // MAIN // ////////// int main(int argc, char *argv[]) { // DATA SET declaration string seeds_data(seeds_data_char); map <unsigned, vector<EXACT_RT> > my_DATA = data_parse(seeds_data); // DT declaration EXACT_Delaunay_any_d my_DT(7); // DT construction delaunay_d(my_DT, my_DATA); return 0; } // DELAUNAY TRIANGULATION function void delaunay_d( EXACT_Delaunay_any_d &DT, const map <unsigned, vector<EXACT_RT> > &data) { // Dim size variable int d = ((data.begin()) ->second).size(); int i = 1; // Scanning data set -- DT construction for(map <unsigned, vector<EXACT_RT> >::const_iterator it = data.begin(); it != data.end(); it++, i++){ // Constructing Point objects EXACT_Point tmp = EXACT_Point(d, (it ->second).begin(), (it ->second).end()); // Inserting point in the triangulation EXACT_Vertex_handle v_tmp = DT.insert(tmp); // DEBUG std::cout << "-- DEBUG POST -- " << i << " -- DT.all_simplices().size() : " << DT.all_simplices().size() << " -- DT.current_dimension() : " << DT.current_dimension() << endl; } } // PARSING DATA function map <unsigned, vector<EXACT_RT> > data_parse( const string &data_set) { // RETURNED map map <unsigned, vector<EXACT_RT> > result; // TMP variables declaration vector<EXACT_RT> vect; string tmp_value; char current_char; for (unsigned i=0; i<data_set.length(); i++) { current_char = data_set[i]; // Testing if read character is tab or space (i.e. end of a number) ... if( (current_char == '\t') || (current_char == ' ')) { double curr_num = atof(tmp_value.c_str()); vect.push_back(EXACT_RT(curr_num)); // Storing the double value. tmp_value.clear(); // Clearing current number } // ... end of a line ... else if ( (current_char == '\n') || (current_char == '\r') ) { double curr_num = atof(tmp_value.c_str()); vect.push_back(EXACT_RT(curr_num)); // Storing the double value. result.insert ( pair <unsigned, vector<EXACT_RT> > (i++, vect) ); // Feeding returned map tmp_value.clear(); // Clearing current number vect.clear(); // Clearing the vector containing the converted values } // .. storing any other character else { // Dealing with decimal character (from ',' to '.') if(current_char == ',') { // Storing current character tmp_value.push_back('.'); } else // Storing current character tmp_value.push_back(current_char); } } return result; } As I used exact number type CGAL::Gmpq for the computation of the DT, I suspect an internal bug of CGAL but I can't assert it. My error actually occurs within the call of function EXACT_Delaunay_any_d::insert()and I don't know how to find a way to debug it. An “EXC_BAD_ACCESS” signal stops my program while trying to insert the 78-th point, after construction of 20926 simplices. My questions are: Should I use some other exact number type ? Is it an internal issue of CGAL function EXACT_Delaunay_any_d::insert() ? Is it a problem of memory allocation related to my OS (Mac OS X 10.6.8) ? Thanks in advance if you have any answer / clue for investigation ! Octavio
Interestingly, you just reported a stack overflow on stackoverflow.com. The function visibility_search in Convex_hull_d.h is recursive (not a terminal recursion) and the depth of the recursion is apparently not bounded. This is a bug. You should be able to get a bit further by increasing the stack size (the procedure is explained in other questions on this site). Let us know how that fares. You can also try to reduce other stack use. Maybe using mpq_class or CGAL::Quotient<CGAL::MP_Float> instead of CGAL::Gmpq would help, or it might be even worse. You could also recompile the GMP library after replacing 65536 with 1024 in gmp-impl.h.