本文整理了Java中com.ctc.wstx.util.WordResolver.<init>()方法的一些代码示例，展示了WordResolver.<init>()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。WordResolver.<init>()方法的具体详情如下：
包路径：com.ctc.wstx.util.WordResolver
类名称：WordResolver
方法名：<init>

WordResolver.<init>介绍

暂无

代码示例

代码示例来源：origin: org.codehaus.woodstox/woodstox-core-asl

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: com.fasterxml.woodstox/woodstox-core

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: woodstox/wstx-asl

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.woodstox

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: woodstox/wstx-lgpl

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: Nextdoor/bender

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: org.codehaus.woodstox/woodstox-core-lgpl

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}

代码示例来源：origin: FasterXML/woodstox

/**
 * @return Raw character data that contains compressed structure
 *   of the word set
 */
public WordResolver construct() 
{
  char[] result;
  /* 03-Jan-2006, TSa: Special case: just one entry; if so,
   *   let's leave char array null, and just have the String
   *   array with one entry.
   */
  if (mData == null) {
    result = null;
  } else {
    constructBranch(0, 0, mWords.length);
    
    // Too big?
    if (mSize > NEGATIVE_OFFSET) {
      return null;
    }
    
    result = new char[mSize];
    System.arraycopy(mData, 0, result, 0, mSize);
  }
  return new WordResolver(mWords, result);
}