Изменение содержимого вектора из лямбда функции

struct Pointf
{
    int x, y;
    float type;
    bool operator ==(Pointf c);
    bool operator <(const Pointf &c) const;
    Pointf operator =(Door d);
};
} /* namespace generator */
 
    bool Pointf::operator ==(Pointf c){
        return (this->x == c.x && this->y == c.y && this->type == c.type) ? true : false;
    }
    Pointf Pointf::operator =(Door d){
        Pointf c = {d.x, d.y, 0};
        return c;
    }
    bool Pointf::operator <(const Pointf &c)const{
        return this->type > c.type;
    }

#include <iostream>
#include <queue>
#include <limits.h>
using namespace std;
 
struct Pointf
{
    int x, y;
    float type;
    bool operator ==(Pointf c);
    bool operator <(const Pointf &c) const;
};
 
    bool Pointf::operator ==(Pointf c){
        return (this->x == c.x && this->y == c.y && this->type == c.type) ? true : false;
    }
 
    bool Pointf::operator <(const Pointf &c)const{
        return this->type > c.type;
    }
    
int сalcCostForDijkstra(int** tieMap, int x, int y){
        return 0;
    }
 
int main() {
        Pointf start, finish;
        int xz, yz, wz, hz;
        int** tileMap;
        std::queue<Pointf> active;
        Pointf point = {start.x, start.y, 0};
        std::vector<unsigned int> distance(wz * hz, INT_MAX);
        std::vector<bool> visited(wz * hz, false);
        distance[start.x - xz + (start.y - yz) * wz] = 0;
        visited[start.x - xz + (start.y - yz) * wz] = true;
        active.push(point);
 
        auto func = [distance, visited, active, tileMap, xz, yz, wz](int x, int y, int type){
            Pointf p2 = {x, y, (float)(CalcCostForDijkstra(tileMap, x, y) + type)};
            if(distance.at(p2.x - xz + (p2.y - yz) * wz) > p2.type)
                distance.at(p2.x - xz + (p2.y - yz) * wz) = p2.type;
            if(visited[p2.x - xz + (p2.y - yz) * wz] == false){
                visited[p2.x - xz + (p2.y - yz) * wz] = true;
                active.push(p2);
            }
        };
    return 0;
}