SmbResource c = new SmbFile(p, "share/") ) {
            SmbResourceLocator fl = c.getLocator();
            assertEquals("1.2.3.4", fl.getServer());
            assertEquals(SmbConstants.TYPE_SHARE, fl.getType());
            assertEquals("share", fl.getShare());
            assertEquals("\\", fl.getUNCPath());
            assertEquals("smb://1.2.3.4/share/", fl.getCanonicalURL());

      if (combined_shape.dims() < 0 ||
          combined_shape.dims() != component_shape.dims()) {
        PartialTensorShape first_shape;
        TF_RETURN_IF_ERROR(unwrap(tensors_[0].get())->Shape(&first_shape));
        return errors::Unimplemented(absl::StrCat(
            "Computing the shape of a ParallelTensor when the components do "
            "not all have the same rank is not supported. One tensor had "
            "shape ",

            "year": 1934,
            "publisher": "Dodd Mead and Company (New York)",
            "type": "Hardcover",
            "pages": 302
        },
        {
            "year": 2011,
            "publisher": "Harper Collins",
            "type": "Paperback",
            "pages": 265
        }
    ]
}
{
    "title": "The Robots of Dawn",
    "authorInfo": {
        "name": "Isaac Asimov",

  ASSERT_TRUE(TF_GetCode(status.get()) == TF_OK) << TF_Message(status.get());
  const std::vector<std::unique_ptr<ParallelTensor>>& handles = *outputs;
  const std::vector<int64_t>* shape;
  Status s = handles[0]->Shape(&shape);
  ASSERT_TRUE(s.ok());
  EXPECT_EQ(0, shape->size());
}

TEST(PARALLEL_DEVICE_LIB, TestCancelOnError) {
  std::unique_ptr<TF_Status, decltype(&TF_DeleteStatus)> status(
      TF_NewStatus(), TF_DeleteStatus);

        connectionState = 0;
    }

    synchronized SmbTree getSmbTree( String share, String service ) {
        SmbTree t;

        if( share == null ) {
            share = "IPC$";
        }
        for( Enumeration e = trees.elements(); e.hasMoreElements(); ) {
            t = (SmbTree)e.nextElement();
            if( t.matches( share, service )) {
                return t;
            }
        }

namespace tensorflow {

std::string ImmediateExecutionTensorHandle::DebugString() const {
  PartialTensorShape shape;
  std::string shape_string;
  if (Shape(&shape).ok()) {
    shape_string = shape.DebugString();
  } else {
    shape_string = "<error computing shape>";
  }
  std::string value_string;
  if (!SummarizeValue(value_string).ok()) {
    value_string = "<error computing value>";
  }

        }
        return SmbConstants.TYPE_SHARE;
    }


    /**
     * @return the service
     */
    public String getService () {
        return this.service;
    }


    /**
     * @return the share
     */
    public String getShare () {
        return this.share;
    }


    /**
     * @return whether this is a DFS share
     */
    public boolean isDfs () {

  virtual tensorflow::Status TensorHandleStatus() const;

  // Returns tensor shape. If tensor has unknown rank, shape remains untouched.
  virtual tensorflow::Status Shape(
      tensorflow::PartialTensorShape* shape) const = 0;

  // Returns tensor (full) type.
  // While there is no immediate plan to deprecate dtype and shape in favor
  // of only using full type type information, this is a future possibility.
  //

        if ( ( shareAccess & SmbConstants.FILE_SHARE_READ ) != 0 && ( shareAccess & SmbConstants.FILE_SHARE_WRITE ) != 0 ) {
            this.desiredAccess |= SHARING_DENY_NONE;
        }
        else if ( shareAccess == SmbConstants.FILE_NO_SHARE ) {
            this.desiredAccess |= SHARING_DENY_READ_WRITE_EXECUTE;
        }
        else if ( ( shareAccess & SmbConstants.FILE_SHARE_WRITE ) == 0 ) {

The MIT License (MIT)

Copyright (c) 2015 Spring, Inc.

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is