sopaLetras/builder.cpp at master · srafols/sopaLetras · GitHub

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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#include "builder.hpp"
#include "list_sort.hpp"
#include <iostream>
using namespace std;

namespace builder{


  bool  build_rec (list<hueco>::const_iterator it, const diccionario& dic,  sopa_letras& aux, const list<hueco>& forats) throw(error);
  void omplir_aleatori(sopa_letras& soap) throw(error);


  void build(const diccionario& D, const list<hueco>& Huecos, list<match>& L, sopa_letras& S) throw(error){

    sopa_letras aux=S;
    bool construible;

    if(Huecos.size()>0){

      try{
       construible=build_rec(Huecos.begin(), D, aux, Huecos);
      }
      catch(error){
	throw error(nom_mod, HuecosNoColocables, MsgHuecosNoColocables);
      }


      if(construible){

	//posem els match a la llista
	S=aux;
	list<hueco>::const_iterator ite=Huecos.begin();

	while(ite!=Huecos.end()){

	  string wd;
	  wd=S.cadena((*ite).fila(), (*ite).columna(), (*ite).longitud(), (*ite).orient());
	  L.push_back(match(wd, (*ite).fila(), (*ite).columna(), (*ite).orient()));
	  ++ite;
	}

	list_sort::sort(L);
	omplir_aleatori(S);

      }


    }


  }


  bool  build_rec (list<hueco>::const_iterator it, const diccionario& dic,  sopa_letras& aux, const list<hueco>& forats) throw(error){


    bool b=false;

    if(it== forats.end()) b=true;
    else {

      string par=aux.cadena((*it).fila(), (*it).columna(), (*it).longitud(), (*it).orient());

      list<string> p_patrons;

      dic.satisfacen_patron(par, p_patrons);

      if (p_patrons.size()==0) b=false;
      else{

	list<string>::iterator ip=p_patrons.begin();


	while(!b && ip!=p_patrons.end()){

	  aux.inserta_cadena( *ip ,(*it).fila(), (*it).columna(), (*it).orient());
	  b=build_rec(++it, dic, aux, forats);

	  --it;
	  if (!b) aux.inserta_cadena(par,(*it).fila(), (*it).columna(), (*it).orient());
	  ++ip;


	}

      }
    }
    return b;

}


  void omplir_aleatori(sopa_letras& soap) throw(error){
    string ale;
    srand((unsigned int) time(NULL));
    for(nat i=0; i<soap.num_filas(); ++i){

      for(nat j=0; j<soap.num_columnas(); ++j){


	if(soap.cadena(i, j, 1, orientacion::H)=="*"){
	  ale='A' + (rand()%('Z' - 'A'));
	  soap.inserta_cadena(ale, i, j, orientacion::H);

	}
      }

    }
  }


};