C++ QuadTree::mapNodes方法代码示例

//.........这里部分代码省略.........
            switch(i){
                case 2:// INCIDENT_TYPE_DESCRIPTION
                    ;
                    incidentType = string(buff); 
                    iter = incidentTypes.find(incidentType);
                    if(iter == incidentTypes.end()){
                        // Then the incidentType isn't in incidentTypes
                        incidentTypes.emplace(incidentType, incidentCount);
                        c->type = incidentCount;
                        incidentCount++;
                    }else{
                        c->type = iter->second;
                    }
                    break;
                case 6: // FROMDATE
                    c->date.setDate(buff);
                    break;
                case 7: // WEAPONTYPE (either Unarmed, Other, Knife, or Firearm)
                    switch(buff[0]){
                        case 'U': // Unarmed
                            c->weapon = 0;
                            break;
                        case 'O': // Other
                            c->weapon = 1;
                            break;
                        case 'K': // Knife
                            c->weapon = 2;
                            break;
                        case 'F': // Firearm
                            c->weapon = 3;
                            break;
                        default:
                            break;
                    }
                    break;
                case 8: //Shooting (Yes or No)
                    
                    // If there was a shooting, add a shooting flag
                    if(buff[0] == 'Y'){ 
                        c->weapon += 4;
                    }
                    break;
                default:
                    break;
            }
        }   
        crimeFile.getline(buff, 128); //This is the location
        l.setLocation(buff);
        m.setLocation((l.x - MIN_LAT)*LAT_TO_METERS , 
                      (l.y - MIN_LNG)*LNG_TO_METERS);
        // Output the crime CSV
        crimeOut << '"' << l << "\", " << c->date << ", "
                 << int(c->type) << ", " << int(c->weapon) << endl;
        
        // the call to quad.findNodes(m, 100) finds all nodes in the QuadTree within
        // a distance of 100 from the location m, which is the metric coordinates of the crime
        vector<Restauraunt*> v = quad.findNodes(m, 100);
        
        // This bit iterates through and adds the crime to the objects of nearby restauraunts
        if(!v.empty()){
            int initialCost = initialCrimeCost(*c);
            // If the initial cost is 0, no need to add the crime, as that means it was ignorable?
            // Basically I just decided that a MedAssist incident probably shouldn't be counted,
            // although I don't actually kknow what that means, its frequency and name suggests
            // that perhaps the police were merely assisting with something of a medical nature.
            
            if(initialCost > 0){
                for(Restauraunt* r: v){
                    r->addCrime(c, m, initialCost, now);
                }
            }
        }
        // if c->copies = 0, then it wasn't within 100 meters of any restauraunt and should be deleted
        if(c->copies = 0)
            delete c;
        else
            crimes.push_back(c);
        i++;
        if(i%100 == 0)
            cout << i << " crimes processed\n";
    }
    crimeFile.close();
    crimeOut.close();
    cout << "MedAssist: " << (int)incidentTypes["MedAssist"] << endl;
    // This section outputs the food CSV nice and succinctly
    ofstream foodOut (FOOD_OUT);
    foodOut << "Location, Name, Date, Address, Description, CrimeCost, Crimes\n";
    quad.mapNodes(writeRestauraunt, &foodOut);
    
    for(struct Crime* crime : crimes){
        delete crime;
    }
    
    delete addresses;
    
    // I should free all of the restauraunts in the quad, but this doesn't seem
    // to work and I don't really care that much for a one-off script:
    // quad.mapNodes(deleteRestauraunt, NULL);
    
}