Package net.imglib2.type.logic

Examples of net.imglib2.type.logic.BitType

72
73
74
75
76
77
78
79
80
81
82
    }
    else
    {
      this.source = source;
      final int sourceDim = this.source.numDimensions();
      this.transformToSource = new MixedTransform( n, sourceDim );
      this.transformToSource.set( transformToSource );
    }

    fullViewRandomAccessible = null;
  }
View Full Code Here
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
        if ( iterableSource.supportsOptimizedCursor( interval ) )
          return new SubInterval( iterableSource );
      }
      else if ( transforms.size() == 1 && SlicingTransform.class.isInstance( transforms.get( 0 ) ) )
      {
        final SlicingTransform t = ( SlicingTransform ) transforms.get( 0 );
        final int m = t.numTargetDimensions();
        final int n = t.numSourceDimensions();

        // Check whether the slicing can be potentially optimized.
        boolean optimizable = true;

        // 1.) Slice dimensions must be mapped to a contiguous range of
        // target dimensions starting with dimension 0.
        int firstZeroDim = 0;
        for ( ; firstZeroDim < m && !t.getComponentZero( firstZeroDim ); ++firstZeroDim );
        for ( int d = firstZeroDim + 1; d < m && optimizable; ++d )
          if ( !t.getComponentZero( d ) )
            optimizable = false;

        // 2.) All slice dimensions must be mapped to a target dimension
        final int[] sourceComponent = new int[ n ];
        if ( optimizable )
        {
          Arrays.fill( sourceComponent, -1 );
          for ( int d = 0; d < m; ++d )
            if ( !t.getComponentZero( d ) )
              sourceComponent[ t.getComponentMapping( d ) ] = d;
          for ( int d = 0; d < n && optimizable; ++d )
            if ( sourceComponent[ d ] < 0 )
              optimizable = false;
        }

        if ( optimizable )
        {
//          System.out.println( "interval = " + Util.printInterval( interval ) );
          final Interval sliceInterval = t.transform( new BoundingBox( interval ) ).getInterval();
//          System.out.println( "transformed interval = " + Util.printInterval( sliceInterval ) );
          if ( iterableSource.supportsOptimizedCursor( sliceInterval ) )
          {
            // check for FlatIterationOrder
            boolean flat = FlatIterationOrder.class.isInstance( iterableSource.subIntervalIterationOrder( sliceInterval ) );
View Full Code Here
240
241
242
243
244
245
246
   * Create an {@link ArrayImg}<{@link BitType}, {@link BitArray}>.
   */
  @SuppressWarnings( "unchecked" )
  final static public ArrayImg< BitType, LongArray > bits( final long... dim )
  {
    return ( ArrayImg< BitType, LongArray > ) new ArrayImgFactory< BitType >().create( dim, new BitType() );
  }
View Full Code Here
142
143
144
145
146
147
148
   * Create an {@link PlanarImg}<{@link BitType}, {@link BitArray}>.
   */
  @SuppressWarnings( "unchecked" )
  final static public PlanarImg< BitType, LongArray > bits( final long... dim )
  {
    return ( PlanarImg< BitType, LongArray > ) new PlanarImgFactory< BitType >().create( dim, new BitType() );
  }
View Full Code Here
76
77
78
79
80
81
82
  }

  @Test
  public void testBitDefaultCellSize()
  {
    testDefaultCellSize( new BitType() );
  }
View Full Code Here
104
105
106
107
108
109
110
  }

  @Test
  public void testBitDefaultCellDimensions()
  {
    testDefaultCellDimensions( new BitType() );
  }
View Full Code Here
94
95
96
97
98
99
100
101
102
103
    Cursor<BitType> c = mask.cursor();
    /*
     * Note that axes are reversed.
     */
    while(c.hasNext()) {
      BitType t = c.next();
      c.localize(position);
      assertEquals(t.get(), position[1] >=5 && position[1] < 11 && position[0] >= 16 && position[0] <23);
    }
  }
View Full Code Here
159
160
161
162
163
164
165
166
167
168
169
    Img<BitType> mask = OverlayUtils.extractMask(iDisplay);
    assertNotNull(mask);
    Cursor<BitType> c = mask.cursor();
    double [] position = new double [2];
    while(c.hasNext()) {
      BitType t = c.next();
      position[1] = c.getDoublePosition(0);
      position[0] = c.getDoublePosition(1);
      assertEquals(t.get(), roi.contains(position));
    }
  }
View Full Code Here
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
    assertNotNull(mask);
    assertNotNull(mask);
    Cursor<BitType> c = mask.cursor();
    double [] position = new double [2];
    while(c.hasNext()) {
      BitType t = c.next();
      position[1] = c.getDoublePosition(0);
      position[0] = c.getDoublePosition(1);
      boolean inside = false;
      for (Overlay o:oo) {
        inside |= o.getRegionOfInterest().contains(position);
      }
      assertEquals(t.get(), inside);
    }
  }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
         * Boo! We have to sample from the ROI.
         */
        RealRandomAccess<BitType> roiAccess = roi.realRandomAccess();
        Cursor<BitType> c = Views.iterable(adapter).cursor();
        while(c.hasNext()) {
          BitType t = c.next();
          roiAccess.setPosition(c);
          t.set(roiAccess.get().get());
        }
      }
    }
    return mask;
  }
View Full Code Here
TOP

Related Classes of net.imglib2.type.logic.BitType

  • Jama.Matrix
  • net.imglib2.display.ARGBScreenImageExpectationChecking
  • net.imglib2.display.projector.composite.CompositeXYProjector
  • net.imglib2.display.projector.composite.CompositeXYRandomAccessibleProjector
  • net.imglib2.display.screenimage.awt.ARGBScreenImage
  • net.imglib2.display.screenimage.awt.AWTScreenImageUtil
  • net.imglib2.FinalInterval
  • net.imglib2.FlatIterationOrder
  • net.imglib2.histogram.Histogram1dTest
  • net.imglib2.histogram.HistogramNdTest
    • Copyright © 2018 www.massapicom. 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.