*/
    int CAP_LEVEL_II_OPLOCKS = 0x0080;
    /**
     * Lock and read operation is supported capability.
     */
    int CAP_LOCK_AND_READ = 0x0100;
    /**
     * NT find operations are supported capability.
     */
    int CAP_NT_FIND = 0x0200;
    /**
     * DFS operations are supported capability.
     */
    int CAP_DFS = 0x1000;
    /**

            // Host is empty -> triggers master browser path
            URL anyUrlWithEmptyHost = new URL("file:/");
            when(locator.getURL()).thenReturn(anyUrlWithEmptyHost);
            // Simulate failure to find master browser (UnknownHost wrapped in CIFSException)
            when(locator.getAddress()).thenThrow(new CIFSException("no master", new UnknownHostException("MB")));

 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
 * either express or implied. See the License for the specific language
 * governing permissions and limitations under the License.
 */
package org.codelibs.fess.crawler.client.http.form;

import java.io.IOException;

 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package okhttp3

import java.security.cert.Certificate

   * available, a new Cell is created. Otherwise, if the slot
   * exists, a CAS is tried.  Retries proceed by "double hashing",
   * using a secondary hash (Marsaglia XorShift) to try to find a
   * free slot.
   *
   * The table size is capped because, when there are more threads
   * than CPUs, supposing that each thread were bound to a CPU,
   * there would exist a perfect hash function mapping threads to

inagi.tokyo.jp
inami.toyama.jp
inami.wakayama.jp
inashiki.ibaraki.jp
inatsuki.fukuoka.jp
inawashiro.fukushima.jp
inazawa.aichi.jp
inc
inc.hk
incheon.kr
ind.br
ind.gt
ind.in
ind.kw
ind.mom
ind.tn
independent-commission.uk
independent-inquest.uk
independent-inquiry.uk
independent-panel.uk
independent-review.uk
inderoy.no
inderøy.no
indigena.bo

 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License
 * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.cache;

 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License
 * is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
 * or implied. See the License for the specific language governing permissions and limitations under
 * the License.
 */

package com.google.common.cache;

	if len(in.ifdefStack) == 0 {
		in.Error("unmatched #endif")
	}
	in.ifdefStack = in.ifdefStack[:len(in.ifdefStack)-1]
}

// #include processing.
func (in *Input) include() {
	// Find and parse string.
	tok := in.Stack.Next()
	if tok != scanner.String {
		in.expectText("expected string after #include")
	}
	name, err := strconv.Unquote(in.Stack.Text())
	if err != nil {

		select {
		case <-ctx.Done():
			done.Store(true)
			return metaCacheEntriesSorted{}, ctx.Err()
		case r := <-resultsDone:
			return r, resErr
		}
	}
}

// findFirstPart will find the part with 0 being the first that corresponds to the marker in the options.
// io.ErrUnexpectedEOF is returned if the place containing the marker hasn't been scanned yet.