Lines Matching refs:errorCode
46 StringTrieBuilder::createCompactBuilder(int32_t sizeGuess, UErrorCode &errorCode) {
47 if(U_FAILURE(errorCode)) {
51 sizeGuess, &errorCode);
52 if(U_SUCCESS(errorCode)) {
54 errorCode=U_MEMORY_ALLOCATION_ERROR;
69 UErrorCode &errorCode) {
73 createCompactBuilder(2*elementsLength, errorCode);
74 Node *root=makeNode(0, elementsLength, 0, errorCode);
75 if(U_SUCCESS(errorCode)) {
208 StringTrieBuilder::makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode) {
209 if(U_FAILURE(errorCode)) {
218 return registerFinalValue(value, errorCode);
229 Node *nextNode=makeNode(start, limit, lastUnitIndex, errorCode);
237 nextNode=registerNode(node, errorCode);
244 Node *subNode=makeBranchSubNode(start, limit, unitIndex, length, errorCode);
251 node=new IntermediateValueNode(value, registerNode(node, errorCode));
254 return registerNode(node, errorCode);
261 int32_t length, UErrorCode &errorCode) {
262 if(U_FAILURE(errorCode)) {
274 lessThan[ltLength]=makeBranchSubNode(start, i, unitIndex, length/2, errorCode);
280 if(U_FAILURE(errorCode)) {
285 errorCode=U_MEMORY_ALLOCATION_ERROR;
297 listNode->add(unit, makeNode(start, i, unitIndex+1, errorCode));
306 listNode->add(unit, makeNode(start, limit, unitIndex+1, errorCode));
308 Node *node=registerNode(listNode, errorCode);
313 new SplitBranchNode(middleUnits[ltLength], lessThan[ltLength], node), errorCode);
319 StringTrieBuilder::registerNode(Node *newNode, UErrorCode &errorCode) {
320 if(U_FAILURE(errorCode)) {
325 errorCode=U_MEMORY_ALLOCATION_ERROR;
338 uhash_puti(nodes, newNode, 1, &errorCode);
340 if(U_FAILURE(errorCode)) {
348 StringTrieBuilder::registerFinalValue(int32_t value, UErrorCode &errorCode) {
349 if(U_FAILURE(errorCode)) {
359 errorCode=U_MEMORY_ALLOCATION_ERROR;
367 uhash_puti(nodes, newNode, 1, &errorCode);
369 if(U_FAILURE(errorCode)) {
