+#include <msp/core/algorithm.h>
#include <msp/fs/utils.h>
#include <msp/io/print.h>
#include "analyzer.h"
using namespace Msp;
Analyzer::Analyzer(Builder &b):
- builder(b),
- mode(DEPS),
- max_depth(0),
- full_paths(false)
+ builder(b)
{ }
void Analyzer::analyze()
depends.insert(depends.end(), tdeps.begin(), tdeps.end());
}
- depends.sort(full_paths ? target_order_full : target_order);
+ sort(depends, (full_paths ? target_order_full : target_order));
for(Target *d: depends)
build_depend_table(*d, depth+1);