Package appeng.api.storage.data

Examples of appeng.api.storage.data.IAEItemStack.copy()

88
89
90
91
92
93
94
95
96
97
98
      {
        for (int x = 0; x < list.length; x++)
        {
          IAEItemStack part = list[x];
          if ( part != null )
            nodes.put( new CraftingTreeNode( cc, job, part.copy(), this, x, depth + 1 ), part.getStackSize() );
        }
      }
      else
      {
        // this is minorly different then below, this slot uses the pattern, but kinda fudges it.
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
            if ( !exhausted )
            {
              IAEItemStack is = job.checkUse( available );
              if ( is != null )
              {
                thingsUsed.add( is.copy() );
                used.add( is );
              }
            }

            bytes += available.getStackSize();
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
        if ( !exhausted )
        {
          IAEItemStack is = job.checkUse( available );
          if ( is != null )
          {
            thingsUsed.add( is.copy() );
            used.add( is );
          }
        }

        bytes += available.getStackSize();
View Full Code Here
308
309
310
311
312
313
314
315
316
317
318
      i.setCountRequestable( howManyEmitted );
      plan.addRequestable( i );
    }

    for (IAEItemStack i : used)
      plan.add( i.copy() );

    for (CraftingTreeProcess pro : nodes)
      pro.getPlan( plan );
  }
}
View Full Code Here
327
328
329
330
331
332
333
334
335
336
337
        if ( finalOutput.equals( what ) )
        {
          if ( myLastLink != null )
          {
            leftOver.add( ((CraftingLink) myLastLink).injectItems( used.copy(), type ) );
            return leftOver;
          }

          return what; // ignore it.
        }
View Full Code Here
387
388
389
390
391
392
393
394
395
396
397
          updateCPU();

          if ( myLastLink != null )
          {
            what.add( ((CraftingLink) myLastLink).injectItems( insert.copy(), type ) );
            return what;
          }

          if ( myLastLink != null )
            return ((CraftingLink) myLastLink).injectItems( (IAEItemStack) input, type );
View Full Code Here
937
938
939
940
941
942
943
944
945
946
947
    case ALL:
      throw new RuntimeException( "Invalid Operation" );
    }

    if ( is != null )
      return is.copy();

    is = what.copy();
    is.setStackSize( 0 );
    return is;
  }
View Full Code Here
452
453
454
455
456
457
458
459
460
461
462
    IAEItemStack Results = null;

    IAEItemStack l = getCellItems().findPrecise( request );
    if ( l != null )
    {
      Results = l.copy();

      if ( l.getStackSize() <= size )
      {
        Results.setStackSize( l.getStackSize() );
        if ( mode == Actionable.MODULATE )
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.