-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathFile_Generic.cpp
More file actions
128 lines (124 loc) · 4.75 KB
/
File_Generic.cpp
File metadata and controls
128 lines (124 loc) · 4.75 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
/*
# Copyright (c) 2012, Tristan Lorach & NVIDIA CORPORATION. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# * Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
# * Neither the name of NVIDIA CORPORATION nor the names of its
# contributors may be used to endorse or promote products derived
# from this software without specific prior written permission.
#
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
# PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
# CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
# EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
# PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
# OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "stdafx.h"
//
// Load a "generic" set of values : You need the frame number first.
// Frame, name1, name2, Name3, ...
// 1, 1.5, 21%,3.1...
// 2, 35%, 1.1,3.0...
// 7, 0.5, 0.1,0.0...
// ...
//
bool loadGeneric(const char *name, const char *fname)
{
int i = 0, graph = 0;
char tmpstr[1024];
//std::basic_ifstream<char> fs(fname);
std::ifstream fs(fname);
if(!fs.is_open())
{
if(g_pLog) g_pLog->AddMessage("no>>Failure...");
return false;
}
fs.getline(tmpstr, 1023); //line for value names
if(*tmpstr == '\0')
{
if(g_pLog) g_pLog->AddMessage("no>>Failure...");
return false;
}
// for size of the file so we can display a progress bar
fs.seekg( -1, std::ios_base::end );
int bSize = fs.tellg();
fs.seekg( 0, std::ios_base::beg );
g_pProgressBar->SetTitle("Loading generic csv data...");
if(g_pLog) g_pLog->AddMessage("warning>>Loading Generic data. No special format recognized...");
// done outside
//Matcher *mm = Pattern::compile("\\\\?([0-9a-zA-Z_]+)\\.")->createMatcher(std::string(fname));
//mm->findFirstMatch();
//std::string filename = mm->getGroup(1);
// get the names
Matcher *mm2 = Pattern::compile("\\s*(([0-9a-zA-Z_\\s#\\[\\]\\*\\(\\)]+))\\s*,*")->createMatcher(tmpstr);
if(mm2->findFirstMatch())
{
IWindowFolding *pWFold;
//NOTE: we assume all graphs will have the same 'graph' number...
while(mm2->findNextMatch())
{
if(i >= g_pDisplays.size())
{
TLDisplay *pDisp = new TLDisplay(g_hwnd);
pDisp->name = mm2->getGroup(1).c_str();
g_pDisplays.push_back(pDisp);
//UI:
pWFold = g_pwinHandler->CreateWindowFolding((LPCSTR)((i+1)<<8), mm2->getGroup(1).c_str(), g_pMainContainer);
}
else
{
pWFold = (IWindowFolding *)g_pwinHandler->Get((LPCSTR)((i+1)<<8))->QueryInterface("IWindowFolding");
}
graph = g_pDisplays[i]->addGraph(name);
//UI:
g_pwinHandler->CreateCtrlCheck((LPCSTR)(((i+1)<<8)+graph+1), name, pWFold)->SetChecked(true);
i++;
}
}
if(i == 0)
{
if(g_pLog) g_pLog->AddMessage("no>>Failure...");
return false;
}
//Fill in the graph
Pattern *p = Pattern::compile("\\s*([\\-0-9\\.]*)(%*)\\s*,*");
Matcher *m = p->createMatcher("");
int frame = 0;
float value;
do {
fs.getline(tmpstr, 1023);
m->setString(tmpstr);
if(m->findFirstMatch())
{
frame = atoi(m->getGroup(1).c_str());
i = 0;
while(m->findNextMatch())
{
if(i >= g_pDisplays.size())
break;
value = atof(m->getGroup(1).c_str());
char c = m->getGroup(2).c_str()[0];
if(m->getGroup(2).c_str()[0] == '%')
value /= 100.0;
g_pDisplays[i]->addMeasure(graph, TMeasure(value, frame, NULL, NULL, NULL), frame);
i++;
}
}
if((frame % 10)==0)
g_pProgressBar->SetPercent(100*fs.tellg()/bSize);
} while(!fs.eof());
if(g_pLog) g_pLog->AddMessage("yes>>Done");
return true;
}