I want to provide some sort of function that takes in a range and returns a list or map (like a python dictionary) of items that fall under that range. E.g.
#define BOB_AGE 10 // this is how existing defines are and I cant change them.
#define BILL_AGE 13
#define TIM_AGE 22
#define TOM_AGE 30
getPeopleBetween(5,20);
I would want a python like dictionary that is returned, where I can have map like functionality and request the value (age) from this returned list.
At the moment, I have a master map list where I add all defines within the constructor. I was thinking of creating another list and returning that within the get function.
1. Write a program the calculates the volume of a sphere.
Use a define to set Pi to 3.14 and a macro for the formula for the sphere. V = 4/3PiR3. In main ask for the radius (R). Pass it to a function where you calculate the volume and return it to main and print the volume in main. Use float values. (Save this program as you'll need it later.)
I wrote a program which sends a starting and ending range to other processes and the processes calculate the prime numbers in that range and return the count of prime numbers to the head process, process 0. But this is not working properly at the moment. I realize I still have to split up the range based on how many processes I have...I still have not figured out how I want to set that up. I
Code:
#include <stdio.h> #include <stdlib.h> #include <mpi.h> int isPrime(int num); int main(int argc, char **argv){ }
Basically I want to create a base class which defines a static data member so that its automatically redeclared as the same static data member in the derived class.
class A{ protected: static derivable int val; // A::val }
class B : public A{ // static derivable int val is already here // A::val AND B::val }
This seems impossible to me but I'm wondering if perhaps there's a way to add modifiers to the compiler to do this (or preferably something MUCH simpler)...
I have a .cpp file which I have to create a header file for. I started it but I have stuck and it is full of errors.
I have some tasks (see comments in the code):
Task 2: I have to write a template which defines min max operators on vectors, it must be a custom vector template. The main program only demonstrates that it creates a data structure which calls for min max operators.
Task 3: I need a special min max function which watches for any changes and it has to work lineally so it has to step along the elements of the vectors determining the min max values.
I am trying to write a function to return the first element of a link list queue. I am not real sure how to implement this. I have include a copy of the struct for my Node & queue.
I'm writing some functions pertaining to binary trees. I've used recursion once before while learning quicksort but am still quite new and unfamiliar with it. And this is my first time touching a binary tree. So my question: In my addnode function, will the return root statement at the end ever return a value other than the value passed to the function?
#include <iostream> using namespace std; int n; int& test();
[Code] ....
Explanation
In program above, the return type of function test() is int&. Hence this function returns by reference. The return statement is return n; but unlike return by value. This statement doesn't return value of n, instead it returns variable n itself.
Then the variable n is assigned to the left side of code test() = 5; and value of n is displayed.
I don't quite understand the bold sentence. Shouldn't value of n and variable n be the same?
My program behaves weird... I wanted to generate 10 random numbers from 1 to 100 each of them bigger than previous, using the while loop and function that returns a random number in specified range.
When I run the program, I get numbers much bigger than 100, even negative number, and numbers are same every time I run the program.
Code: #include <ctime>#include <cstdlib> #include <iostream> using namespace std; int range(int low, int high);
i have to find 2 random values between a range, lets say from 0-3 i have to find all the possible combinations between this range like (0,0),(0,1)...etc But, it has to be RANDOM and the same combination cannot repeat it self(obviously).
I have an assignment where I have to use two for loops. I need to ask the user for any two numbers and be able to list all the numbers in between and their factors and state whether or not the number is prime or not.
N3337 wrote:86) this ensures that a top-level comma operator cannot be reinterpreted as a delimiter between init-declarators in the declaration of __range.
What in the world would be a valid example of when this might occur? (IE one that isn't blatantly misusing the quirks of the language).
This topic can also serve as a review topic on this presentation as well: [URL] .....
I've been debugging this program since yesterday and I continue to run into a string subscript error. I pasted the code in a pastebin (it's only 400 lines), to see why I'm getting this. The problem seems to come up during a debug assertion failure.
whenever I try to use either <string> or any STL container. Everyone I saw so far, says that "using a .reserve(n)" before adding items to random positions is enough. However, each time I run the code, I still get the same error, unless I actually write the memory with some initial data, and only after access random positions.I am fully aware of the fact that the STL containers and <string> are dynamic data types and memory allocation is done dynamically. However, if I need to allocate all those memory slots before knowing how many I need, would lead me to the same memory complexity as using a char [] array (which is static -- size declaration at first).
how is it possible to keep the <string> dynamic, while being able to add elements on random positions (if possible). I know the strings have the ending char '', but there should still be something that would allow it to work. Okay, long story short, here is my example. I am trying to read from file rows of data. The first char on each row represents a normal char c. The rest of the row is a string which contains numbers (integers between 1 and 250) which represent the position at which the char c (read before) will have its location.
For example the input file:
#include <fstream> #include <deque> // for later use #include <string> #include <sstream> #include <algorithm> // for later use
[code].....
The program works perfectly, if instead of text.reserve(250); I use text.resize(250);. However, what is the difference between the two? I mean, why isn't reserve enough?
In my program I have a range check setup in the class I call from main, but when I run it and put in a value > or < than the min/max it just calculates anyway. Where have I made a mistake?
Heres the Main
#include "box_class.h" #include <iostream> using namespace std; int main() { double length; double width; double height; double volume;
I'm making a simple game and I'm having trouble creating boundaries for the players movements. The map is a 2D vector. When I compare the vector with the players current position sometimes I get an error during run. When the error isn't occurring the behavior of the boundaries is bizarre. The error tells me that the vector is out of range.
Here is the where the map is created. It's within its own class constructor.
vector< vector<char> > map_parts; map_parts.resize(25); for ( int i = 0; i < 25; i++ ) {
I would like to try out a range based for loop. I am using gcc 4.6.3. According to the link below, gcc 4.6.3 should allow me to use a range based for loop.
[URL]
However when attempting to run the code below, my IDE (Eclipse) reports the following error:
"error: #error This file requires compiler and library support for the upcoming ISO C++ standard, C++0x. This support is currently experimental, and must be enabled with the -std=c++0x or -std=gnu++0x compiler options:
int a[5] ={1,2,3,4,5}; for (int x : a) { cout<<x; }
If gcc 4.6.3 supports range based for loops why do I get this error?
Ok so I'm reading the Programming: Principles and Practice using C++ and Im stuck in Drill 4 part 5. It says:
Change the program so that it writes out the "numbers are almost equal" after writing out which is the larger and the smaller if the two numbers differ by less than 1.0/10000000
I'm using an If statement for it... I just need know what the formula is to check 2 numbers that were entered by person if they land within the range specified above. so then I can cout << "numbers are almost equal" << endl;
I'm trying to do some operator overloading, the function is supposed to add the values at index [i] of two vectors and place the result in the returning vector. The problem is I keep getting a vector out of range. This is the overloaded operator I'm working with (relatively new to these):
vector<float> operator+(const vector<float>& a, const vector<float>& b){ unsigned long size; vector<float> temp; if(a.size() >= b.size()) size = a.size();
[Code] .....
and then I would do something like this in the main:
vector<float> v, v1, v2;
v1.push_back(9.1); ... v2.push_back(8); ... v = v1 + v2;
but when I try to output the vector v I just get a vector out of range exception.
