Questions tagged [apache-portable-runtime]

7 questions
4
votes
1 answer

How can I create a file using apr_file_open()

I am making the following call to the Apache Portable Runtime library (version 1.4): result = apr_file_open( &file, // new file handle pathname, // file name APR_FOPEN_CREATE | // create file if not there APR_FOPEN_EXCL |…
PP.
  • 10,764
  • 7
  • 45
  • 59
2
votes
2 answers

How to compile a APR test script

Its a long time since I've used C but now I'm trying to compile a short script that gets server-stats from the Apache-Portable-Runtime (APR). Header files located at /usr/include/apr-1/apr*.h and libs are located at /usr/lib64/libapr-1.* Source…
CoffeeMonster
  • 2,160
  • 4
  • 20
  • 34
1
vote
1 answer

Compile simple Apache Portable Runtime 1.5.2 program

Following steps from here and here I tried to compile a simple program using apr 1.5.2 and apr-utils 1.5.4. Here is the code of the program: #include #include int main(int argc, char *argv[]) { apr_pool_t…
Sergey
  • 1,166
  • 14
  • 27
1
vote
2 answers

APR (Apache Portable Runtime) 1.2.2 RegEx?

Does APR 1.2.2 have regex support? Any documentation or tutorials on using it? The documentation sucks. Like really bad.
John Dibling
  • 99,718
  • 31
  • 186
  • 324
0
votes
1 answer

Is APR(Apache Portable Runtime) hook efficient?

I want to implement function_A by using APR hook ,but I wonder if it is efficient. Does anyone use APR hook or know the working principle?And it will be good if any detail figures or data is shown. Thank you very much!
Sapete
  • 3
  • 3
0
votes
1 answer

Compiling issues : Apache headers not found - CentOS 6.x

I am trying to build libwurfl (https://github.com/filosganga/libwurfl) on CentOS. I have installed all the dependent libraries, but I am having issues with running configure for libwurfl. I am constantly getting issues with Apache headers not found…
Coder
  • 45
  • 5
0
votes
0 answers

Where is the best place to build a data structure in Apache module?

I want to develop an online path searching web service. It searches the path in graph G which costs minimal edge distance sum between two vertices V1,V2. The problem is that G is incredibly large. It contains nearly 10 million edges. If G is small…
Izumi Kawashima
  • 1,197
  • 11
  • 25