C / C++ / MFC

ForNow4-Jul-17 3:38

ForNow

4-Jul-17 3:38

Thanks I had downloaded the sample code "How the compiler implements exception handling"

Seems like SEH is only use full for 32 bit code as the EXCEPTION_REGISTRATION handler pointer

is a DD 4 bytes and I am running a 64 bit project

Randor 5-Jul-17 2:42

Randor

5-Jul-17 2:42

ForNow wrote:
Seems like SEH is only use full for 32 bit code as the EXCEPTION_REGISTRATION handler pointer
is a DD 4 bytes and I am running a 64 bit project

No absolutely not,

That field should be defined as a PEXCEPTION_ROUTINE callback which will be quadword pointer on a 64 bit platform. Sounds like you are looking at some 32 bit instructions in your sample.

Best Wishes,
-David Delaune

ForNow5-Jul-17 3:12

ForNow

5-Jul-17 3:12

Thanks this is in regards to the exception I'm getting access violation it happens intermittently
When it does the Debbuger gets control and points to ntdll looking at the call stack doesn't point me back to anywhere in my code. I was looking for a really low level Exception handler that might catch it earlier.
The code for the SEH in all the examples I have seen has inline Assembler

However I do have the intel compiler which lets me use _asm for 64 bit code

Thanks

Simple question about templates

Randor 5-Jul-17 3:20

Randor

5-Jul-17 3:20

Hi,

The unresolved symbol std::_Lockit appears to be from the Microsoft implementation of checked iterators[^] in our STL implementation.

So this implies that you are #including the Microsoft STL headers and trying to link with the Intel Standard C++ Library[^].

Fix your broken #include and library paths.

Best Wishes,
-David Delaune

Richard MacCutchan2-Jul-17 5:25

2-Jul-17 5:25

I have a templated class that is based on string or wstring, and most things are easy as the basic_string contains sufficient operators and methods to manipulate the text. However, one thing I cannot get round is including character constants inside the template, as below:

C++

template <typename T>
class Tokenizer
{
    typedef typename T::size_type _Mysizt;
    T strText;
    T strFilter;
    
    _Mysizt offset;	// offset of the current substring (token)
    _Mysizt index;	// index to the next separator character, or npos if not found
    _Mysizt length;	// length of the current substring, or npos if the last one
    
    public:
    Tokenizer(T strText, T strFilter)
    {
        // code removed for readability
    }
    
    T Next(bool bTrim)
    {
        T strToken;
        if (bTrim)
        {
            // trim leading spaces
// but ' ' will not be accepted for a wstring, and L' ' will not be for a string
            offset = strText.find_first_not_of(' ', offset);
        }
        // code removed for readability
    }
    return strToken;
}

