代码搜索结果
找到约 10,000 项符合
Storage 的代码
storage_db.po
storage_db.o storage_db.o: storage_db.c sm.h ../config.h ../sx/sx.h \
../ac-stdint.h /usr/include/stdint.h /usr/include/features.h \
/usr/include/sys/cdefs.h /usr/include/gnu/stubs.h \
/usr/incl
storage_mysql.po
storage_mysql.o storage_mysql.o: storage_mysql.c sm.h ../config.h \
../sx/sx.h ../ac-stdint.h /usr/include/stdint.h /usr/include/features.h \
/usr/include/sys/cdefs.h /usr/include/gnu/stubs.h \
storage_fs.po
storage_fs.o storage_fs.o: storage_fs.c sm.h ../config.h ../sx/sx.h \
../ac-stdint.h /usr/include/stdint.h /usr/include/features.h \
/usr/include/sys/cdefs.h /usr/include/gnu/stubs.h \
/usr/incl
storage_oracle.po
storage_oracle.o storage_oracle.o: storage_oracle.c sm.h ../config.h \
../sx/sx.h ../ac-stdint.h /usr/include/stdint.h /usr/include/features.h \
/usr/include/sys/cdefs.h /usr/include/gnu/stubs.h \
referent_storage.hpp
// Copyright David Abrahams 2002. Permission to copy, use,
// modify, sell and distribute this software is granted provided this
// copyright notice appears in all copies. This software is provided
cast_storage.hpp
//-----------------------------------------------------------------------------
// boost variant/detail/cast_storage.hpp header file
// See http://www.boost.org for updates, documentation, and revis
storage_sparse.hpp
//
// Copyright (c) 2000-2002
// Joerg Walter, Mathias Koch
//
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted
storage_order.cpp
// Copyright 2002 The Trustees of Indiana University.
// Use, modification and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or cop
storage32.c
/*
* Compound Storage (32 bit version)
* Storage implementation
*
* This file contains the compound file implementation
* of the storage interface.
*
* Copyright 1999 Francis Beaudet
*
storage32.h
/*
* Compound Storage (32 bit version)
*
* Implemented using the documentation of the LAOLA project at
*
* (Thanks to Martin Schw