partial.cxx (3a7cf181) partial.cxx (b72581eb)
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 84 unchanged lines hidden (view full) ---

93 for (std::set< rtl::OUString >::const_iterator i(excludedPaths.begin());
94 i != excludedPaths.end(); ++i)
95 {
96 sal_Int32 n = 0;
97 for (Node * p = &root_;;) {
98 rtl::OUString seg;
99 bool end = parseSegment(*i, &n, &seg);
100 if (end) {
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 84 unchanged lines hidden (view full) ---

93 for (std::set< rtl::OUString >::const_iterator i(excludedPaths.begin());
94 i != excludedPaths.end(); ++i)
95 {
96 sal_Int32 n = 0;
97 for (Node * p = &root_;;) {
98 rtl::OUString seg;
99 bool end = parseSegment(*i, &n, &seg);
100 if (end) {
101 p->children[seg] = Node();
101 p->children[seg].clear();
102 break;
103 }
104 Node::Children::iterator j(p->children.find(seg));
105 if (j == p->children.end()) {
106 break;
107 }
108 p = &j->second;
109 }

--- 24 unchanged lines hidden --- 		102 break;
103 }
104 Node::Children::iterator j(p->children.find(seg));
105 if (j == p->children.end()) {
106 break;
107 }
108 p = &j->second;
109 }

--- 24 unchanged lines hidden ---