I am sure it must be possible (OG, Po'H, SB), but my reading of the documentation and samples has not helped. So what (obvious) did I miss?

[edit]
While David Crow's suggestion works for a character constant, it will not work for a string like:

C++

offset = strText.find_first_not_of(" \t", offset);

[/edit]

modified 3-Jul-17 4:43am.

David Crow2-Jul-17 17:44

David Crow

2-Jul-17 17:44

I'm not sure I entirely understand the problem so my suggestion may be as valuable as a $3 bill. Can you use:

offset = strText.find_first_not_of(0x20, offset);

Or could you add the "search for" character as part of the constructor?

"One man's wage rise is another man's price increase." - Harold Wilson

"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons

"You can easily judge the character of a man by how he treats those who can do nothing for him." - James D. Miles

Richard MacCutchan2-Jul-17 21:55

2-Jul-17 21:55

Thanks, that did work, and your suggestion about the constructor I already tried. However, I am still wondering if there is any way to include string or character literals in such a template.

jschell5-Jul-17 6:22

jschell

5-Jul-17 6:22

Presumably your goal is to use a set of characters rather than one character for your separator.
And the classes in use do not provide that functionality.

I believe tokenizers iterate through the string character by character, perhaps for efficiency and perhaps to avoid the problem you have.

If you want to avoid iteration then perhaps strtok() might solve it.

Richard MacCutchan5-Jul-17 6:28

Manipulating of .txt file

5-Jul-17 6:28

Thanks, that is the conclusion I came to, and I resolved the issue with a slightly different implementation. I was really just trying to learn a bit more about templates, and wondered if there was any provision for automatically converting constant strings between ASCII and Unicode. It's obviously something to be aware of, and avoid.

Artur Grabowski1-Jul-17 21:44

1-Jul-17 21:44

Welcome guys!!!
I am a beginner in C++ and I have a little task to solve. Ihave a file .txt like this :
net.txt - Google Drive[^]
And i want make tables that for each number gives all value about the nuber from data
Something like this :

Number9	
from	value
1	0,70606
3	0,99605
11	-0,28155
12	0,58371
15	0,70069
17	-0,95633
18	0,84633
19	0,77246
25	0,49101
30	-0,76256
31	0,77975
34	0,73573
44	-0,6106
45	-0,91379
51	0,25814
53	-0,59725
54	-0,78294
58	0,13108
70	-0,02528
73	0,37034
75	0,23552
76	-0,54187
78	0,77419
79	0,4681
80	-0,01923
83	0,39902
85	0,82687

I will be grateful for help or advices
Thanks !!!!

Richard Andrew x642-Jul-17 2:59

2-Jul-17 2:59

Artur Grabowski wrote:
I will be grateful for help or advices

We're willing to help with good advice. But you need to ask a specific question.

What have you tried? Where does it go wrong? Are there any error messages? Post a snippet of the text file you're using and the relevant portion of your code.

The difficult we do right away...
...the impossible takes slightly longer.

modified 2-Jul-17 9:07am.

Artur Grabowski2-Jul-17 4:18

2-Jul-17 4:18

i was trying but the problem is the parsing of uploaded file :/
in example :

connection definition section :

target | site | source:weight
-------|------|----------------------------------------------------------------------------------------------------------------
     1 |      |   2: 0.00000,   3: 0.00000,   4: 0.00000,   5: 0.00000,   6: 0.00000,   7: 0.00000,   8: 0.00000,   9: 0.70606,
                 10: 0.00000,  11: 0.00000,  12: 0.00000,  13: 0.00000,  14: 0.00000,  15: 0.00000,  16:-0.38621,  17: 0.00000,
                 18: 0.00000,  19: 0.00000,  20: 0.00000,  21: 0.00000,  22: 0.00000,  23: 0.00000,  24: 0.00000,  25: 0.00000,
                 26: 0.00000,  27:-0.51685,  28: 0.00000,  29: 0.00000,  30: 0.00000,  31: 0.65813,  32: 0.00000,  33: 0.00000,
                 34: 0.00000,  35: 0.00000,  36:-0.23965,  37: 0.00000,  38: 0.00000,  39: 0.00000,  40:-0.53012,  41: 0.00000,
                 42: 0.65078,  43: 0.00000,  44:-0.25587,  45: 0.61060,  46:-0.77841,  47:-0.10781,  48: 0.00000,  49: 0.00000,
                 50: 0.00000,  51: 0.60152,  52:-0.04528,  53: 0.00000,  54: 0.00000,  55: 0.00000,  56: 0.34451,  57: 0.00000,
                 58:-0.63902,  59: 0.00000,  60: 0.00000,  61: 0.00000,  62: 0.00000,  63: 0.00000,  64: 0.00000,  65: 0.00000,
                 66:-0.35604,  67:-0.65445,  68: 0.00000,  69:-0.18092,  70: 0.00000,  71: 0.00000,  72: 0.00000,  73:-0.07051,
                 74: 0.00000,  75: 0.00000,  76: 0.62501,  77: 0.00000,  78:-0.66639,  79: 0.00000,  80: 0.00000,  81: 0.00000,
                 82: 0.54643,  83: 0.00000,  84: 0.86970,  85: 0.00000,  86: 0.00000,  87: 0.00000,  88: 0.17621,  89: 0.00000,
                 90: 0.00000,  91: 0.00000,  92: 0.00000,  93: 0.00000,  94: 0.00000,  95:-0.48619,  96:-0.21145,  97:-0.67891,
                 98: 0.00000,  99: 0.70803, 100:-0.94970, 101: 1.00000, 102: 1.00000, 103: 1.00000, 104: 1.00000, 105: 1.00000,
                106: 1.00000, 107: 1.00000, 108: 1.00000, 109: 1.00000
     2 |      |   1: 0.00000,   3: 0.00000,   4:-0.70584,   5: 0.00000,   6: 0.00000,   7: 0.00000,   8: 0.73104,   9: 0.00000,
                 10:-0.68872,  11: 0.00000,  12:-0.06770,  13: 0.00000,  14: 0.00000,  15: 0.00000,  16:-0.51967,  17: 0.00000,
                 18: 0.17679,  19: 0.00000,  20: 0.00000,  21: 0.00000,  22: 0.00000,  23: 0.97774,  24: 0.00000,  25: 0.00000,
                 26:-0.53439,  27: 0.00000,  28: 0.00000,  29: 0.00000,  30: 0.00000,  31:-0.36626,  32: 0.00000,  33:-0.55026,
                 34: 0.00000,  35: 0.07276,  36:-0.20741,  37: 0.00000,  38: 0.00000,  39: 0.00000,  40: 0.00000,  41: 0.52934,
                 42: 0.00000,  43: 0.37477,  44: 0.00000,  45: 0.00000,  46: 0.00000,  47: 0.00000,  48: 0.72724,  49: 0.00000,
                 50: 0.00000,  51: 0.00000,  52: 0.00000,  53: 0.26374,  54: 0.00000,  55: 0.00000,  56: 0.00000,  57: 0.00000,
                 58: 0.00000,  59: 0.00000,  60: 0.00000,  61: 0.00000,  62:-0.92754,  63: 0.00000,  64:-0.38383,  65: 0.00000,
                 66: 0.00000,  67: 0.00000,  68: 0.00000,  69: 0.00000,  70:-0.70225,  71:-0.40858,  72: 0.13286,  73: 0.00000,
                 74: 0.00000,  75: 0.00000,  76: 0.00000,  77: 0.00000,  78:-0.89306,  79: 0.00000,  80: 0.00000,  81:-0.52612,
                 82: 0.00000,  83: 0.00000,  84: 0.00000,  85: 0.00000,  86:-0.68323,  87: 0.00000,  88: 0.00000,  89: 0.00000,
                 90: 0.45177,  91:-0.31180,  92:-0.08625,  93: 0.00000,  94: 0.00000,  95: 0.00000,  96: 0.00000,  97: 0.00000,
                 98: 0.00000,  99: 0.00000, 100: 0.00000, 101: 1.00000, 102: 1.00000, 103: 1.00000, 104: 1.00000, 105: 1.00000,
                106: 1.00000, 107: 1.00000, 108: 1.00000, 109: 1.00000
     3 |      |   1: 0.00000,   2: 0.00000,   4: 0.83542,   5: 0.00000,   6: 0.09158,   7: 0.00000,   8: 0.00000,   9: 0.99605,
                 10: 0.68074,  11: 0.00000,  12: 0.92181,  13: 0.00000,  14: 0.00000,  15: 0.00000,  16: 0.00000,  17: 0.00000,
                 18: 0.00000,  19: 0.00000,  20: 0.00000,  21: 0.00000,  22: 0.00000,  23: 0.81755,  24: 0.00000,  25: 0.00195,
                 26: 0.00000,  27: 0.00000,  28: 0.00000,  29: 0.00000,  30: 0.00000,  31: 0.00000,  32: 0.00000,  33:-0.02341,
                 34: 0.97974,  35: 0.00000,  36: 0.00000,  37: 0.00000,  38:-0.08182,  39: 0.00000,  40: 0.18787,  41: 0.00000,
                 42: 0.00000,  43: 0.64793,  44: 0.00000,  45: 0.00000,  46: 0.00000,  47: 0.00000,  48: 0.00000,  49: 0.09191,
                 50: 0.00000,  51: 0.00000,  52: 0.00000,  53: 0.00000,  54: 0.00000,  55: 0.00000,  56:-0.92661,  57:-0.47441,
                 58: 0.00000,  59: 0.00000,  60: 0.00000,  61: 0.00000,  62: 0.56569,  63: 0.00000,  64: 0.73977,  65: 0.00000,
                 66: 0.55625,  67:-0.72023,  68: 0.00000,  69: 0.01612,  70: 0.07420,  71: 0.00000,  72: 0.00000,  73: 0.00000,
                 74:-0.08375,  75: 0.00000,  76: 0.83450,  77: 0.00000,  78:-0.92284,  79: 0.00000,  80: 0.00000,  81: 0.00000,
                 82:-0.36193,  83: 0.00000,  84: 0.00000,  85: 0.00000,  86: 0.00000,  87: 0.17190,  88: 0.00000,  89: 0.00000,
                 90: 0.00000,  91: 0.00000,  92: 0.00000,  93: 0.16294,  94: 0.00000,  95: 0.00000,  96: 0.00000,  97: 0.00000,
                 98:-0.12163,  99: 0.00000, 100: 0.00000, 101: 1.00000, 102: 1.00000, 103: 1.00000, 104: 1.00000, 105: 1.00000,
                106: 1.00000, 107: 1.00000, 108: 1.00000, 109: 1.00000

Richard Andrew x642-Jul-17 5:14

2-Jul-17 5:14

Artur Grabowski wrote:
the problem is the parsing of uploaded file

That's what I was trying to get at. What EXACTLY is the problem?

The difficult we do right away...
...the impossible takes slightly longer.

Artur Grabowski2-Jul-17 5:34

2-Jul-17 5:34

I don't know how place data in right side

Richard Andrew x642-Jul-17 5:52

2-Jul-17 5:52

I'm afraid that's not a good enough explanation of the problem you are facing to give you a good answer.

Is the problem that you have no idea how to begin?

In that case it will be difficult to help, because we can't teach you programming from scratch.

Why don't you post what code you have so far.

The difficult we do right away...
...the impossible takes slightly longer.

Artur Grabowski2-Jul-17 6:41

2-Jul-17 6:41

C++

QMap< int, QMap<int,double> >::iterator it;
    it=targets->begin();
    while(it!=targets->end())
    {
        QString mod="   ";
        mod.append(QString::number(it.key())+" |      |  ");

        int rowfillcount=0;
        QMap<int,double>::iterator it2=it.value().end();
        do
        {
            --it2;

            mod.append(QString("  ")+QString::number(it2.key())+":"+QString::number(it2.value(),'d',5)+",");

            if(++rowfillcount==8)
            {
                rowfillcount=0;
                mod.append("\n                 ");
            }
        }
        while(it2!=it.value().begin());

        mod[mod.lastIndexOf(",")]='\n';

        ui->plainTextEdit_result->appendPlainText(
        mod);

        it++;
    }

    ui->plainTextEdit_result->appendPlainText(
    "-------|------|----------------------------------------------------------------------------------------------------------------\

David Crow2-Jul-17 17:36

David Crow

2-Jul-17 17:36

Artur Grabowski wrote:

And i want make tables that for each number gives all value about the nuber from data

You do realize that you are the only one that understands this statement, don't you? How do the contents of the file "map" to your desired output?

Artur Grabowski wrote:

I will be grateful for help or advices

Put your keyboard away. What does "parsing the file" look like using paper and pencil?

Artur Grabowski3-Jul-17 19:00

Checksum Generators With Advanced Functions

3-Jul-17 19:00

This is a script to do this in ruby :

#!env ruby

def parse(text)
  text.split(',').map do |item|
    key, value = item.split(':')
    [key.to_i, value.to_f]
  end.to_h
end

input_data = File.read(ARGV[0]).gsub("\r", "")

id = nil
entries = {}

input_data.split("\n").each do |line|
  columns = line.split("|")

  id = columns[0].to_i if columns.size == 3
  entries[id] ||= {}

  if columns.size == 3 || columns.size == 1
    entries[id].merge! parse(columns.last)
  elsif columns.size != 0
    puts "? #{line}"
  end
end


entries.sort_by { |k,v| k }.each do |key, weights|
  puts
  puts
  puts "# neuron #{key}"

  puts "source\tweight"
  weights.sort_by { |k, v| k }.each do |source, weight|
    puts "#{source}\t#{weight.to_s.gsub('.',',')}"
  end
end

Thanks for help !!!

Member 1328723330-Jun-17 8:49

Member 13287233

30-Jun-17 8:49

Hello,

Checksum generator ExactFile has the function to create checksums for all files within an entire directory and later compare those files with the generated checksum file. (Other checksum generators which I have tried to use do not have the function to compare all files within a directory with their checksum file generated previously.)

However, the latest version of ExactFile seems to be from 2009. Are there any other good checksum generators which include the function to compare all files within a directory with their checksum file generated previously?

Richard Andrew x6430-Jun-17 10:08

30-Jun-17 10:08

Excuse my ignorance, but has the method for calculating a checksum changed since 2009?

The difficult we do right away...
...the impossible takes slightly longer.

Member 132872331-Jul-17 1:28

Member 13287233

1-Jul-17 1:28

I am not knowledgeable in this subject, but since algorithms for generating checksums have not changed since 2009, ExactFile can still be used. But the author of the program says that it is a beta version and that improvements may be made. Therefore, I thought that it is better to find a checksum generator which is not in a beta stage and has been released more recently.

Richard MacCutchan1-Jul-17 1:32

1-Jul-17 1:32

Google will find it for you.

Randor 30-Jun-17 23:11

Randor

30-Jun-17 23:11

Hi,

This is not a c++ question. Interesting that you created this account specifically for asking this single question on a c++ forum.

What I find more interesting is that the linguistic syntax you are using such as "which include", "generated previously" and preposition usage such as "within" and the overall sentence length[^] strongly imply a native English speaker and not someone from the "Russian Federation" as your profile indicates.

Best Wishes,
-David Delaune