1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
#include "algorithms/map_mma.hh"
#include "MMACdb.hh"
#include "properties/Coordinate.hh"
#include "properties/Symbol.hh"
#include "SympyCdb.hh"
using namespace cadabra;
//#define DEBUG 1
map_mma::map_mma(const Kernel& k, Ex& tr, const std::string& head)
: Algorithm(k, tr), head_(head)
{
}
bool map_mma::can_apply(iterator st)
{
// For \components nodes we need to map at the level of the individual
// component values, not the top \components node.
if(*st->name=="\\components") return false;
if(*st->name=="\\equals") return false;
if(*st->name=="\\comma") return false;
left.clear();
index_factors.clear();
index_map_t ind_free, ind_dummy;
classify_indices(st, ind_free, ind_dummy);
bool still_ok=true;
// Determine if any of the free indices are harmless (Coordinates or Symbols).
for(auto& ind: ind_free) {
const Coordinate *cdn=kernel.properties.get<Coordinate>(ind.second, true);
const Symbol *smb=kernel.properties.get<Symbol>(ind.second, true);
if(cdn==0 && smb==0) {
still_ok=false;
break;
}
}
if(still_ok && ind_dummy.size()==0) return true;
// In a product, it is still possible that there is a sub-product which
// contains no indices.
if(*st->name=="\\prod") {
// Find the factors in the product which have a proper index on them. Do this by
// starting at the index, and if it is not coordinate or symbol, then go up until we
// reach the first child level of the product.
for(auto& ind: ind_free) {
const Coordinate *cdn=kernel.properties.get<Coordinate>(ind.second, true);
const Symbol *smb=kernel.properties.get<Symbol>(ind.second, true);
if(cdn==0 && smb==0) {
auto fac=tr.parent(ind.second);
while(tr.parent(fac)!=iterator(st))
fac=tr.parent(fac);
index_factors.insert(fac);
}
}
for(auto& ind: ind_dummy) {
const Coordinate *cdn=kernel.properties.get<Coordinate>(ind.second, true);
const Symbol *smb=kernel.properties.get<Symbol>(ind.second, true);
if(cdn==0 && smb==0) {
auto fac=tr.parent(ind.second);
while(tr.parent(fac)!=iterator(st))
fac=tr.parent(fac);
index_factors.insert(fac);
}
}
sibling_iterator sib=tr.begin(st);
while(sib!=tr.end(st)) {
if(index_factors.find(iterator(sib))==index_factors.end())
left.push_back(sib);
++sib;
}
return left.size()>0;
}
return false;
}
Algorithm::result_t map_mma::apply(iterator& it)
{
#ifdef DEBUG
std::cerr << "map_mma on " << Ex(it) << std::endl;
#endif
std::vector<std::string> wrap, args;
if(head_.size()>0)
wrap.push_back(head_);
if(left.size()>0) {
Ex prod("\\prod");
for(auto& fac: left)
prod.append_child(prod.begin(), fac);
auto top=prod.begin();
// std::cerr << "Feeding to sympy " << prod << std::endl;
MMA::apply_mma(kernel, prod, top, wrap, args, "");
// Now remove the non-index carrying factors and replace with
// the factors of 'prod' just simplified.
tr.insert_subtree(*left.begin(), top);
// std::cerr << "Before erasing " << Ex(it) << std::endl;
for(auto& kl: left)
tr.erase(kl);
// std::cerr << "After erasing " << Ex(it) << std::endl;
return result_t::l_applied;
}
else {
MMA::apply_mma(kernel, tr, it, wrap, args, "");
it.skip_children();
return result_t::l_applied;
}
}
|
