Lines Matching refs:errorCode
44 StringTrieBuilder::createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode) {
45 if(U_FAILURE(errorCode)) {
49 sizeGuess, &errorCode);
50 if(U_SUCCESS(errorCode)) {
52 errorCode=U_MEMORY_ALLOCATION_ERROR;
67 UErrorCode &errorCode) {
71 createCompactBuilder(2*elementsLength, errorCode);
72 Node *root=makeNode(0, elementsLength, 0, errorCode);
73 if(U_SUCCESS(errorCode)) {
206 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) {
207 if(U_FAILURE(errorCode)) {
216 return registerFinalValue(value, errorCode);
227 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode);
235 nextNode=registerNode(node, errorCode);
242 Node *subNode=makeBranchSubNode(start, limit, unitIndex, length, errorCode);
249 node=new IntermediateValueNode(value, registerNode(node, errorCode));
252 return registerNode(node, errorCode);
259 int32_t length, UErrorCode &errorCode) {
260 if(U_FAILURE(errorCode)) {
272 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode);
278 if(U_FAILURE(errorCode)) {
283 errorCode=U_MEMORY_ALLOCATION_ERROR;
295 listNode->add(unit, makeNode(start, i, unitIndex+1, errorCode));
304 listNode->add(unit, makeNode(start, limit, unitIndex+1, errorCode));
306 Node *node=registerNode(listNode, errorCode);
311 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode);
317 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) {
318 if(U_FAILURE(errorCode)) {
323 errorCode=U_MEMORY_ALLOCATION_ERROR;
336 uhash_puti(nodes, newNode, 1, &errorCode);
338 if(U_FAILURE(errorCode)) {
346 StringTrieBuilder::registerFinalValue(int32_t value, UErrorCode &errorCode) {
347 if(U_FAILURE(errorCode)) {
357 errorCode=U_MEMORY_ALLOCATION_ERROR;
365 uhash_puti(nodes, newNode, 1, &errorCode);
367 if(U_FAILURE(errorCode)) {
