18424510990

Committed 11 Oct 2025 04:37AM UTC coverage: 81.975% (-3.2%) from 85.197%

Build # 18424510990

Build Type

Pull #3508

github

Committed by

web-flow

Commit Message

Merge 46ecb2e71 into 3dfa34d2c

Pull Request Pull Request #3508: Automate workflow for mesh- or cell-based R2S calculations

Run Details

16590 of 23089 branches covered (71.85%)

Branch coverage included in aggregate %.

233 of 257 new or added lines in 6 files covered. (90.66%)

1327 existing lines in 64 files now uncovered.

53948 of 62959 relevant lines covered (85.69%)

43166566.37 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

59.26

/src/string_utils.cpp

#include "openmc/string_utils.h"

#include <algorithm> // for equal
#include <cctype>    // for tolower, isspace

namespace openmc {

std::string& strtrim(std::string& s)
{
  const char* t = " \t\n\r\f\v";
  s.erase(s.find_last_not_of(t) + 1);
  s.erase(0, s.find_first_not_of(t));
  return s;
}

char* strtrim(char* c_str)
{
  std::string std_str;
  std_str.assign(c_str);
  strtrim(std_str);
  int length = std_str.copy(c_str, std_str.size());
  c_str[length] = '\0';
  return c_str;
}

std::string to_element(const std::string& name)
{
  int pos = name.find_first_of("0123456789");
  return name.substr(0, pos);
}

void to_lower(std::string& str)
{
  for (int i = 0; i < str.size(); i++)
    str[i] = std::tolower(str[i]);
}

int word_count(const std::string& str)
{
  std::stringstream stream(str);
  std::string dum;
  int count = 0;
  while (stream >> dum) {
    count++;
  }
  return count;
}

vector<std::string> split(const std::string& in)
{
  vector<std::string> out;

  for (int i = 0; i < in.size();) {
    // Increment i until we find a non-whitespace character.
    if (std::isspace(in[i])) {
      i++;

    } else {
      // Find the next whitespace character at j.
      int j = i + 1;
      while (j < in.size() && std::isspace(in[j]) == 0) {
        j++;
      }

      // Push-back everything between i and j.
      out.push_back(in.substr(i, j - i));
      i = j + 1; // j is whitespace so leapfrog to j+1
    }
  }

  return out;
}

bool ends_with(const std::string& value, const std::string& ending)
{
  if (ending.size() > value.size())
    return false;
  return std::equal(ending.rbegin(), ending.rend(), value.rbegin());
}

bool starts_with(const std::string& value, const std::string& beginning)
{
  if (beginning.size() > value.size())
    return false;
  return std::equal(beginning.begin(), beginning.end(), value.begin());
}

} // namespace openmc

1	#include "openmc/string_utils.h"
2
3	#include <algorithm> // for equal
4	#include <cctype> // for tolower, isspace
5
6	namespace openmc {
7
8	std::string& strtrim(std::string& s)	8,760✔
9	{
10	const char* t = " \t\n\r\f\v";	8,760✔
11	s.erase(s.find_last_not_of(t) + 1);	8,760✔
12	s.erase(0, s.find_first_not_of(t));	8,760✔
13	return s;	8,760✔
14	}
15
16	char* strtrim(char* c_str)	×
17	{
18	std::string std_str;	×
19	std_str.assign(c_str);	×
20	strtrim(std_str);	×
21	int length = std_str.copy(c_str, std_str.size());	×
22	c_str[length] = '\0';	×
23	return c_str;	×
UNCOV 24	}	×
25
26	std::string to_element(const std::string& name)	3,008✔
27	{
28	int pos = name.find_first_of("0123456789");	3,008✔
29	return name.substr(0, pos);	3,008✔
30	}
31
32	void to_lower(std::string& str)	248,421✔
33	{
34	for (int i = 0; i < str.size(); i++)	1,967,254✔
35	str[i] = std::tolower(str[i]);	1,718,833✔
36	}	248,421✔
37
38	int word_count(const std::string& str)	×
39	{
40	std::stringstream stream(str);	×
41	std::string dum;	×
42	int count = 0;	×
43	while (stream >> dum) {	×
44	count++;	×
45	}
46	return count;	×
UNCOV 47	}	×
48
49	vector<std::string> split(const std::string& in)	7,513✔
50	{
51	vector<std::string> out;	7,513✔
52
53	for (int i = 0; i < in.size();) {	1,086,035✔
54	// Increment i until we find a non-whitespace character.
55	if (std::isspace(in[i])) {	1,078,522✔
56	i++;	145,912✔
57
58	} else {
59	// Find the next whitespace character at j.
60	int j = i + 1;	932,610✔
61	while (j < in.size() && std::isspace(in[j]) == 0) {	1,022,194✔
62	j++;	89,584✔
63	}
64
65	// Push-back everything between i and j.
66	out.push_back(in.substr(i, j - i));	932,610✔
67	i = j + 1; // j is whitespace so leapfrog to j+1	932,610✔
68	}
69	}
70
71	return out;	7,513✔
72	}	×
73
74	bool ends_with(const std::string& value, const std::string& ending)	5,819,762✔
75	{
76	if (ending.size() > value.size())	5,819,762✔
77	return false;	10,967✔
78	return std::equal(ending.rbegin(), ending.rend(), value.rbegin());	5,808,795✔
79	}
80
81	bool starts_with(const std::string& value, const std::string& beginning)	7,132,400✔
82	{
83	if (beginning.size() > value.size())	7,132,400!
84	return false;	×
85	return std::equal(beginning.begin(), beginning.end(), value.begin());	7,132,400✔
86	}
87
88	} // namespace openmc

openmc-dev / openmc / 18424510990

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous