Package org.apache.derby.iapi.sql.depend

Examples of org.apache.derby.iapi.sql.depend.Provider


            for ( int px = 0; px < providerCount; px++ )
            {
                ProviderInfo            pi = providers[ px ];
                DependableFinder    finder = pi.getDependableFinder();
                UUID                        providerID = pi.getObjectId();
                Provider                    provider = (Provider) finder.getDependable( dd, providerID );

                dm.addDependency( defDesc, provider, cm );
            }   // end loop through providers
        }
    }
View Full Code Here


              lcc.popCompilerContext(newCC);

              boolean    interferent = false;
              for (int i = 0; i < providerInfos.length; i++)
              {
                Provider provider = null;
                  provider = (Provider) providerInfos[i].
                          getDependableFinder().
                          getDependable(dd,
                          providerInfos[i].getObjectId());
                if (provider instanceof TableDescriptor)
View Full Code Here

    ** We make 2 passes - the first to count the number of persistent
     ** providers and the second to populate the array of ProviderInfos.
    */
    while (e != null && e.hasMoreElements())
    {
      Provider prov = (Provider) e.nextElement();

      if (prov.isPersistent())
      {
        numProviders++;
      }
    }

    e = pl.elements();
    retval = new ProviderInfo[numProviders];
    int piCtr = 0;
    while (e != null && e.hasMoreElements())
    {
      Provider prov = (Provider) e.nextElement();

      if (prov.isPersistent())
      {
        retval[piCtr++] = new BasicProviderInfo(
                  prov.getObjectID(),
                  prov.getDependableFinder(),
                  prov.getObjectName()
                  );
      }
    }

    return retval;
View Full Code Here

          throws StandardException
  {
    Enumeration e = pl.elements();
    while (e.hasMoreElements())
    {
      Provider pro = (Provider) e.nextElement();
      if (pro instanceof TableDescriptor)
        ((TableDescriptor) pro).setReferencedColumnMap(null);
    }
  }
View Full Code Here

    if (list == null)
      return;

    for (ListIterator depsIterator = list.listIterator(); depsIterator.hasNext(); )
    {
      Provider provider = ((Dependency) depsIterator.next()).getProvider();
       
      if (!persistentOnly || provider.isPersistent())
      {
        this.addDependency(copyTo, provider, cm, tc);
      }
    }
  }
View Full Code Here

       */
      for (ListIterator depsIterator = storedList.listIterator();
         depsIterator.hasNext(); )
      {
        Dependent       tempD;
        Provider        tempP;
        DependableFinder  finder = null;

        DependencyDescriptor depDesc = (DependencyDescriptor) depsIterator.next();

          finder = depDesc.getDependentFinder();
          tempD = (Dependent) finder.getDependable(dd, depDesc.getUUID() );

          if (providerForList != null)
          {
            // Use the provider being passed in.
            tempP = providerForList;
           
            // Sanity check the object identifiers match.
            if (SanityManager.DEBUG) {
              if (!tempP.getObjectID().equals(depDesc.getProviderID()))
              {
                SanityManager.THROWASSERT("mismatch providers");
              }
            }
          }
View Full Code Here

            for ( int px = 0; px < providerCount; px++ )
            {
                ProviderInfo            pi = providers[ px ];
                DependableFinder    finder = pi.getDependableFinder();
                UUID                        providerID = pi.getObjectId();
                Provider                    provider = (Provider) finder.getDependable( dd, providerID );

                dm.addDependency( defDesc, provider, cm );
            }   // end loop through providers
        }
    }
View Full Code Here

              lcc.popCompilerContext(newCC);

              boolean    interferent = false;
              for (int i = 0; i < providerInfos.length; i++)
              {
                Provider provider = null;
                  provider = (Provider) providerInfos[i].
                          getDependableFinder().
                          getDependable(dd,
                          providerInfos[i].getObjectId());
                if (provider instanceof TableDescriptor)
View Full Code Here

    }

        Iterator provIter = list.iterator();
        List pih = new ArrayList();
        while (provIter.hasNext()) {
            Provider p = (Provider)provIter.next();

            if (p.isPersistent()) {
        pih.add(new BasicProviderInfo(
                                        p.getObjectID(),
                                        p.getDependableFinder(),
                                        p.getObjectName()
                  ));
      }
    }

    return (ProviderInfo[]) pih.toArray(EMPTY_PROVIDER_INFO);
View Full Code Here

    ** We make 2 passes - the first to count the number of persistent
     ** providers and the second to populate the array of ProviderInfos.
    */
    while (e != null && e.hasMoreElements())
    {
      Provider prov = (Provider) e.nextElement();

      if (prov.isPersistent())
      {
        numProviders++;
      }
    }

    e = pl.elements();
    retval = new ProviderInfo[numProviders];
    int piCtr = 0;
    while (e != null && e.hasMoreElements())
    {
      Provider prov = (Provider) e.nextElement();

      if (prov.isPersistent())
      {
        retval[piCtr++] = new BasicProviderInfo(
                  prov.getObjectID(),
                  prov.getDependableFinder(),
                  prov.getObjectName()
                  );
      }
    }

    return retval;
View Full Code Here

TOP

Related Classes of org.apache.derby.iapi.sql.depend.Provider

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.